{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T15:46:12Z","timestamp":1781279172846,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":77,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000936","name":"Gordon and Betty Moore Foundation","doi-asserted-by":"publisher","award":["GBMF4554"],"award-info":[{"award-number":["GBMF4554"]}],"id":[{"id":"10.13039\/100000936","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004703","name":"Bloomberg L.P.","doi-asserted-by":"publisher","award":["Research Grant"],"award-info":[{"award-number":["Research Grant"]}],"id":[{"id":"10.13039\/100004703","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF1710082, W911NF2010081"],"award-info":[{"award-number":["W911NF1710082, W911NF2010081"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR00112020003"],"award-info":[{"award-number":["HR00112020003"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008536","name":"Amazon Web Services","doi-asserted-by":"publisher","award":["Machine Learning Research Award"],"award-info":[{"award-number":["Machine Learning Research Award"]}],"id":[{"id":"10.13039\/100008536","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Amazon","award":["Research Award"],"award-info":[{"award-number":["Research Award"]}]},{"DOI":"10.13039\/100008047","name":"Carnegie Mellon University","doi-asserted-by":"publisher","award":["Center for Machine Learning and Health Fellowship"],"award-info":[{"award-number":["Center for Machine Learning and Health Fellowship"]}],"id":[{"id":"10.13039\/100008047","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Eric and Wendy Schmidt","award":["Schmidt Futures program"],"award-info":[{"award-number":["Schmidt Futures program"]}]},{"DOI":"10.13039\/100000002","name":"NIH (National Institutes of Health)","doi-asserted-by":"publisher","award":["R01GM122935"],"award-info":[{"award-number":["R01GM122935"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["IIS-1901403, IIS-1618714, CCF-1535967, CCF-1910321, SES-1919453, IIS-1718457, IIS-1617590, CCF-1733556, DBI-1937540"],"award-info":[{"award-number":["IIS-1901403, IIS-1618714, CCF-1535967, CCF-1910321, SES-1919453, IIS-1718457, IIS-1617590, CCF-1733556, DBI-1937540"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","award":["Faculty Fellowship"],"award-info":[{"award-number":["Faculty Fellowship"]}],"id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451036","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"919-932","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design"],"prefix":"10.1145","author":[{"given":"Maria-Florina","family":"Balcan","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4110-4431","authenticated-orcid":false,"given":"Dan","family":"DeBlasio","sequence":"additional","affiliation":[{"name":"University of Texas at El Paso, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Travis","family":"Dick","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0118-5516","authenticated-orcid":false,"given":"Carl","family":"Kingsford","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tuomas","family":"Sandholm","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4891-1367","authenticated-orcid":false,"given":"Ellen","family":"Vitercik","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Conference on Learning Theory (COLT).","author":"Alabi Daniel","year":"2019","unstructured":"Daniel Alabi, Adam Tauman Kalai, Katrina Ligett, Cameron Musco, Christos Tzamos, and Ellen Vitercik. 2019. Learning to Prune: Speeding up Repeated Computations. In Conference on Learning Theory (COLT)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5802\/aif.938"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the International Conference on Learning Representations (ICLR).","author":"Balcan Maria-Florina","year":"2020","unstructured":"Maria-Florina Balcan, Travis Dick, and Manuel Lang. 2020. Learning to Link. In Proceedings of the International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI).","author":"Balcan Maria-Florina","year":"2020","unstructured":"Maria-Florina Balcan, Travis Dick, and Wesley Pegden. 2020. Semi-bandit Optimization in the Dispersed Setting. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI)."},{"key":"e_1_3_2_1_5_1","volume-title":"Beyond Worst Case Analysis of Algorithms","author":"Balcan Maria-Florina","unstructured":"Maria-Florina Balcan and Tim Roughgarden. 2020. Data-Driven Algorithm Design. In Beyond Worst Case Analysis of Algorithms. Cambridge University Press."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.50"},{"key":"e_1_3_2_1_7_1","volume-title":"How Much Data Is Sufficient to Learn High-performing Algorithms? Generalization Guarantees for Data-driven Algorithm Design. arXiv preprint arXiv:1908.02894","author":"Balcan Maria-Florina","year":"2021","unstructured":"Maria-Florina Balcan, Dan DeBlasio, Travis Dick, Carl Kingsford, Tuomas Sandholm, and Ellen Vitercik. 2021. How Much Data Is Sufficient to Learn High-performing Algorithms? Generalization Guarantees for Data-driven Algorithm Design. arXiv preprint arXiv:1908.02894, 2021."},{"key":"e_1_3_2_1_8_1","volume-title":"International Conference on Machine Learning (ICML)","author":"Balcan Maria-Florina","year":"2018","unstructured":"Maria-Florina Balcan, Travis Dick, Tuomas Sandholm, and Ellen Vitercik. 2018. Learning to Branch. International Conference on Machine Learning (ICML), 2018."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00064"},{"key":"e_1_3_2_1_10_1","volume-title":"Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems. Conference on Learning Theory (COLT)","author":"Balcan Maria-Florina","year":"2017","unstructured":"Maria-Florina Balcan, Vaishnavh Nagarajan, Ellen Vitercik, and Colin White. 2017. Learning-Theoretic Foundations of Algorithm Configuration for Combinatorial Partitioning Problems. Conference on Learning Theory (COLT), 2017."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS).","author":"Balcan Maria-Florina","year":"2016","unstructured":"Maria-Florina Balcan, Tuomas Sandholm, and Ellen Vitercik. 2016. Sample Complexity of Automated Mechanism Design. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219166.3219217"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5721"},{"key":"e_1_3_2_1_14_1","volume-title":"Refined Bounds for Algorithm Configuration: The Knife-edge of Dual Class Approximability. In International Conference on Machine Learning (ICML).","author":"Balcan Maria-Florina","year":"2020","unstructured":"Maria-Florina Balcan, Tuomas Sandholm, and Ellen Vitercik. 2020. Refined Bounds for Algorithm Configuration: The Knife-edge of Dual Class Approximability. In International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_1_15_1","volume-title":"Generalization in Portfolio-based Algorithm Selection. In AAAI Conference on Artificial Intelligence (AAAI).","author":"Balcan Maria-Florina","year":"2021","unstructured":"Maria-Florina Balcan, Tuomas Sandholm, and Ellen Vitercik. 2021. Generalization in Portfolio-based Algorithm Selection. In AAAI Conference on Artificial Intelligence (AAAI)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800057.808692"},{"key":"e_1_3_2_1_17_1","volume-title":"Learning Complexity of Simulated Annealing. In International Conference on Artificial Intelligence and Statistics (AISTATS).","author":"Blum Avrim","year":"2020","unstructured":"Avrim Blum, Chen Dan, and Saeed Seddighin. 2020. Learning Complexity of Simulated Annealing. In International Conference on Artificial Intelligence and Statistics (AISTATS)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.54"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00116"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01726210"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591867"},{"key":"e_1_3_2_1_22_1","volume-title":"Parameter Advising for Multiple Sequence Alignment","author":"DeBlasio Dan","unstructured":"Dan DeBlasio and John D Kececioglu. 2018. Parameter Advising for Multiple Sequence Alignment. Springer."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897553"},{"key":"e_1_3_2_1_24_1","volume-title":"Quality measures for protein alignment benchmarks. Nucleic acids research, 38, 7","author":"Edgar Robert C","year":"2010","unstructured":"Robert C Edgar. 2010. Quality measures for protein alignment benchmarks. Nucleic acids research, 38, 7, 2010. Pages 2145\u20132153."},{"key":"e_1_3_2_1_25_1","volume-title":"Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).","author":"Elkind Edith","year":"2007","unstructured":"Edith Elkind. 2007. Designing and learning optimal finite support auctions. In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS).","author":"Bamas Etienne","year":"2020","unstructured":"\\'Etienne Bamas, Andreas Maggiori, Lars Rohwedder, and Ola Svensson. 2020. Learning Augmented Energy Minimization via Speed Scaling. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS).","author":"Bamas Etienne","year":"2020","unstructured":"\\'Etienne Bamas, Andreas Maggiori, and Ola Svensson. 2020. The Primal-Dual method for Learning Augmented Algorithms. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.11.003"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8667(03)00078-9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-9-14"},{"key":"e_1_3_2_1_31_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS).","author":"Garg Vikas","year":"2018","unstructured":"Vikas Garg and Adam Kalai. 2018. Supervising Unsupervised Learning. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055427"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS).","author":"Gonczarowski Yannai A","year":"2018","unstructured":"Yannai A Gonczarowski and S Matthew Weinberg. 2018. The Sample Complexity of Up-to-\\varepsilon Multi-Dimensional Revenue Maximization. In Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(82)90398-9"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914085"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316325"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1050276"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185430"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.147.3664.1462"},{"key":"e_1_3_2_1_41_1","volume-title":"Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI).","author":"Horvitz Eric","year":"2001","unstructured":"Eric Horvitz, Yongshao Ruan, Carla Gomez, Henry Kautz, Bart Selman, and Max Chickering. 2001. A Bayesian Approach to Tackling Hard Computational Problems. In Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI)."},{"key":"e_1_3_2_1_42_1","volume-title":"Proceedings of the International Conference on Learning Representations (ICLR).","author":"Hsu Chen-Yu","year":"2019","unstructured":"Chen-Yu Hsu, Piotr Indyk, Dina Katabi, and Ali Vakilian. 2019. Learning-based frequency estimation algorithms. In Proceedings of the International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2861"},{"key":"e_1_3_2_1_44_1","first-page":"2002","article-title":"An Experimental Study of Polylogarithmic, Fully Dynamic","volume":"6","author":"Iyer Raj","year":"2002","unstructured":"Raj Iyer, David Karger, Hariharan Rahul, and Mikkel Thorup. 2002. An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. ACM Journal of Experimental Algorithmics, 6, Dec., 2002. Pages 4\u2013es. issn:1084-6654","journal-title":"Connectivity Algorithms. ACM Journal of Experimental Algorithmics"},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings of the European Conference on Artificial Intelligence (ECAI).","author":"Kadioglu Serdar","year":"2010","unstructured":"Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, and Kevin Tierney. 2010. ISAC-Instance-Specific Algorithm Configuration.. In Proceedings of the European Conference on Artificial Intelligence (ECAI)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/281"},{"key":"e_1_3_2_1_47_1","volume-title":"Adaptive Algorithm Configuration. Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS)","author":"Kleinberg Robert","year":"2019","unstructured":"Robert Kleinberg, Kevin Leyton-Brown, Brendan Lucier, and Devon Graham. 2019. Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration. Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS), 2019."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538906"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1181369"},{"key":"e_1_3_2_1_50_1","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI). Pages 232\u2013237","author":"Likhodedov Anton","year":"2004","unstructured":"Anton Likhodedov and Tuomas Sandholm. 2004. Methods for Boosting Revenue in Combinatorial Auctions. In Proceedings of the National Conference on Artificial Intelligence (AAAI). Pages 232\u2013237."},{"key":"e_1_3_2_1_51_1","volume-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI).","author":"Likhodedov Anton","year":"2005","unstructured":"Anton Likhodedov and Tuomas Sandholm. 2005. Approximating Revenue-Maximizing Combinatorial Auctions. In Proceedings of the National Conference on Artificial Intelligence (AAAI)."},{"key":"e_1_3_2_1_52_1","first-page":"4","article-title":"Breaking TADs: how alterations of chromatin domains result in disease","volume":"32","author":"~nez Dar\u00edo G","year":"2016","unstructured":"Dar\u00edo G Lupi\u00e1\\~nez, Malte Spielmann, and Stefan Mundlos. 2016. Breaking TADs: how alterations of chromatin domains result in disease. Trends in Genetics, 32, 4, 2016. Pages 225\u2013237.","journal-title":"Trends in Genetics"},{"key":"e_1_3_2_1_53_1","volume-title":"International Conference on Machine Learning (ICML).","author":"Lykouris Thodoris","year":"2018","unstructured":"Thodoris Lykouris and Sergei Vassilvitskii. 2018. Competitive caching with machine learned advice. In International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_1_54_1","volume-title":"A guide to experimental algorithmics","author":"McGeoch Catherine C","unstructured":"Catherine C McGeoch. 2012. A guide to experimental algorithmics. Cambridge University Press."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2011.11.005"},{"key":"e_1_3_2_1_56_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS). Pages 464\u2013473","author":"Mitzenmacher Michael","year":"2018","unstructured":"Michael Mitzenmacher. 2018. A model for learned bloom filters and optimizing by sandwiching. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS). Pages 464\u2013473."},{"key":"e_1_3_2_1_57_1","volume-title":"International Conference on Machine Learning (ICML).","author":"Mohri Mehryar","year":"2014","unstructured":"Mehryar Mohri and Andr\u00e9s Mu\\~noz. 2014. Learning Theory and Algorithms for revenue optimization in second price auctions with reserve. In International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_1_58_1","volume-title":"Learning Simple Auctions. In Conference on Learning Theory (COLT).","author":"Morgenstern Jamie","year":"2016","unstructured":"Jamie Morgenstern and Tim Roughgarden. 2016. Learning Simple Auctions. In Conference on Learning Theory (COLT)."},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2018.11.010"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.77.11.6309"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0406011101"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0406010101"},{"key":"e_1_3_2_1_63_1","volume-title":"Convergence of Stochastic Processes","author":"Pollard David","unstructured":"David Pollard. 1984. Convergence of Stochastic Processes. Springer."},{"key":"e_1_3_2_1_64_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS). Pages 9661\u20139670","author":"Purohit Manish","year":"2018","unstructured":"Manish Purohit, Zoya Svitkina, and Ravi Kumar. 2018. Improving online algorithms via ML predictions. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS). Pages 9661\u20139670."},{"key":"e_1_3_2_1_65_1","volume-title":"Aggregation and Revelation of Preferences","author":"Roberts Kevin","unstructured":"Kevin Roberts and J-J Laffont. 1979. The characterization of implementable social choice rules. In Aggregation and Revelation of Preferences. North-Holland Publishing Company."},{"key":"e_1_3_2_1_66_1","volume-title":"Handbook of Market Design","author":"Sandholm Tuomas","unstructured":"Tuomas Sandholm, Zvika Neeman, Alvin Roth, and Nir Vulkan. 2013. Very-Large-Scale Generalized Combinatorial Multi-Attribute Auctions: Lessons from Conducting \\60 Billion of Sourcing. In Handbook of Market Design. Oxford University Press."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1398"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0134(20000701)40:1<6::AID-PROT30>3.0.CO;2-7"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(72)90019-2"},{"key":"e_1_3_2_1_70_1","volume-title":"On the uniform convergence of relative frequencies of events to their probabilities.. Theory of Probability and its Applications, 16, 2","author":"Vapnik Vladimir","year":"1971","unstructured":"Vladimir Vapnik and Alexey Chervonenkis. 1971. On the uniform convergence of relative frequencies of events to their probabilities.. Theory of Probability and its Applications, 16, 2, 1971. Pages 264\u2013280."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(76)90202-4"},{"key":"e_1_3_2_1_73_1","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS).","author":"Wei Alexander","year":"2020","unstructured":"Alexander Wei and Fred Zhang. 2020. Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms. In Proceedings of the Annual Conference on Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_3_2_1_74_1","volume-title":"International Conference on Machine Learning (ICML).","author":"Weisz Gell\u00e9rt","year":"2018","unstructured":"Gell\u00e9rt Weisz, Andr\u00e1s Gy\u00f6rgy, and Csaba Szepesv\u00e1ri. 2018. \\scshape LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration. In International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_1_75_1","volume-title":"International Conference on Machine Learning (ICML).","author":"Weisz Gell\u00e9rt","year":"2019","unstructured":"Gell\u00e9rt Weisz, Andr\u00e1s Gy\u00f6rgy, and Csaba Szepesv\u00e1ri. 2019. \\scshape CapsAndRuns: An improved method for approximately optimal algorithm configuration. In International Conference on Machine Learning (ICML)."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2490"},{"key":"e_1_3_2_1_77_1","volume-title":"RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI).","author":"Xu Lin","year":"2011","unstructured":"Lin Xu, Frank Hutter, Holger H Hoos, and Kevin Leyton-Brown. 2011. Hydra-MIP: Automated algorithm configuration and selection for mixed integer programming. In RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI)."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451036","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451036","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":77,"alternative-id":["10.1145\/3406325.3451036","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451036","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}