conftrace_

subgradient method

24 papers

Explore in graph

Co-occurring keywords

convex optimization (1321) nonsmooth optimization (49) stochastic optimization (1060) distributed optimization (275) non-convex optimization (547) weakly convex optimization (5) weber location problem (2) weiszfeld algorithm (3) spectral gap (27) non-smooth optimization (29)

Papers

De-singularity Subgradient for the q-th-Powered lₚ-Norm Weber Location Problem AAAI 2025
Policy Optimization for Robust Average Reward MDPs NIPS 2024
Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks NIPS 2024
A De-singularity Subgradient Approach for the Extended Weber Location Problem IJCAI 2024
Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees JMLR 2024
Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization NIPS 2023
Delayed Algorithms for Distributed Stochastic Weakly Convex Optimization NIPS 2023
Stochastic Optimization for Spectral Risk Measures AISTATS 2023
Asymptotic Network Independence and Step-Size for a Distributed Subgradient Method JMLR 2022
A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions NIPS 2022
Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery NIPS 2021
Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method NIPS 2020
Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints ICML 2020
Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth Non-Convex Optimization ICML 2020
Modeling simple structures and geometry for better stochastic optimization algorithms AISTATS 2019
A Linearly Convergent Method for Non-Smooth Non-Convex Optimization on the Grassmannian with Applications to Robust Subspace and Dictionary Learning NIPS 2019
Provably Correct Automatic Sub-Differentiation for Qualified Programs NIPS 2018
RSG: Beating Subgradient Method without Smoothness and Strong Convexity JMLR 2018
SVD-free Convex-Concave Approaches for Nuclear Norm Regularization IJCAI 2017
Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence ICML 2017
Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method ICML 2017
Iterative Regularization for Learning with Convex Loss Functions JMLR 2016
On Integrated Clustering and Outlier Detection NIPS 2014
Distributed Dual Averaging In Networks NIPS 2010