Co-occurring keywords · papers mentioning both
Papers
On the complexity of finding stationary points of smooth functions in one dimension
ALT 2023
On the Convergence of Continual Learning with Adaptive Methods
UAI 2023
On the Convergence of IRLS and Its Variants in Outlier-Robust Estimation
CVPR 2023
On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms
NeurIPS 2023
Optimal Sample Complexity Bounds for Non-convex Optimization under Kurdyka-Lojasiewicz Condition
AISTATS 2023
Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
ICML 2023
Optimization for Amortized Inverse Problems
ICML 2023
Optimizing NOTEARS Objectives via Topological Swaps
ICML 2023
Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold
COLT 2023
Practical Sharpness-Aware Minimization Cannot Converge All the Way to Optima
NeurIPS 2023
Preconditioned Gradient Descent for Overparameterized Nonconvex Burer--Monteiro Factorization with Global Optimality Certification
JMLR 2023
Preconditioning Matters: Fast Global Convergence of Non-convex Matrix Factorization via Scaled Gradient Descent
NeurIPS 2023
Private Non-Convex Federated Learning Without a Trusted Server
AISTATS 2023
Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks
NeurIPS 2023
Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter: Optimal Rates for (Non-Smooth) Convex Losses and Extension to Non-Convex Losses
ALT 2023
Projection-Free Methods for Solving Nonconvex-Concave Saddle Point Problems
NeurIPS 2023
Projective Proximal Gradient Descent for Nonconvex Nonsmooth Optimization: Fast Convergence Without Kurdyka-Lojasiewicz (KL) Property
ICLR 2023
Proximal Splitting Adversarial Attack for Semantic Segmentation
CVPR 2023
Proximal Stochastic Recursive Momentum Methods for Nonconvex Composite Decentralized Optimization
AAAI 2023
Quantum Lower Bounds for Finding Stationary Points of Nonconvex Functions
ICML 2023
Quantum speedups for stochastic optimization
NeurIPS 2023
Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization
NeurIPS 2023
Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
NeurIPS 2023
Restarted Nonconvex Accelerated Gradient Descent: No More Polylogarithmic Factor in the in the O(epsilon^(-7/4)) Complexity
JMLR 2023
ReSync: Riemannian Subgradient-based Robust Rotation Synchronization
NeurIPS 2023