arXiv Machine Learning
Efficient Online Inverse Optimization with $O(d)$ Regret
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
Sep 24
Tight Regret Bound for Online Inverse Linear Optimization via Multiscale Matrix Weights
arXiv:2609. 26978v1 Announce Type: cross Abstract: We study online inverse linear optimization with a fixed unknown linear utility: in each round, an environment presents a compact action set, the learner recommends an action from it, and the environment returns an action that maximizes the utility over the same set.
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
Aug 4
A Perturbation Approach to Unconstrained Linear Bandits
arXiv:2603. 28201v3 Announce Type: replace Abstract: We revisit the standard perturbation-based approach of Abernethy et al.
arXiv Machine Learning
Aug 12
High-Dimensional Calibration from Swap Regret
arXiv:2505. 21460v2 Announce Type: replace Abstract: We study online calibration of multi-dimensional forecasts over an arbitrary convex set $P \subset \mathbb{R}^d$ relative to an arbitrary norm $|\cdot|$.
arXiv Machine Learning
Jul 30
Parameter-Free Dynamic Regret for Online Convex Optimization under Heavy-Tailed Noise
arXiv:2607. 27073v1 Announce Type: new Abstract: We study online convex optimization (OCO) in non-stationary environments under heavy-tailed noise, where the stochastic gradient oracle admits only a finite $p$-th central moment for some $p \in (1, 2]$.
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.