01
Menu
Preprints & Working Papers
10Details ↗
02
Optimal Deterministic First-Order Oracle Complexity for Nonconvex-Concave Minimax Optimization
Preprint03
Lower Bounds for Nonconvex–PŁ Minimax Optimization
Preprint04
Optimal Deterministic Oracle Complexity for Weakly Convex Optimization
Preprint05
Nonconvex Composite Functional Constraints via First-Order Augmented Lagrangian Methods under Local Regularity
Preprint06
On the Width Scaling of Neural Optimizers under Matrix Operator Norms I: Row/Column Normalization and Hyperparameter Transfer
Preprint07
Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms
Preprint08
Spend Less, Reason Better: Budget-Aware Value Tree Search for LLM Agents
PreprintUnder Review09
Smoothing Meets Perturbation: Unified and Tight Analysis for Nonconvex-Concave Minimax Optimization
PreprintUnder Revision10
Unifying Distributionally Robust Optimization via Optimal Transport with Conditional Moment Constraints
Under RevisionJournal Articles
401
Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
Mathematical Programming, Series A02
Distributionally Robust Optimization and Robust Statistics
Statistical Science03
A Splitting Scheme for Flip-Free Distortion Energies
SIAM Journal on Imaging Sciences04
Understanding Notions of Stationarity in Nonsmooth Optimization
IEEE Signal Processing MagazineConference Papers
1501
Last-Iterate Convergence of Single-Loop Stochastic Methods for Constrained Convex-Concave Minimax Problems
NeurIPS02
Set Smoothness Unlocks Clarke Hyper-Stationarity in Bilevel Optimization
NeurIPSSpotlight03
Automatic Outlier Rectification via Optimal Transport
NeurIPS04
Stability Evaluation through Distributional Perturbation Analysis
ICML05
Synthetic Principal Component Design: Fast Covariate Balancing with Synthetic Controls
UAIOral06
Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimization
NeurIPS07
Outlier-Robust Gromov-Wasserstein for Graph Data
NeurIPSSpotlight08
A Convergent Single-Loop Algorithm for Relaxation of Gromov-Wasserstein in Graph Data
ICLR09
Tikhonov Regularization is Optimal Transport Robust under Martingale Constraints
NeurIPS10
Rethinking Graph Neural Networks for Anomaly Detection
ICML11
Modified Frank Wolfe in Probability Space
NeurIPS12
Deconvolutional Networks on Graph Data
NeurIPS13
Fast Epigraphical Projection-based Incremental Algorithms for Wasserstein Distributionally Robust SVM
NeurIPS14
The Gambler’s Problem and Beyond
ICLR15