Showing cs.LGShow all
2 papers · 1 filter
cs.LG2024
Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
Mohammadreza Daneshvaramoli, Helia Karisani, Adam Lechowicz +3
This paper introduces a family of learning-augmented algorithms for online knapsack problems that achieve near Pareto-optimal consistency-robustness trade-offs through a simple com…
cs.LG2023
Online Algorithms with Uncertainty-Quantified Predictions
Bo Sun, Jerry Huang, Nicolas Christianson +3
The burgeoning field of algorithms with predictions studies the problem of using possibly imperfect machine learning predictions to improve online algorithm performance. While near…