Optimal Regret for Online Storage Control via Cumulative Policies

arXiv:2609.21262 · eess.SY, cs.SY, math.OC · Submitted 2026-09-18 · Read on arXiv

eess.SY, cs.SY, math.OC

Submitted: 2026-09-18

Updated: 2026-09-18

Terminology

• Regret — 27× in this paper · explained in 3 episodes
• Benchmark — 9× in this paper · explained in 2 episodes

Sources

Related papers

• One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
• A Geometric Decision Procedure for STL Feasibility and Repair
• Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems
• Policy-Level Recursive Self-Improvement for Embodied AI with a Criticality World Model
• Minimal Experiments for Robust Stabilization: Information, Spectral Geometry, and Duration
• Decentralized Power-Optimal Coordination for Spacecraft Swarms Using Time-Varying Magnetorquer Actuation