BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//MIDAS - ECPv5.1.5//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:MIDAS
X-ORIGINAL-URL:https://midas.umich.edu
X-WR-CALDESC:Events for MIDAS
BEGIN:VTIMEZONE
TZID:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Detroit:20180115T161000
DTEND;TZID=America/Detroit:20180115T172000
DTSTAMP:20230205T114602
CREATED:20180108T203944Z
LAST-MODIFIED:20180108T203944Z
UID:22989-1516032600-1516036800@midas.umich.edu
SUMMARY:The Statistics Department Seminar Series Presents: Aaditya Ramdas\, University of California\, Berkeley
DESCRIPTION:\n\nAaditya Ramdas\n\nDepartment of Statistics and EECS University of California\, Berkeley\n\n“Interactive Algorithms for Multiple Hypothesis Testing”\n\n\nAbstract: Data science is at a crossroads. Each year\, thousands of new data scientists are entering science and technology\, after a broad training in a variety of fields. Modern data science is often exploratory in nature\, with datasets being collected and dissected in an interactive manner. Classical guarantees that accompany many statistical methods are often invalidated by their non-standard interactive use\, resulting in an underestimated risk of falsely discovering correlations or patterns. It is a pressing challenge to upgrade existing tools\, or create new ones\, that are robust to involving a human-in-the-loop. \nIn this talk\, I will describe two new advances that enable some amount of interactivity while testing multiple hypotheses\, and control the resulting selection bias. I will first introduce a new framework\, STAR\, that uses partial masking to divide the available information into two parts\, one for selecting a set of potential discoveries\, and the other for inference on the selected set. I will then show that it is possible to flip the traditional roles of the algorithm and the scientist\, allowing the scientist to make post-hoc decisions after seeing the realization of an algorithm on the data. The theoretical basis for both advances is founded in the theory of martingales : in the first\, the user defines the martingale and associated filtration interactively\, and in the second\, we move from optional stopping to optional spotting by proving uniform concentration bounds on relevant martingales. \nThis talk will feature joint work with (alphabetically) Rina Barber\, Jianbo Chen\, Will Fithian\, Kevin Jamieson\, Michael Jordan\, Eugene Katsevich\, Lihua Lei\, Max Rabinovich\, Martin Wainwright\, Fanny Yang and Tijana Zrnic. \nBio: Aaditya Ramdas is a postdoctoral researcher in Statistics and EECS at UC Berkeley\, advised by Michael Jordan and Martin Wainwright. He finished his PhD in Statistics and Machine Learning at CMU\, advised by Larry Wasserman and Aarti Singh\, winning the Best Thesis Award in Statistics. A lot of his research focuses on modern aspects of reproducibility in science and technology —\ninvolving statistical testing and false discovery rate control in static and dynamic settings.\n
URL:https://midas.umich.edu/event/the-statistics-department-seminar-series-presents-aaditya-ramdas-university-of-california-berkeley/
LOCATION:Room 411 West Hall\, 1085 S University Ave\, Ann Arbor\, MI\, 48109\, United States
END:VEVENT
END:VCALENDAR