Fetching the paper…
Reading the bibliography…
We introduce algorithms that use predictions from machine learning applied to the input to circumvent worst-case analysis.
Scheduling with Predictions and the Price of Misprediction
Mitzenmacher, Michael. 2019 · 1902
Earlier work this paper cites.
(Learned) Frequency Estimation Algorithms under Zipfian Distribution
Aamand, Anders, Indyk, Piotr, and Vakilian, Ali. 2019 · 1908
Earlier work this paper cites.
A study of replacement algorithms for a virtual-storage computer
Belady, Laszlo A. 1966 · 1966
Earlier work this paper cites.
Space/time trade-offs in hash coding with allowable errors
Bloom, Burton H. 1970 · 1970
Earlier work this paper cites.
Spearman’s footrule as a measure of disarray
Diaconis, P., and Graham, R.L. 1977 · 1977
Earlier work this paper cites.
Competitive Paging Algorithms
Fiat, Amos, Karp, Richard M., Luby, Michael, McGeoch, Lyle A., Sleator, Daniel Dominic, and Young, Neal E. 1991 · 1991
Earlier work this paper cites.
How useful is old information?
Mitzenmacher, Michael. 2000 · 2000
Earlier work this paper cites.
Finding frequent items in data streams
Charikar, Moses, Chen, Kevin, and Farach-Colton, Martin. 2002 · 2002
Earlier work this paper cites.
Network applications of bloom filters: A survey
Broder, Andrei, and Mitzenmacher, Michael. 2004 · 2004
Cited alongside, same era.
An improved data stream summary: the count-min sketch and its applications
Cormode, Graham, and Muthukrishnan, Shan. 2005 · 2005
Cited alongside, same era.
Scheduling despite inexact job-size information
Wierman, Adam, and Nuyens, Misja. 2008 · 2008
Cited alongside, same era.
The adwords problem: online keyword matching with budgeted bidders under random permutations
Devanur, Nikhil R., and Hayes, Thomas P. 2009 · 2009
Cited alongside, same era.
Optimal online assignment with forecasts
Vee, Erik, Vassilvitskii, Sergei, and Shanmugasundaram, Jayavel. 2010 · 2010
Cited alongside, same era.
Performance modeling and design of computer systems: queueing theory in action
Harchol-Balter, Mor. 2013 · 2013
Online algorithms with advice: a survey
Boyar, Joan, Favrholdt, Lene M, Kudahl, Christian, Larsen, Kim S, and Mikkelsen, Jesper W. 2016 · 2016
Later among the works it cites.
Revenue Optimization with Approximate Bid Predictions
Medina, Andres Muñoz, and Vassilvitskii, Sergei. 2017 · 2017
Later among the works it cites.
The case for learned index structures
Kraska, Tim, Beutel, Alex, Chi, Ed H, Dean, Jeffrey, and Polyzotis, Neoklis. 2018 · 2018
Later among the works it cites.
Competitive Caching with Machine Learned Advice
Lykouris, Thodoris, and Vassilvitskii, Sergei. 2018 · 2018
Later among the works it cites.
A model for learned bloom filters and optimizing by sandwiching
Mitzenmacher, Michael. 2018 · 2018
Later among the works it cites.
Improving online algorithms via ml predictions
Purohit, Manish, Svitkina, Zoya, and Kumar, Ravi. 2018 · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
The sample complexity of revenue maximization
Cole, Richard, and Roughgarden, Tim. 2014 · 2014
Cited alongside, same era.
PSBS: Practical size-based scheduling
Dell’Amico, Matteo, Carra, Damiano, and Michiardi, Pietro. 2015 · 2015
Cited alongside, same era.
Learning-Based Frequency Estimation Algorithms
Hsu, Chen-Yu, Indyk, Piotr, Katabi, Dina, and Vakilian, Ali. 2019 · 2019
Later among the works it cites.
Near-Optimal Bounds for Online Caching with Machine Learned Advice
Rohatgi, Dhruv. 2020 · 2020
Closest in time.