Series ended Webcast
Do Simpler Machine Learning Models Exist and How Can We Find Them?

About the series

Talk Title: Do Simpler Machine Learning Models Exist and How Can We Find Them?

Talk Abstract: While the trend in machine learning has tended towards building more complicated (black box) models, such models are not as useful for high stakes decisions - black box models have led to mistakes in bail and parole decisions in criminal justice, flawed models in healthcare, and inexplicable loan decisions in finance. Simpler, interpretable models would be better. Thus, we consider questions that diametrically oppose the trend in the field: for which types of datasets would we expect to get simpler models at the same level of accuracy as black box models? If such simpler-yet-accurate models exist, how can we use optimization to find these simpler models? In this talk, I present an easy calculation to check for the possibility of a simpler (yet accurate) model before computing one. This calculation indicates that simpler-but-accurate models do exist in practice more often than you might think. Also, some types of these simple models are (surprisingly) small enough that they can be memorized or printed on an index card.

This is joint work with many wonderful students including Lesia Semenova, Chudi Zhong, Zhi Chen, Rui Xin, Jiachang Liu, Hayden McTavish, Jay Wang, Reto Achermann, Ilias Karimalis, Jacques Chen as well as senior collaborators Margo Seltzer, Ron Parr, Brandon Westover, Aaron Struck, Berk Ustun, and Takuya Takagi.

Bio: Cynthia Rudin is the Earl D. McLean, Jr. Professor of Computer Science, Electrical and Computer Engineering, Statistical Science, Mathematics, and Biostatistics & Bioinformatics at Duke University, and directs the Interpretable Machine Learning Lab. Previously, Prof. Rudin held positions at MIT, Columbia, and NYU. She holds an undergraduate degree from the University at Buffalo, and a PhD from Princeton University. She is the recipient of the 2022 Squirrel AI Award for Artificial Intelligence for the Benefit of Humanity from the Association for the Advancement of Artificial Intelligence (AAAI). This award is the most prestigious award in the field of artificial intelligence. Similar only to world-renowned recognitions, such as the Nobel Prize and the Turing Award, it carries a monetary reward at the million-dollar level. Prof. Rudin is also a three-time winner of the INFORMS Innovative Applications in Analytics Award, was named as one of the “Top 40 Under 40” by Poets and Quants in 2015, and was named by Businessinsider.com as one of the 12 most impressive professors at MIT in 2015. She is a 2022 Guggenheim fellow, as well as a fellow of the American Statistical Association, the Institute of Mathematical Statistics, and AAAI. 

Prof. Rudin is past chair of both the INFORMS Data Mining Section and the Statistical Learning and Data Science Section of the American Statistical Association. She has also served on committees for DARPA, the National Institute of Justice, AAAI, and ACM SIGKDD. She has served on three committees for the National Academies of Sciences, Engineering and Medicine, including the Committee on Applied and Theoretical Statistics, the Committee on Law and Justice, and the Committee on Analytic Research Foundations for the Next-Generation Electric Grid. She has given keynote/invited talks at several conferences including KDD (twice), AISTATS, CODE, Machine Learning in Healthcare (MLHC), Fairness, Accountability and Transparency in Machine Learning (FAT-ML), ECML-PKDD, and the Nobel Conference. Her work has been featured in news outlets including the NY Times, Washington Post, Wall Street Journal, and Boston Globe. 

Register in advance for this webinar:

https://nsf.zoomgov.com/webinar/register/WN_KOZILZXrTfq40SRFZDpnVw

 

Or an H.323/SIP room system:

    H.323: 161.199.138.10 (US West) or 161.199.136.10 (US East)

    Meeting ID: 160 658 9804

    Passcode: 753419

    SIP: 1606589804@sip.zoomgov.com

    Passcode: 753419

 

After registering, you will receive a confirmation email containing information about joining the webinar.

 

 

 

 

 

Past events in this series

October 20, 2022, 12:00 p.m. – 1:30 p.m.