conftrace_

non-smooth optimization

29 papers

Explore in graph

Co-occurring keywords

convex optimization (1321) non-convex optimization (547) convergence rate (607) stochastic optimization (1060) stochastic gradient descent (1091) zeroth-order optimization (102) stationary point (44) nonsmooth optimization (49) oracle complexity (65) convergence analysis (395)

Papers

Quantum Algorithms for Non-smooth Non-convex Optimization NIPS 2024
Lifted Bregman Training of Neural Networks JMLR 2023
Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization NIPS 2023
An Optimal Structured Zeroth-order Algorithm for Non-smooth Optimization NIPS 2023
The power of first-order smooth optimization for black-box non-smooth problems ICML 2022
Implicit Differentiation for Fast Hyperparameter Selection in Non-Smooth Convex Learning JMLR 2022
Oracle Complexity in Nonsmooth Nonconvex Optimization JMLR 2022
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements NIPS 2021
Private Non-smooth ERM and SCO in Subquadratic Steps NIPS 2021
Stability and Convergence of Stochastic Gradient Clipping: Beyond Lipschitz Continuity and Smoothness ICML 2021
Anderson Acceleration of Proximal Gradient Methods ICML 2020
Safe non-smooth black-box optimization with application to policy search L4DC 2020
Highly smooth minimization of non-smooth problems COLT 2020
Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization ICML 2020
A Linearly Convergent Method for Non-Smooth Non-Convex Optimization on the Grassmannian with Applications to Robust Subspace and Dictionary Learning NIPS 2019
Convergence Guarantees for a Class of Non-convex and Non-smooth Optimization Problems JMLR 2019
Tight analyses for non-smooth stochastic gradient descent COLT 2019
Proximal Splitting Meets Variance Reduction AISTATS 2019
Convergence guarantees for a class of non-convex and non-smooth optimization problems ICML 2018
Alternating Randomized Block Coordinate Descent ICML 2018
Provably Correct Automatic Sub-Differentiation for Qualified Programs NIPS 2018
Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach NIPS 2018
Adaptive Sampling Probabilities for Non-Smooth Optimization ICML 2017
Sparse Support Recovery with Non-smooth Loss Functions NIPS 2016
A Modified Orthant-Wise Limited Memory Quasi-Newton Method with Convergence Analysis ICML 2015