2 papers
math.OC2026
Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
Daniel Yiming Cao, August Y. Chen, Karthik Sridharan +1
We study the optimization of non-convex functions that are not necessarily smooth (gradient and/or Hessian are Lipschitz) using first order methods. Smoothness is a restrictive ass…
cs.LG2024
Gradient Descent on Logistic Regression with Non-Separable Data and Large Step Sizes
Si Yi Meng, Antonio Orvieto, Daniel Yiming Cao +1
We study gradient descent (GD) dynamics on logistic regression problems with large, constant step sizes. For linearly-separable data, it is known that GD converges to the minimizer…