Cynthia D. Rudin
Professor of Computer Science
Cynthia Rudin is an associate professor of computer science, electrical and computer engineering, statistical science and mathematics at Duke University, and directs the Prediction Analysis Lab. Previously, Prof. Rudin held positions at MIT, Columbia, and NYU. She holds an undergraduate degree from the University at Buffalo, and a PhD in applied and computational mathematics from Princeton University. She is the recipient of the 2013 and 2016 INFORMS Innovative Applications in Analytics Awards, an NSF CAREER 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. Work from her lab has won 10 best paper awards in the last 5 years. She is past chair of the INFORMS Data Mining Section, and is currently chair of the Statistical Learning and Data Science section of the American Statistical Association. She also serves on (or has served on) committees for DARPA, the National Institute of Justice, the National Academy of Sciences (for both statistics and criminology/law), and AAAI.
Wang, Fulton, et al. “Modeling recovery curves with application to prostatectomy..” Biostatistics (Oxford, England), vol. 20, no. 4, Oct. 2019, pp. 549–64. Epmc, doi:10.1093/biostatistics/kxy002. Full Text
Rudin, Cynthia, and Yaron Shaposhnik. Globally-Consistent Rule-Based Summary-Explanations for Machine Learning Models: Application to Credit-Risk Evaluation. May 2019.
Dieng, Awa, et al. “Interpretable Almost-Exact Matching for Causal Inference..” Proceedings of Machine Learning Research, vol. 89, Apr. 2019, pp. 2445–53.
Usaid Awan, M., et al. “Interpretable almost-matching-exactly with instrumental variables.” 35th Conference on Uncertainty in Artificial Intelligence, Uai 2019, Jan. 2019.
Dieng, Awa, et al. “Collapsing-Fast-Large-Almost-Matching-Exactly: A Matching Method for Causal Inference..” Corr, vol. abs/1806.06802, 2018.
Roy, Sudeepa, et al. “FLAME: A Fast Large-scale Almost Matching Exactly Approach to Causal Inference..” Corr, vol. abs/1707.06315, 2017. Open Access Copy
Parikh, Harsh, et al. MALTS: Matching After Learning to Stretch.
Tracà, S., et al. “Reducing exploration of dying arms in mortal bandits.” 35th Conference on Uncertainty in Artificial Intelligence, Uai 2019, 2019.
Rudin, Cynthia. “Do Simpler Models Exist and How Can We Find Them?.” Proceedings of the 25th Acm Sigkdd International Conference on Knowledge Discovery & Data Mining Kdd ’19, ACM Press, 2019. Crossref, doi:10.1145/3292500.3330823. Full Text
Timofte, Radu, et al. “NTIRE 2018 Challenge on Single Image Super-Resolution: Methods and Results.” 2018 Ieee/Cvf Conference on Computer Vision and Pattern Recognition Workshops (Cvprw), IEEE, 2018. Crossref, doi:10.1109/cvprw.2018.00130. Full Text
Tulabandhula, T., and C. Rudin. “Robust optimization using machine learning for uncertainty sets.” International Symposium on Artificial Intelligence and Mathematics, Isaim 2014, 2014.
Tulabandhula, T., and C. Rudin. “Generalization bounds for learning with linear and quadratic side knowledge.” International Symposium on Artificial Intelligence and Mathematics, Isaim 2014, 2014.
Huggins, J., and C. Rudin. “Toward a theory of pattern discovery.” International Symposium on Artificial Intelligence and Mathematics, Isaim 2014, 2014.