[4/3/2013]. Complexity Theoretic Lower Bounds for Sparse Principal Component Detection
(with Q. Berthet )
Best paper award at COLT 2013.
6/12-6/14. Conference on Learning Theory (COLT 2013)
Princeton, NJ.
6/17-6/19. SILO Workshop
Madison, Wisconsin.
6/26-6/28. International Workshop on Statistical Learning
Moscow, Russia.
6/30-7/4. IMS-China
Chengdu, China.
7/20-7/25. European Meeting of Statisticians
Budapest, Hungary.
12/9-12/13. Mathematical Statistics with Applications in Mind
Luminy, France.
Optimal sequential allocation
Bandit problems with side information, non-stationary bandit problems, optimal rates.
Statistical learning theory
Supervised and semi-supervised classification, sparse recovery.
Stochastic optimization
Constrained and unconstrained stochastic optimization theory and algorithms, minimization of risk functions, aggregation, exact oracle inequalities.
Nonparametric statistics
Density estimation, minimax theory, adaptation, oracle inequalities, density level sets estimation.
National Science Foundation
Grant DMS-0906424
CAREER award DMS-1053987
CAREER award DMS-1053987