arXiv (All)
open access
Projection-Free Bandit Online Optimization for Multi-Agent Systems with Dynamic Regret
This paper investigates distributed online optimization for multi-agent dynamical systems with constrained inputs and time-varying cost functions. While online convex optimization offers a principal framework for sequential decision-making, existing online learning and optimization algorithms typica
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
- Projection-Free Bandit Online Optimization for Multi-Agent Systems with Dynamic Regret#797959
- Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations#984979
- Softmax gradient policy for variance minimization and risk-averse multi armed bandits#1063878
- Nonstationary Generalized Linear Bandits with Discounted Online Mirror Descent#1117435
- Online Convex Optimization with Dueling Feedback#612481
Record · ID 799382
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