arXiv Machine Learning By Hailiang Zhao, Peng Chen, Xueyan Tang, Jianwei Yin, Shuiguang Deng

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

Read the original on arXiv Machine Learning →

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.

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

arXiv Machine Learning
Aug 4

T-TAMER: Provably Taming Trade-offs in ML Serving

arXiv:2509. 22992v2 Announce Type: replace Abstract: As machine learning models continue to grow in size and complexity, efficient serving faces increasingly broad trade-offs spanning accuracy, latency, resource usage, and other objectives.

By Yuanyuan Yang, Ruimin Zhang, Jamie Morgenstern, Haifeng Xu
arXiv Machine Learning
Jun 2

Learning-Augmented Scalable Linear Assignment Problem Optimization via Neural Dual Warm-Starts

arXiv:2605. 09382v2 Announce Type: replace Abstract: The Linear Assignment Problem is a fundamental combinatorial optimization task where classical exact solvers ensure optimality but suffer from an $\mathcal{O}(N^{3})$ bottleneck, while recent neural approximations struggle with scalability and exactness.

By Ilay Yavlovich, Jad Agbaria, Muhamed Mhamed, Nir Weinberger, Jose Yallouz