Skip to content
Sagan

Paper

On the Oracle Complexity of Interpolation-Based Gradient Descent

Unreadunread

AI summary

arXiv:2606. 19878v1 Announce Type: cross Abstract: Recent work on first-order optimizers for empirical risk minimization (ERM) has suggested that smoothness of ERM loss functions in the training data, rather than in the optimization parameters, can be leveraged to improve the oracle complexity of gradient descent (GD) methods.