Lesi Chen

F2BA. A tale of works on the complexity of first-order bilevel optimization.

LEN. A tale of works on the complexity of second-order (and high-order) min-max optimization.

GFM-Plus. [ICML 2023] Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization.

SPIDER-GDA. [NeurIPS 2022] Faster Stochastic Algorithms for Minimax Optimization under Polyak-Łojasiewicz Condition.

DREAM. [AISTATS 2024] An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization.

CUMCM2021-C. TeX

TrueNobility303.github.io. Github Pages template for academic personal websites, forked from mmistakes/minimal-mistakes

A-LEN. A tale of works on the complexity of second-order (and high-order) min-max optimization.

RAIN. [JMLR 2024] Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization.

LocalFG. Improved Implementation of "Can Forward Gradient Match Backpropagation?" (ICML, 2023)