Dec-BFTRL: Squre-Root Regret for Decentralized Online Upper-Linearizable Optimization under Separation Access with Application to Continuous Submodular Maximization

arXiv:2608.30271 · math.OC, cs.AI, cs.LG · Submitted 2026-08-31 · Read on arXiv

math.OC, cs.AI, cs.LG

Submitted: 2026-08-31

Updated: 2026-09-05

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Regret — 39× in this paper · explained in 3 episodes
• Accuracy — 12× in this paper · explained in 1 episode
• Spectral Gap — 2× in this paper · explained in 5 episodes
• Abstraction — 1× in this paper · explained in 1 episode
• Adversarial Model — 1× in this paper · explained in 1 episode
• Benchmark — 1× in this paper · explained in 2 episodes
• Homogeneity — 1× in this paper · explained in 2 episodes
• Objective Function — 1× in this paper · explained in 2 episodes
• Regularization — 1× in this paper · explained in 3 episodes
• Resource Constraints — 1× in this paper · explained in 3 episodes

Sources

• Improved Projection-free Online Continuous Submodular Maximization
• Improved Approximate Regret for Decentralized Online Continuous Submodular Maximization via Reductions

Related papers

• Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
• Adam-HNAG: A Convergent Reformulation of Adam with Accelerated Rate
• Incremental Learning in Mirror Flows
• Online Control via Counterfactual Tracking
• Asynchronous Replanning in Two Population Linear Quadratic Mean Field Games: Information Requirements and Stability
• Petrov-Galerkin operator inference with application to stability-encouraging identification