arXiv Machine Learning
Optimal Alternating Regret for Online Learning and Games
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Aug 27
Minimax Alternating Regret for the Experts Problem and Online Convex Optimization
arXiv:2608. 25182v1 Announce Type: cross Abstract: In this paper, we study alternating regret in online convex optimization (OCO), motivated by the success of alternating learning dynamics in two-player games.
arXiv Machine Learning
Jul 23
Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence
arXiv:2607. 19854v1 Announce Type: new Abstract: We study horizon-free regret minimization for finite-horizon time-homogeneous tabular Markov decision processes with $S$ states, $A$ actions, horizon $H$, and per-trajectory total reward bounded by $1$.
arXiv Machine Learning
Aug 3
Fast Rates for Swap-Agnostic Learning of Proper Losses
arXiv:2607. 28856v1 Announce Type: new Abstract: Swap-agnostic learning strengthens classical agnostic learning by allowing the comparator to select a different hypothesis on each level set of the learner's predictions.
arXiv Machine Learning
Aug 6
Sublogarithmic Swap Regret in Multiplayer General-Sum Games via Hybrid Regularization
arXiv:2608. 04149v1 Announce Type: cross Abstract: Swap regret governs the rate at which uncoupled learning dynamics converge to correlated equilibria in multiplayer general-sum games.
arXiv Machine Learning
Jul 15
A Geometric Approach to Constrained Online Learning
arXiv:2605. 21107v2 Announce Type: replace Abstract: We study constrained online convex optimization with adversarial time-varying constraints.
arXiv Machine Learning
Aug 18
Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Bandits
arXiv:2608. 15996v1 Announce Type: new Abstract: We study second-order path-length regret in adversarial $K$-armed bandits against oblivious loss sequences.