Efficient Optimization Algorithms for Interpretable Machine Learning


Armin Askari

University of California at Berkeley
Tue, Nov 22 2022 - 04:00 pm (GMT + 7)
About 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.


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.

Related seminars

Anh Nguyen

Microsoft GenAI

The Revolution of Small Language Models
Fri, Mar 8 2024 - 02:30 pm (GMT + 7)

Thang D. Bui

Australian National University (ANU)

Recent Progress on Grokking and Probabilistic Federated Learning
Fri, Jan 26 2024 - 10:00 am (GMT + 7)

Tim Baldwin

MBZUAI, The University of Melbourne

Tue, Jan 9 2024 - 10:30 am (GMT + 7)

Quan Vuong

Google DeepMind

Scaling Robot Learning
Wed, Dec 27 2023 - 10:00 am (GMT + 7)