arXiv (All)
open access
Optimally Pacing Budget Spending and Learning
We establish near-optimal regret bounds for budget-constrained online learning against arbitrary classes of budget-pacing experts in the adversarial setting. In particular, given any class of $F$ experts and a candidate budget pacing schedule, we provide a full-information algorithm which obtains re
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
- Budget-Aware LLM Discovery via Cost-Calibrated Frontier Utility#1116386
- Finite-sample certification of coverage regret for budgeted document selection under adaptive stratified auditing#1345030
- Confidence Horizons#1076117
- Compression and federated learning: an approach to frugal machine learning. (Compression et apprentissage fédéré: une approche pour l'apprentissage machine frugal).#489533
- Performance budgeting - 2023#139962
Record · ID 1248001
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