← Back to all news
arXiv Machine Learning October 15, 2026 By Michael Sullins, Ian A. Kash

IR-PRM+ with Previous-Utility Prediction: Constant Regret and Best-Iterate Convergence

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
Jun 5

Regret Minimization with Adaptive Opponents in Repeated Games

arXiv:2606. 06486v1 Announce Type: new Abstract: In this paper, we study regret minimization in repeated games with \emph{adaptive} opponents who can respond based on histories of play.

By Mingyang Liu, Asuman Ozdaglar, Tiancheng Yu, Kaiqing Zhang
More like this →
arXiv Machine Learning
Aug 11

Regret, equilibrium, and learning in games: A guided tour

arXiv:2608. 09389v1 Announce Type: cross Abstract: This note aims to serve as an entry point to the literature on learning in games, a topic with significant theoretical appeal and a wide range of applications -- from machine learning and data science to economics and beyond.

By Panayotis Mertikopoulos
agentsreinforcement-learningsafety
More like this →
arXiv AI
Jul 28

Training with (Swap) Regret Loss in a Single-Layer Self-Attention Model: A Case Study on the Probability Simplex

arXiv:2607. 23333v1 Announce Type: cross Abstract: We revisit the regret loss framework introduced in Park et al.

By Chanwoo Park, Asuman Ozdaglar
More like this →
arXiv Machine Learning
Sep 22

A Horizon-Independent Regret Bound for Optimistic Hedge in General-Sum Games

arXiv:2609.22839v1 Announce Type: cross Abstract: Can simple learning rules keep their regret bounded in self-play? Recent work achieves constant regret bounds through modified regularization and hig...

By Junsoo Ha
reinforcement-learning
More like this →
arXiv AI
Jun 2

Efficient Exploration for Iterative Nash Preference Optimization

arXiv:2606. 01382v1 Announce Type: cross Abstract: Preference alignment is central to improving large language models, but standard reward-based formulations can be restrictive when human preferences are cyclic, non-transitive, or otherwise not representable by a scalar reward.

By Tianlong Nan, Xiaopeng Li, Christian Kroer, Tianyi Lin
llmsfine-tuningbenchmarkssafety
More like this →
arXiv Machine Learning
Oct 7

Linear Bandits under Exact Sliding-Window Constraints

arXiv:2610. 08745v1 Announce Type: new Abstract: We study linear bandits under exact sliding-window constraints, where every consecutive block of actions must belong to a prescribed feasible set.

By Seyed Mohammad Hadi Hosseini, Yasin Abbasi-Yadkori, Sattar Vakili
benchmarks
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