arXiv AI By Fredy Pokou (MRE, CRIStAL)

Learning-Augmented Online Allocation under Unreliable Advice: Robustness, Exposure Fairness, and Distribution Shift

Read the original on arXiv AI →

The paper introduces a learning‑augmented algorithm for online allocation that handles unreliable predictions. It addresses finite candidate sets, irreversible decisions, and exposure constraints by combining advice with a conservative fallback and a fairness correction. The authors prove consistency and robustness under bounded‑error assumptions and demonstrate experimentally that the method remains stable against adversarial advice while substantially reducing exposure disparity.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Aug 12

Risk-Averse Wasserstein Distributionally Robust Online Learning

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 Machine Learning
Sep 7

Learning-Augmented Algorithms: Guarantees, Construction Mechanisms, and System-Level Implications

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