2 citations · 2 across the 7 of their papers we have counts for
8 papers
Peppy: An AI-Assisted Workflow for Tight Convergence Analysis of Optimization Algorithms
Jaewook J. Suh, TaeHo Yoon, Edward Duc Hien Nguyen +2
This paper presents Peppy, an AI-assisted workflow for discovering tight, analytic convergence proofs for first-order optimization algorithms. Generic approaches to using LLMs to c…
Toward a Systematic Understanding and Interactive Search of Lyapunov-Style Proofs in Optimization
TaeHo Yoon, Jaewook J. Suh, Edward Duc Hien Nguyen +2
Lyapunov-style convergence proofs, which establish a nonincreasing sequence to provide a quantitative convergence rate for an algorithm, are popular and often considered desirable…
Exact worst-case convergence rates for Douglas--Rachford and Davis--Yin splitting methods
Edward Duc Hien Nguyen, Jaewook J. Suh, Xin Jiang +1
In this work, we aim to establish the exact worst-case convergence rates of Douglas--Rachford splitting (DRS) and Davis--Yin splitting (DYS) when applied to convex optimization pro…
An Adaptive and Parameter-Free Nesterov's Accelerated Gradient Method for Convex Optimization
Jaewook J. Suh, Shiqian Ma
We propose AdaNAG, an adaptive accelerated gradient method based on Nesterov's accelerated gradient method. AdaNAG is line-search-free, parameter-free, and achieves the accelerated…
Numerical Analysis of HiPPO-LegS ODE for Deep State Space Models
Jaesung R. Park, Jaewook J. Suh, Youngjoon Hong +1
In deep learning, the recently introduced state space models utilize HiPPO (High-order Polynomial Projection Operators) memory units to approximate continuous-time trajectories of…
Optimization Algorithm Design via Electric Circuits
Stephen P. Boyd, Tetiana Parshakova, Ernest K. Ryu +1
We present a novel methodology for convex optimization algorithm design using ideas from electric RLC circuits. Given an optimization problem, the first stage of the methodology is…
Optimal Acceleration for Minimax and Fixed-Point Problems is Not Unique
TaeHo Yoon, Jaeyeon Kim, Jaewook J. Suh +1
Recently, accelerated algorithms using the anchoring mechanism for minimax optimization and fixed-point problems have been proposed, and matching complexity lower bounds establish…
Continuous-time Analysis of Anchor Acceleration
Jaewook J. Suh, Jisun Park, Ernest K. Ryu
Recently, the anchor acceleration, an acceleration mechanism distinct from Nesterov's, has been discovered for minimax optimization and fixed-point problems, but its mechanism is n…