arXiv:2607. 23310v1 Announce Type: cross Abstract: We study an online variant of discrete fair division under generalized assignment budget constraints.
By Saar Cohen, Nicholas Teh, Paul W. Goldberg, Michael J. Wooldridge
arXiv:2602. 20403v2 Announce Type: replace Abstract: We study distributionally robust online learning, where a risk-averse learner updates decisions sequentially to guard against worst-case distributions drawn from a Wasserstein ambiguity set centered at past observations.
By Guixian Chen, Salar Fattahi, Soroosh Shafiee
arXiv:2606. 22831v2 Announce Type: replace-cross Abstract: This paper studies learning-augmented online weighted vertex cover with local advice and a tradeoff parameter $\lambda \in (0,1)$.
By Tianhang Lu, Runtian Ren, Shengcai Liu
arXiv:2606. 01342v1 Announce Type: cross Abstract: Learning-augmented paging has been extensively studied in recent years.
By Peng Chen, Hailiang Zhao, Xueyan Tang, Yixuan Wang, Shuiguang Deng
Learning-augmented algorithms combine fallible predictions with formal performance guarantees. This survey reviews prediction interfaces, error measures, consistency–robustness trade-offs, and five construction mechanisms across online optimization, caching, learned data structures, graph problems, and mechanism design. It distinguishes theorem-level upper bounds from matched asymptotic dependence, separates formal guarantees from empirical evidence, and outlines open problems in cost-aware prediction, endogenous error, semantic predictors, and benchmarking.
By Hailiang Zhao, Peng Chen, Xueyan Tang, Jianwei Yin, Shuiguang Deng
arXiv:2606. 05380v1 Announce Type: cross Abstract: We present learning-augmented algorithms for two general classes of online minimization problems: metrical task systems and laminar set cover.
By Christian Coester, Alexa Tudose, Alexander Turoczy