- Seminar Calendar
- Seminar Archive
- 2024-2025 Semester 1
- 2023-2024 Semester 2
- 2023-2024 Semester 1
- 2022-2023 Semester 2
- 2022-2023 Semester 1
- 2021-2022 Semester 2
- 2021-2022 Semester 1
- 2020-2021 Semester 2
- 2020-2021 Semester 1
- 2019-2020 Semester 2
- 2019-2020 Semester 1
- 2018-2019 Semester 2
- 2018-2019 Semester 1
- 2017-2018 Semester 2
- 2017-2018 Semester 1
- 2016-2017 Semester 2
- 2016-2017 Semester 1
- 2015-2016 Semester 1
- 2015-2016 Semester 2
- 2014-2015 Semester 2
- 2014-2015 Semester 1
- 2013-2014 Semester 2
- 2013-2014 Semester 1
- 2012-2013 Semester 2
- 2012-2013 Semester 1
- 2011-2012 Semester 2
- 2011-2012 Semester 1
- 2010-2011 Semester 2
- 2010-2011 Semester 1
- 2009-2010 Semester 2
- 2009-2010 Semester 1
- 2008-2009 Semester 2
- 2008-2009 Semester 1
- 2007-2008 Semester 2
- 2007-2008 Semester 1
- 2006-2007 Semester 2
- 2006-2007 Semester 1
- 2005-2006 Semester 2
- 2005-2006 Semester 1
- Contact
- Site Map
Linearized Augmented Lagrangian Methods for Nonconvex Functional Constrained Optimization
----------------------------------------------------------------------------------------------------
Department of Systems Engineering and Engineering Management
The Chinese University of Hong Kong
----------------------------------------------------------------------------------------------------
Date: Friday, April 14, 4:30 pm – 5:30 pm
Venue: ERB 513, The Chinese University of Hong Kong
Title: Linearized Augmented Lagrangian Methods for Nonconvex Functional Constrained Optimization
Speaker: Dr. Songtao Lu, IBM Research
Abstract:
In this talk, I will discuss my recent work on designing inearized augmented Lagrangian methods for non-convex optimization. Specifically, I focus on solving non-convex functional constrained optimization problems, encompassing many resource-limited problems. While there have been existing methods for solving this class of problems, they typically involve double-loop or triple-loop algorithms that require oracles to solve subproblems with high accuracy by tuning multiple hyperparameters at each iteration.
To address this issue, I will introduce an augmented Lagrangian-based single-loop algorithm that can solve this class of problems without sacrificing iteration complexity while achieving faster numerical convergence compared to state-of-the-art methods used for practical machine learning problems such as multi-class Neyman-Pearson classification, constrained Markov decision processes, and neural net training with budget constraints. Next, I will showcase the extension of this method for solving bi-level functional constrained optimization problems, with applications to meta-causal structure discovery. Finally, I will conclude the talk by highlighting several promising research directions in non-convex functional constrained (bi-level) optimization.
Biography:
Songtao Lu is currently a senior research scientist with the mathematics and theoretical computer science group at the IBM Thomas J. Watson Research Center, Yorktown Heights. He obtained his doctoral degree in electrical engineering from Iowa State University in 2018. He was a post-doctoral associate with the department of electrical and computer engineering at the University of Minnesota Twin Cities from 2018 to 2019, and an AI resident at the Thomas J. Watson Research Center from 2019 to 2020. Dr. Lu is a recipient of the best paper runner-up award of UAI (2022), the outstanding paper award of NeurIPS federated learning workshop (2022), and the IBM research accomplishment award (2021). His recent works have been published at multiple top-tier AI and machine learning conferences, including ICML, NeurIPS, AAAI, ICLR, UAI, IJCAI, AISTATS, etc. His primary research interests lie in machine learning, optimization, AI, and data science.
Everyone is welcome to attend the talk!
SEEM-5202 Website: http://seminar.se.cuhk.edu.hk
Email: seem5202@se.cuhk.edu.hk
Date:
Friday, April 14, 2023 - 16:30 to 17:30