arXiv (All)
open access
Online Algorithms with a Sample: Tight Bounds and Adversarial Robustness
Suppose an online algorithm is given an unbiased $p$-sample of its input as offline advice; can the algorithm exploit the sample to achieve beyond-worst-case performance? We study this online algorithms with a sample (OAS) model. We show a tight $O\left(\log (1/p) \cdot \log m + \log n\right)$-compe
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Evaluating Language Model Safety Across Long Adversarial Conversations#1142958
- On the Escaping Efficiency of Distributed Adversarial Training Algorithms#1156209
- Oracle-Efficient Online Classification with Stochastic Inputs and Adversarial Outputs#1118833
- Beyond Empirical Support: Structured Outlier Generation via Sinkhorn Optimal Transport#1106169
- UnIte: Uncertainty-based Iterative Document Sampling for Domain Adaptation in Information Retrieval#614998
Record · ID 1036278
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive