Provably Faster Gradient Descent via Long Steps | |
at ISMP | July, 2024 |
at AMS Eastern Section Meeting, Howard University | April, 2024 |
at INFORMS Optimization Society | March, 2024 |
Provably Faster Gradient Descent via Long Steps | Youtube, Slides |
at Mila Samsung SAIT AI Lab, Montreal | 1/8/2024 |
at University of Minnesota Machine Learning Seminar | 10/24/2023 |
at SIAM NNP Section Metting | 10/21/2023 |
at MIT Workshop on Continuous Optimization | 8/19/2023 |
at MOPTA | 8/17/2023 |
at MIT ORC Colloquium | 8/11/2023 |
Some Primal-Dual Subgradient Method Theory for Strongly Convex Optimization | |
at INFORMS Annual Meeting | 10/18/2023 |
at MOPTA | 8/17/2023 |
in SIAM Conference on Optimization, Seattle, WA | 5/31/2023 |
Radial Duality: Scalable, Projection-Free Optimization Methods | Slides |
at UIowa Tippie Seminar | 9/28/2023 |
at Johns Hopkins AMS Seminar | 3/17/2023 |
at Rensselaer Polytechnic Institute | 3/29/2023 |
at University of British Columbia | 3/10/2023 |
at Carnegie Mellon University | 11/4/2022 |
at Purdue University | 10/28/2022 |
at INFORMS Annual Meeting | 10/16/2022 |
at ICCOPT | 7/22/2022 |
at INFORMS Annual Meeting | 10/20/2021 |
at Johns Hopkins MINDS Seminar | 8/30/2021 |
Convergence of First-Order Methods for (some) Nonconvex-Nonconcave Minimax Optimization | Slides |
in Erice, Italy | 5/27/2022 |
Limiting Behaviors of Nonconvex-Nonconcave Minimax Optimization via Continuous-Time Systems | |
at ALT 2022 | 3/31/2022 |
Some Extensions on the Reach of First-Order Optimization Theory | Youtube , Slides |
Thesis Defense at Cornell's ORIE | 5/25/2021 |
The Landscape of the Proximal Point Method for Nonconvex-Nonconcave Minimax Optimization | |
at SIAM Conference on Optimization | 7/18/2021 |
at Clemson University | 4/16/2021 |
at Cornell ORIE | 2/16/2021 |
at Johns Hopkins, Applied Math & Stats | 1/11/2021 |
at MIT Sloan | 1/6/2021 |
at IIT Discrete Math Seminar | 10/2/2020 |
General Convergence Rates Follow From Specialized Rates Assuming Growth Bounds | |
at INFORMS Annual Meeting | 10/21/2019 |
A Radial Duality Theory for Optimization | |
at INFORMS Annual Meeting | 10/20/2019 |
at RPI Applied Math Days | 4/5/2019 |
Convergence Rates For Stochastic Subgradient Methods Without Lipschitz Continuity Or Convexity | |
at International Symposium on Mathematical Programming | 7/2/2018 |
at INFORMS Optimization Society Conference | 3/4/2018 |
Radial Subgradient Method | |
at INFORMS Annual Meeting | 10/24/2017 |
at SIAM Conference on Optimization | 5/22/2017 |
in the Cornell SCAN Seminar | 4/10/2017 |
Nash Equilibrium and the Price of Anarchy in Priority Based Network Routing | |
at IEEE Conference on Computer Communications (INFOCOM) | 4/20/2016 |
Near Linear Time 5/3-Approximation Algorithms for Two-Level Power Assignment Problems | |
at the ACM International Workshop on Foundations of Mobile Computing (FOMC) | 8/11/2014 |
Talk about and embodying Palindromes | Youtube |
October, 2018. |