{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,31]],"date-time":"2026-10-31T08:51:58Z","timestamp":1793436718379,"version":"4.5.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"7","license":[{"start":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:00:00Z","timestamp":1655769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>Seeking a new approach that goes beyond worst-case analysis.<\/jats:p>","DOI":"10.1145\/3528087","type":"journal-article","created":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T14:29:42Z","timestamp":1655821782000},"page":"33-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["Algorithms with predictions"],"prefix":"10.1145","volume":"65","author":[{"given":"Michael","family":"Mitzenmacher","sequence":"first","affiliation":[{"name":"Harvard School of Engineering and Applied Sciences, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergei","family":"Vassilvitskii","sequence":"additional","affiliation":[{"name":"Google Research, New York, NY"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,21]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020","author":"Antoniadis A.","year":"2020","unstructured":"Antoniadis, A. et al. Secretary and online matching problems with machine learned advice. In Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, H. Larochelle et al., Eds. NeurIPS 2020 (Dec. 6--12 (virtual) 2020)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.13"},{"key":"e_1_2_1_3_1","volume-title":"Data-driven algorithm design. CoRR abs\/2011.07177","author":"Balcan M.","year":"2020","unstructured":"Balcan, M. Data-driven algorithm design. CoRR abs\/2011.07177 (2020)."},{"key":"e_1_2_1_4_1","volume-title":"Advances in Neural Information Processing Systems","author":"Dinitz M.","year":"2021","unstructured":"Dinitz, M. et al. Faster matchings via learned duals. In Advances in Neural Information Processing Systems (2021), M. Ranzato, A. et al., Eds., vol. 34, Curran Associates, Inc., 10393--10406."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467623"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 7th International Conference on Learning Representations, ICLR 2019","author":"Hsu C.","year":"2019","unstructured":"Hsu, C. et al. Learning-based frequency estimation algorithms. In Proceedings of the 7th International Conference on Learning Representations, ICLR 2019, (New Orleans, LA, USA, May 6--9, 2019); OpenReview.net."},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 2018 International Conference on Management of Data. G. Das, C.M. Jermaine, and P.A. Bernstein, Eds. SIGMOD Conference 2018","author":"Kraska T.","year":"2018","unstructured":"Kraska, T. et al. The case for learned index structures. In Proceedings of the 2018 International Conference on Management of Data. G. Das, C.M. Jermaine, and P.A. Bernstein, Eds. SIGMOD Conference 2018 (Houston, TX, USA, June 10--15, 2018), 489--504."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447579"},{"key":"e_1_2_1_9_1","volume-title":"Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018","author":"Mitzenmacher M.","year":"2018","unstructured":"Mitzenmacher, M. A model for learned BLOOM filters and optimizing by sandwiching. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, S. Bengio et al., Eds. (Dec. 3--8, 2018, Montr\u00e9al, Canada (2018), 462--471."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976830.1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108637435.037"},{"key":"e_1_2_1_12_1","unstructured":"ML4A 2021---Machine Learning for Algorithms (July 2021); https:\/\/bit.ly\/3wThaVs"},{"key":"e_1_2_1_13_1","volume-title":"Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018","author":"Purohit M.","year":"2018","unstructured":"Purohit, M., Svitkina, Z., and Kumar, R. Improving online algorithms via ML predictions. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018. S. Bengio et al., Eds. NeurIPS 2018 (Dec. 3--8, 2018), Montr\u00e9al, Canada (2018), 9684--9693."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108637435"},{"key":"e_1_2_1_15_1","series-title":"LIPIcs","first-page":"1","volume-title":"13th Innovations in Theoretical Computer Science Conference, ITCS","author":"Scully Z.","year":"2022","unstructured":"Scully, Z., Grosof, I., and Mitzenmacher, M. Uniform bounds for scheduling with job size estimates. In 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, Jan.--Feb. 3, 2022, Berkeley, CA, USA (2022), M. Braverman, Ed., vol. 215 of LIPIcs, Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, pp. 114:1--114:30."},{"key":"e_1_2_1_16_1","unstructured":"STOC 2020 - Workshop 5: Algorithms with Predictions. https:\/\/bit.ly\/3wThgwi"},{"key":"e_1_2_1_17_1","volume-title":"9th International Conference on Learning Representations, ICLR 2021","author":"Vaidya K.","year":"2021","unstructured":"Vaidya, K. et al. Partitioned learned BLOOM filters. In 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3--7, 2021 (2021), OpenReview.net."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528087","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:25Z","timestamp":1750186945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,21]]},"references-count":17,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1145\/3528087"],"URL":"https:\/\/doi.org\/10.1145\/3528087","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,21]]},"assertion":[{"value":"2022-06-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}