research
∙
07/10/2023
An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization
We study the complexity of producing (δ,ϵ)-stationary points of Lipschit...
share
research
∙
05/24/2023
From Tempered to Benign Overfitting in ReLU Neural Networks
Overparameterized neural networks (NNs) are observed to generalize well ...
research
∙
02/16/2023
Deterministic Nonsmooth Nonconvex Optimization
We study the complexity of optimizing nonsmooth nonconvex Lipschitz func...
research
∙
09/21/2022
On the Complexity of Finding Small Subgradients in Nonsmooth Optimization
We study the oracle complexity of producing (δ,ϵ)-stationary points of L...
research
∙
04/14/2021
Oracle Complexity in Nonsmooth Nonconvex Optimization
It is well-known that given a smooth, bounded-from-below, and possibly n...
research
∙
10/13/2020
