← Back to all news
arXiv Machine Learning August 26, 2026 By Yixin Tao, Weiqiang Zheng

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.

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

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.

By Mengxiao Zhang
More like this →
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$.

By Runlong Zhou, Zihan Zhang, Maryam Fazel, Simon S. Du
reinforcement-learning
More like this →
arXiv Machine Learning
Sep 15

Nearly Minimax-Optimal Regret for Linear Contextual Bandits with Arbitrary Adaptive Action Sets

arXiv:2609.15170v1 Announce Type: new Abstract: We study stochastic linear contextual bandits with arbitrary action menus that may depend on the fixed parameter and the interaction history. We establ...

By Tianyuan Jin
More like this →
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.

By Princewill Okoroafor
benchmarks
More like this →
arXiv Machine Learning
Oct 9

Toward Optimal Regret in Adversarial MDPs with Stochastic Hard Constraints

arXiv:2610. 12153v1 Announce Type: new Abstract: We study episodic constrained Markov decision processes with adversarial losses under stochastic hard constraints.

By Qian Zuo, Francesco Emanuele Stradi
reinforcement-learningsafety
More like this →
arXiv Statistics ML
Oct 1

Lower Bounds for Linear-Oracle Online Learning

arXiv:2609.38375v1 Announce Type: new Abstract: Can a constant number of linear minimizations per round improve on the $T^{3/4}$ regret rate of online Frank-Wolfe on general convex sets? Weibel et al...

By Mohit Sinha
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea