Learning-Augmented Algorithms
Overview
The field studies how predictions can help algorithms make better decisions without making them depend on perfect advice. Common approaches blend predictions with robust online strategies, measure performance as prediction error changes, or use predictions to guide search, warm-start optimization, and reduce sampling or memory costs. Applications include scheduling, caching, matching, clustering, graph problems, and mathematical optimization, with guarantees often expressed as trade-offs between performance with accurate predictions and worst-case robustness. Tight bounds are now known for some problems, but a key tension remains: practical gains must be weighed against prediction costs, distribution shift, and whether theoretical guarantees reflect end-to-end system performance.
Latest papers
54 papers4 papers in the last four weeks, down 20% on the four weeks before. 0.0% of all new papers.