Online Structured Prediction with Fenchel--Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss
Not on the map. Why?
Abstract (arXiv)
This paper studies online structured prediction with full-information feedback. For online multiclass classification, Van der Hoeven (2020) established finite surrogate regret bounds, which are independent of the time horizon, by introducing an elegant exploit-the-surrogate-gap framework. However, this framework has been limited to multiclass classification primarily because it relies on a classification-specific procedure for converting estimated scores to outputs. We extend the exploit-the-surrogate-gap framework to online structured prediction with Fenchel--Young losses, a large family of surrogate losses that includes the logistic loss for multiclass classification as a special case, obtaining finite surrogate regret bounds in various structured prediction problems. To this end, we propose and analyze randomized decoding, which converts estimated scores to general structured outputs. Moreover, by applying our decoding to online multiclass classification with the logistic loss, we obtain a surrogate regret bound of O(| U |F2), where U is the best offline linear estimator and | · |F denotes the Frobenius norm. This bound is tight up to logarithmic factors and improves the previous bound of O(d| U |F2) due to Van der Hoeven (2020) by a factor of d, the number of classes.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 31 of its 55 references that are in the map. First posted on arXiv 13 Feb 2024.
Builds on
31 of 55 references.
References · 31
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2019Online Learning: A Modern Introduction Using Convex Optimizationcited by 407
- 2017Smart "Predict, then Optimize"cited by 332
- 2018Black-Box Reductions for Parameter-free Online Learning in Banach Spacescited by 124
- 2019Learning with Fenchel-Young Lossescited by 117
- 2018SparseMAP: Differentiable Sparse Structured Inferencecited by 62
- 2020Fast Rates for Contextual Linear Optimizationcited by 43
- 2018Logistic Regression: The Importance of Being Impropercited by 40
- 2020A General Framework for Consistent Structured Prediction with Implicit Loss Embeddingscited by 35
- 2020Structured Prediction with Partial Labelling through the Infimum Losscited by 34
- 2016A Consistent Regularization Approach for Structured Predictioncited by 33
- 2014Logistic Regression: Tight Bounds for Stochastic and Online Optimizationcited by 30
19 more
- 2017On Structured Prediction Theory with Calibrated Convex Surrogate Lossescited by 23
- 2019An Embedding Framework for Consistent Polyhedral Surrogatescited by 21
- 2019Structured Prediction with Projection Oraclescited by 21
- 2020Fast Rates for Online Prediction with Abstentioncited by 19
- 2021Beyond Bandit Feedback in Online Multiclass Classificationcited by 14
- 2018Sharp Analysis of Learning with Discrete Lossescited by 13
- 2021Mixability made efficient: Fast online multiclass logistic regressioncited by 12
- 2019Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Casecited by 11
- 2019Revisiting the Approximate Carath'eodory Problem via the Frank-Wolfe Algorithmcited by 11
- 2021Fast rates in structured predictioncited by 11
- 2021Efficient Methods for Online Multiclass Logistic Regressioncited by 10
- 2019A Smoother Way to Train Structured Prediction Modelscited by 9
- 2020Weston-Watkins Hinge Loss and Ordered Partitionscited by 9
- 2020Consistent Structured Prediction with Max-Min Margin Markov Networkscited by 9
- 2020Exploiting the Surrogate Gap in Online Multiclass Classificationcited by 9
- 2021Frank-Wolfe with a Nearest Extreme Point Oraclecited by 8
- 2022Consistent Polyhedral Surrogates for Top-k Classification and Variantscited by 8
- 2021On the Consistency of Max-Margin Lossescited by 5
- 2020FPRAS Approximation of the Matrix Permanent in Practicecited by 2
Built on by
Citing papers per year: 2024: 2; 2025: 5.
7 papers.
- 2025Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel-Young Loss Perspective and Gap-Dependent Regret Analysiscited by 7
- 2024Proper losses regret at least 1/2-ordercited by 3
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Lossescited by 2
- 2024Neural Active Learning Meets the Partial Monitoring Frameworkcited by 1
- 2025Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Lossescited by 1
- 2025Bandit and Delayed Feedback in Online Structured Predictioncited by 1
- 2025Non-Stationary Online Structured Prediction with Surrogate Lossescited by 0
- 2025Non-Stationary Online Structured Prediction with Surrogate Losses8 Oct 2025
- 2025Establishing Linear Surrogate Regret Bounds for Convex Smooth Losses via Convolutional Fenchel-Young Losses14 May 2025
- 2025Bandit and Delayed Feedback in Online Structured Prediction26 Feb 2025
- 2025Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Losses7 Feb 2025
- 2025Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel-Young Loss Perspective and Gap-Dependent Regret Analysis23 Jan 2025
- 2024Proper losses regret at least 1/2-order15 Jul 2024
- 2024Neural Active Learning Meets the Partial Monitoring Framework14 May 2024