Competitive Caching with Machine Learned Advice
From MaRDI portal
Abstract: Traditional online algorithms encapsulate decision making under uncertainty, and give ways to hedge against all possible future events, while guaranteeing a nearly optimal solution as compared to an offline optimum. On the other hand, machine learning algorithms are in the business of extrapolating patterns found in the data to predict the future, and usually come with strong guarantees on the expected generalization error. In this work we develop a framework for augmenting online algorithms with a machine learned oracle to achieve competitive ratios that provably improve upon unconditional worst case lower bounds when the oracle has low error. Our approach treats the oracle as a complete black box, and is not dependent on its inner workings, or the exact distribution of its errors. We apply this framework to the traditional caching problem -- creating an eviction strategy for a cache of size . We demonstrate that naively following the oracle's recommendations may lead to very poor performance, even when the average error is quite low. Instead we show how to modify the Marker algorithm to take into account the oracle's predictions, and prove that this combined approach achieves a competitive ratio that both (i) decreases as the oracle's error decreases, and (ii) is always capped by , which can be achieved without any oracle input. We complement our results with an empirical evaluation of our algorithm on real world datasets, and show that it performs well empirically even using simple off-the-shelf predictions.
Recommendations
Cited in
(35)- Machine learning advised algorithms for the ski rental problem with a discount
- Near-Optimal Bounds for Online Caching with Machine Learned Advice
- Learning-augmented algorithms for online subset sum
- Secretary and online matching problems with machine learned advice
- Canadian traveller problem with predictions
- Online minimum spanning trees with weight predictions
- Online interval scheduling with predictions
- Advice complexity bounds for online delayed \(\mathcal{F} \)-node-, \(H\)-node- and \(H\)-edge-deletion problems
- Contract scheduling with predictions
- Learning-augmented maximum flow
- Online unit profit knapsack with predictions
- Mechanism design with predictions for facility location games with candidate locations
- Online budget-feasible mechanism design with predictions
- Online fair division for personalized 2-value instances
- Real-time peak-demand minimization with energy storage using competitive ratio
- Tree coloring with predictions
- Online bin covering with frequency predictions
- Comparing the hardness of online minimization and maximization problems with predictions
- On the complexity of algorithms with predictions for dynamic graph problems
- A survey of online knapsack problems
- Shortest paths without a map, but with an entropic regularizer
- Online time-windows TSP with predictions
- Boosting double coverage for k-server via imperfect predictions
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Online delay management on a single train line with predictions
- Design and characterization of strategy-proof mechanisms for two-facility game on a line
- Mechanism design with predictions for facility location games with candidate locations
- Scheduling with speed predictions
- A learning-augmented algorithm for the parking permit problem with three permit types
- Online interval scheduling with predictions
- Strategic facility location via predictions
- Prediction-augmented mechanism design for weighted facility location
- Utilitarian distortion with predictions
- On approximability of _2² min-sum clustering
- Smoothed analysis of online metric problems
This page was built for publication: Competitive Caching with Machine Learned Advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056414)
