stanford university · stanford university department of statistics departmental seminar *** day...

1

Click here to load reader

Upload: phamhuong

Post on 07-Sep-2018

212 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Stanford University · Stanford University Department of Statistics Departmental Seminar *** Day and Venue Change *** 4:30pm, Thursday, January 11, 2018 ... Martin Wainwright, Fanny

Stanford UniversityDepartment of Statistics

Departmental Seminar

*** Day and Venue Change ***

4:30pm, Thursday, January 11, 2018Sloan Mathematics Center Room 380Y

Refreshments served at 4pm in the Lounge.

Speaker: Aaditya Ramdas, UC Berkeley

Title: Interactive algorithms for multiple hypothesis testing

Abstract:

Data science is at a crossroads. Each year, thousands of new data scientists are enteringscience and technology, after a broad training in a variety of fields. Modern data science isoften exploratory in nature, with datasets being collected and dissected in an interactivemanner. Classical guarantees that accompany many statistical methods are often invali-dated by their non-standard interactive use, resulting in an underestimated risk of falselydiscovering correlations or patterns. It is a pressing challenge to upgrade existing tools, orcreate new ones, that are robust to involving a human-in-the-loop.

In this talk, I will describe two new advances that enable some amount of interactivity whiletesting multiple hypotheses, and control the resulting selection bias. I will first introducea new framework, STAR, that uses partial masking to divide the available informationinto two parts, one for selecting a set of potential discoveries, and the other for inferenceon the selected set. I will then show that it is possible to flip the traditional roles of thealgorithm and the scientist, allowing the scientist to make post-hoc decisions after seeingthe realization of an algorithm on the data. The theoretical basis for both advances isfounded in the theory of martingales : in the first, the user defines the martingale andassociated filtration interactively, and in the second, we move from optional stopping tooptional spotting by proving uniform concentration bounds on relevant martingales.

This talk will feature joint work with (alphabetically) Rina Barber, Jianbo Chen, WillFithian, Kevin Jamieson, Michael Jordan, Eugene Katsevich, Lihua Lei, Max Rabinovich,Martin Wainwright, Fanny Yang and Tijana Zrnic.

About this Speaker: Aaditya Ramdas is a postdoctoral researcher in Statistics andEECS at UC Berkeley, advised by Michael Jordan and Martin Wainwright. He finishedhis PhD in Statistics and Machine Learning at CMU, advised by Larry Wasserman andAarti Singh, winning the Best Thesis Award in Statistics. A lot of his research focuses onmodern aspects of reproducibility in science and technology, involving statistical testingand false discovery rate control in static and dynamic settings.