conftrace_

complexity guarantee

3 papers

Explore in graph

Co-occurring keywords · papers mentioning both

gradient descent (2) non-convex optimization (2) line search algorithm (1) strict saddle function (1) cutting plane algorithm (1) communication round (1) gradient sampling (1) low-rank matrix optimization (1) lipschitz function (1) optimal algorithm (1)

Papers

A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees JMLR 2023 A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions NeurIPS 2022 Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization NeurIPS 2020