Tuesday, Nov 22 2022 - 04:00 pm (GMT + 7)

Efficient Optimization Algorithms for Interpretable Machine Learning

About the speaker

Armin Askari is currently a final-year PhD student at University of California at Berkeley, where he is supervised by Prof. Laurent El Ghaoui. Armin’s research interests focus on developing efficient algorithms for machine learning and statistical inference.

Abstract

Behind all supervised learning problems is an optimization problem. Solving these problems reliably and efficiently is a key step in any machine learning pipeline. This talk looks at efficient optimization algorithms for a variety of machine learning problems (in particular, sparse learning problems). In the first part of the talk, we look at efficient algorithms for constructing knockoff features for statistical inference. In the second part, we will look at l0-penalized and constrained optimization problems and a class of efficient algorithms for training these non-convex problems while providing guarantees on the quality of the solution.

Upcoming Speakers

Mario Boley

Monash University

Statistical Rule Learning for Materials Science

Friday, Dec 02 2022 - 10:00 am (GMT + 7)

Thanh Nguyen-Tang

Johns Hopkins University

Provable Offline Reinforcement Learning: Neural Function Approximation, Randomization, and...

Friday, Jan 13 2023 - 10:00 am (GMT + 7)