You are here

Faculty Candidate: Jayadev Acharya

Faculty candidate talk: Jayadev Acharya, Massachusetts Institute of Technology
Thursday, March 31, 2016, 4:00 pm

Jayadev Acharya
480 Dreese Labs
2015 Neil Avenue
Columbus, Ohio 43210

 

Algorithms and Limits in Statistical Inference


The massive explosion of data and the demand for fast inference has resulted in great interest and progress in various aspects of data science.


We will consider some problems at the heart of statistics and machine learning, such as hypothesis testing, distribution learning, and property estimation. We will contrast the classical themes and modern considerations in addressing these questions, drawing tools from information theory, computer science, machine learning, and statistics. We will discuss the problem of distribution estimation in greater detail, including a general framework that yields computationally efficient, and statistically optimal algorithms for estimating a wide range of probability density functions. 


We will conclude with some interesting future directions.

 

Jayadev Acharya is a postdoctoral researcher in the EECS department at MIT, hosted by Piotr Indyk. His current research interests are in algorithmic statistics, machine learning, and information theory. He received his Ph.D in ECE from UC San Diego, where he was advised by Alon Orlitsky. He is a recipient of the Jack Wolf student paper award at the IEEE International Symposium on Information Theory, the Shannon Graduate Fellowship from UC San Diego, and an MIT-Energy Initiative fellowship.