2024/02/13 by Shinsaku Sakaue, Han Bao, Sakaue, Shinsaku +5 · 2 citations
Computer Science · #Data Stream Mining Techniques #Distributed Sensor Networks and Detection Algorithms #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning and ELM
paper · pdf · doi:10.48550/arxiv.2402.08180
openalex publication_date 2024/02/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.