Caltech Logo

CMI Seminar: Pan Xu

Tuesday, October 26, 2021
4:00pm to 5:00pm
Add to Cal
Annenberg 105
Sample-Efficient Nonconvex Optimization Algorithms for Machine Learning Talk
Pan Xu, Postdoctoral Scholar, CMS, Caltech,

Nonconvex optimization plays a central role in modern machine learning. How to design data-efficient optimization algorithms that have a low sample complexity while enjoying a fast convergence at the same time remains a pressing and challenging research question. In this talk, I will discuss the sample efficiency of stochastic gradient-based algorithms for solving nonconvex optimization problems. I will first introduce first-order optimization algorithms that achieve improved sample efficiency by using variance reduction techniques. Then I will show that these variance reduction techniques can be used to develop sample-efficient algorithms for policy optimization problems in reinforcement learning.

For more information, please contact Linda Taddeo by phone at 626-395-6704 or by email at