Metraipolis › archive › dc_fadef7e609d2
Optimal Regret for Online Storage Control via Cumulative Policies — arXiv:2609.21262
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21262
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:05:01.597Z
- SHA-256 of the archived text
228033ff0439fb695c32d97b743d3ad077bb7f10c0a554fa08de8839c9db574b- Stable URL of this page
https://metraipolis.com/documento/dc_fadef7e609d2
How to cite
Optimal Regret for Online Storage Control via Cumulative Policies — arXiv:2609.21262 — arXiv (en), https://arxiv.org/abs/2609.21262 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fadef7e609d2 (Metraipolis archive dc_fadef7e609d2, sha256 228033ff0439fb695c32d97b743d3ad077bb7f10c0a554fa08de8839c9db574b)
BibTeX
@misc{dcfadef7e609d2,
title = {Optimal Regret for Online Storage Control via Cumulative Policies — arXiv:2609.21262},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21262},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fadef7e609d2; sha256 228033ff0439fb695c32d97b743d3ad077bb7f10c0a554fa08de8839c9db574b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21262. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study online control of a scalar storage system with adversarial nonnegative arrivals, known retention coefficient, and convex costs depending on both state and action. Each action must respect current resource availability and is chosen before the current arrival and cost function are revealed. For the existing simplex disturbance-action policy class, we give an exact reparameterization by cumulative allocation fractions and a decay-weighted projected subgradient update. The resulting regret bound is independent of policy memory length. For fixed retention coefficient and cost constants, the controller achieves $O(\sqrt T)$ regret against the best fixed infinite-memory policy in this class, using $O(\log T)$ memory and arithmetic operations per round and one cost-subgradient query. A storage-specific block construction gives a matching lower bound against every causal feasible controller, including randomized controllers. Writing $\tau=(1-\alpha)^{-1}$, the minimax expected regret is $\Theta(\sqrt T\min\{T,\tau\}^{3/2})$ for every finite-memory simplex policy class and its infinite-memory extension, when $\alpha\in[1/2,1)$, $T\ge4$, and the positive cost constants are fixed. This identifies the joint horizon and retention-time dependence for these policy benchmarks.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.OC).
Categorie arXiv: Systems and Control (eess.SY) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.21262 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T01:45:31.264Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).