{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T04:48:31Z","timestamp":1777783711554,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"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":[],"published-print":{"date-parts":[[2022,6,21]]},"DOI":"10.1145\/3531146.3533232","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T14:27:10Z","timestamp":1655735230000},"page":"1827-1858","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["On the Existence of Simpler Machine Learning Models"],"prefix":"10.1145","author":[{"given":"Lesia","family":"Semenova","sequence":"first","affiliation":[{"name":"Duke University, USA"}]},{"given":"Cynthia","family":"Rudin","sequence":"additional","affiliation":[{"name":"Duke University, USA"}]},{"given":"Ronald","family":"Parr","sequence":"additional","affiliation":[{"name":"Duke University, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022873112823"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053605000000282"},{"key":"e_1_3_2_1_3_1","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","author":"Bartlett L","year":"2002","unstructured":"Peter\u00a0L Bartlett and Shahar Mendelson. 2002. Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research 3, Nov (2002), 463\u2013482.","journal-title":"Journal of Machine Learning Research 3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1903070116"},{"key":"e_1_3_2_1_5_1","volume-title":"Mar","author":"Bousquet Olivier","year":"2002","unstructured":"Olivier Bousquet and Andr\u00e9 Elisseeff. 2002. Stability and generalization. Journal of Machine Learning Research 2, Mar (2002), 499\u2013526."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1009213726"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009715923555"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2007.07.024"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/ab39d9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2020.3818"},{"key":"e_1_3_2_1_11_1","volume-title":"Support-vector networks. Machine learning 20, 3","author":"Cortes Corinna","year":"1995","unstructured":"Corinna Cortes and Vladimir Vapnik. 1995. Support-vector networks. Machine learning 20, 3 (1995), 273\u2013297."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning(Proceedings of Machine Learning Research).","author":"Coston Amanda","year":"2021","unstructured":"Amanda Coston, Ashesh Rambachan, and Alexandra Chouldechova. 2021. Characterizing fairness over the set of good models under selective labels. In Proceedings of the 38th International Conference on Machine Learning(Proceedings of Machine Learning Research)."},{"key":"e_1_3_2_1_13_1","unstructured":"Alexander D\u2019Amour Katherine Heller Dan Moldovan Ben Adlam Babak Alipanahi Alex Beutel Christina Chen Jonathan Deaton Jacob Eisenstein Matthew\u00a0D Hoffman 2020. Underspecification presents challenges for credibility in modern machine learning. arXiv preprint arXiv:2011.03395(2020)."},{"key":"e_1_3_2_1_14_1","volume-title":"Approximation Algorithms for Complex Systems. Vol.\u00a03","author":"Davydov Oleg","unstructured":"Oleg Davydov. 2011. Algorithms and error bounds for multivariate piecewise constant approximation. In Approximation Algorithms for Complex Systems. Vol.\u00a03. Springer, Berlin, Heidelberg, 27\u201345."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002816"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 34th International Conference on Machine Learning(Proceedings of Machine Learning Research, Vol.\u00a070)","author":"Dinh Laurent","year":"2017","unstructured":"Laurent Dinh, Razvan Pascanu, Samy Bengio, and Yoshua Bengio. 2017. Sharp minima can generalize for deep nets. In Proceedings of the 34th International Conference on Machine Learning(Proceedings of Machine Learning Research, Vol.\u00a070). 1019\u20131028."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-020-00264-0"},{"key":"e_1_3_2_1_18_1","volume-title":"UCI Machine Learning Repository","author":"Dua Dheeru","unstructured":"Dheeru Dua and Casey Graff. 2019. UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences."},{"key":"e_1_3_2_1_19_1","first-page":"1","article-title":"All models are wrong, but many are useful: Learning a variable\u2019s importance by studying an entire class of prediction models simultaneously","volume":"20","author":"Fisher Aaron","year":"2019","unstructured":"Aaron Fisher, Cynthia Rudin, and Francesca Dominici. 2019. All models are wrong, but many are useful: Learning a variable\u2019s importance by studying an entire class of prediction models simultaneously. Journal of Machine Learning Research 20, 177 (2019), 1\u201381.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.1.1"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the 21st International Conference on Neural Information Processing Systems","author":"Kakade M.","year":"2008","unstructured":"Sham\u00a0M. Kakade, Karthik Sridharan, and Ambuj Tewari. 2008. On the complexity of linear prediction: risk bounds, margin bounds, and regularization. In Proceedings of the 21st International Conference on Neural Information Processing Systems (Vancouver, British Columbia, Canada) (NIPS\u201908). Curran Associates Inc., Red Hook, NY, USA, 793\u2013800."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016304"},{"key":"e_1_3_2_1_23_1","volume-title":"On large-batch training for deep learning: Generalization gap and sharp minima. arXiv preprint arXiv:1609.04836 (appeared at ICLR 2017)","author":"Keskar Nitish\u00a0Shirish","year":"2016","unstructured":"Nitish\u00a0Shirish Keskar, Dheevatsa Mudigere, Jorge Nocedal, Mikhail Smelyanskiy, and Ping Tak\u00a0Peter Tang. 2016. On large-batch training for deep learning: Generalization gap and sharp minima. arXiv preprint arXiv:1609.04836 (appeared at ICLR 2017) (2016)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1015362183"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2968618.2968674"},{"key":"e_1_3_2_1_27_1","volume-title":"Prediction uncertainty and optimal experimental design for learning dynamical systems. Chaos 26, 6","author":"Letham Benjamin","year":"2016","unstructured":"Benjamin Letham, Portia\u00a0A. Letham, Cynthia Rudin, and Edward Browne. 2016. Prediction uncertainty and optimal experimental design for learning dynamical systems. Chaos 26, 6 (2016)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1214\/009053604000000463"},{"key":"e_1_3_2_1_29_1","unstructured":"David Madras James Atwood and Alex D\u2019Amour. 2019. Detecting underspecification with local ensembles. arXiv preprint arXiv:1910.09573 (appeared at ICLR 2020 under the title \u201cDetecting Extrapolation with Local Ensembles\u201d)(2019)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2012.2223460"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/3524938.3525566"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2010.00740.x"},{"key":"e_1_3_2_1_33_1","volume-title":"Advanced Lectures on Machine Learning","author":"Mendelson Shahar","unstructured":"Shahar Mendelson. 2003. A few notes on statistical learning theory. In Advanced Lectures on Machine Learning. Springer, 40\u00a0pages."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/ac3a74"},{"key":"e_1_3_2_1_35_1","volume-title":"Advances in Neural Information Processing Systems, C.\u00a0J.\u00a0C. Burges, L.\u00a0Bottou, M.\u00a0Welling, Z.\u00a0Ghahramani, and K.\u00a0Q","author":"Natarajan Nagarajan","unstructured":"Nagarajan Natarajan, Inderjit\u00a0S Dhillon, Pradeep\u00a0K Ravikumar, and Ambuj Tewari. 2013. Learning with noisy labels. In Advances in Neural Information Processing Systems, C.\u00a0J.\u00a0C. Burges, L.\u00a0Bottou, M.\u00a0Welling, Z.\u00a0Ghahramani, and K.\u00a0Q. Weinberger (Eds.). Vol.\u00a026. Curran Associates, Inc."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/3122009.3122033"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01835995"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129758"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344196"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-019-0048-x"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1162\/99608f92.6ed64b30"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1024691352"},{"key":"e_1_3_2_1_43_1","unstructured":"Lesia Semenova Cynthia Rudin and Ronald Parr. 2019. A study in Rashomon curves and volumes: A new perspective on generalization and model simplicity in machine learning. arXiv preprint arXiv:abs\/1908.01755(2019)."},{"key":"e_1_3_2_1_44_1","volume-title":"Advances in Neural Information Processing Systems, Vol.\u00a023. Curran Associates","author":"Srebro Nathan","unstructured":"Nathan Srebro, Karthik Sridharan, and Ambuj Tewari. 2010. Smoothness, Low Noise and Fast Rates. In Advances in Neural Information Processing Systems, Vol.\u00a023. Curran Associates, Inc., 2199\u20132207."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2567726"},{"key":"e_1_3_2_1_46_1","volume-title":"On combining machine learning with decision making. Machine Learning (ECML-PKDD journal track) 97, 1-2","author":"Tulabandhula Theja","year":"2014","unstructured":"Theja Tulabandhula and Cynthia Rudin. 2014. On combining machine learning with decision making. Machine Learning (ECML-PKDD journal track) 97, 1-2 (2014), 33\u201364."},{"key":"e_1_3_2_1_47_1","unstructured":"Theja Tulabandhula and Cynthia Rudin. 2014. Robust optimization using machine learning for uncertainty sets. arXiv preprint arXiv:1407.1097(2014)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5528-6"},{"key":"e_1_3_2_1_49_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 VN","year":"1971","unstructured":"VN Vapnik and A\u00a0Ya Chervonenkis. 1971. On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities. Theory of Probability and its Applications 16, 2 (1971), 264."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/211359"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/11.2.185"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1111\/rssa.12227"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.2002.0635"}],"event":{"name":"FAccT '22: 2022 ACM Conference on Fairness, Accountability, and Transparency","location":"Seoul Republic of Korea","acronym":"FAccT '22","sponsor":["ACM Association for Computing Machinery"]},"container-title":["2022 ACM Conference on Fairness Accountability and Transparency"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531146.3533232","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531146.3533232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:30Z","timestamp":1750188690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531146.3533232"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,20]]},"references-count":52,"alternative-id":["10.1145\/3531146.3533232","10.1145\/3531146"],"URL":"https:\/\/doi.org\/10.1145\/3531146.3533232","relation":{},"subject":[],"published":{"date-parts":[[2022,6,20]]},"assertion":[{"value":"2022-06-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}