arXiv (All)
open access
Dynamic Regret in Online Convex Optimization with Indicator Switching Costs
We study dynamic regret in online convex optimization with an \emph{indicator switching cost}: a fixed penalty incurred whenever two consecutive decisions differ. This captures startup overheads such as server activation, model deployment, and cache updates, and on a bounded domain it recovers norm-
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
- Parameter-Free Dynamic Regret for Online Convex Optimization under Heavy-Tailed Noise#411038
- OnlineCache: Learning Dynamic Caching Policies with Error Correction for Efficient Diffusion Inference#422263
- Exact oracle complexity for function-value suboptimality under weighted initial conditions#1118072
- Parameter-Free Dynamic Regret under Heavy-Tailed Noise#986311
- Consensus time for asynchronous $\ell^p$ relaxation: graph dependence#926733
Record · ID 1104755
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