arXiv Machine Learning
Exact-Form Regret for Gradient Descent, Mirror Descent and Follow-the-Regularized-Leader
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
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.
arXiv Machine Learning
Sep 14
Block-Norm Geometries for Online Mirror Descent with Sparse Losses
The paper investigates how the choice of geometry in online mirror descent affects performance, particularly when loss gradients are sparse. It introduces randomized block‑norm mirror maps that interpolate between Euclidean and entropic geometries, achieving polynomial‑in‑dimension regret improvements over standard methods for various convex sets. The authors also demonstrate that naive alternation between mirror maps can lead to linear regret and propose a Hedge‑based meta‑algorithm that competes with the best mirror map in a finite portfolio, achieving near‑optimal regret for random block geometries.
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.
arXiv Machine Learning
Jun 17
Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferences
arXiv:2602. 23116v3 Announce Type: replace Abstract: We consider the problem of regularized best-response max-regret minimization in online RLHF under general preferences and bandit feedback.
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
Online Convex Optimization with Dueling Feedback
arXiv:2608. 15050v1 Announce Type: new Abstract: We study online convex optimization with dueling (pairwise comparison) feedback, where the learner observes only a binary preference between two queried points.