Co-occurring keywords · papers mentioning both
Papers
Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization
IJCAI 2020
ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization
JMLR 2020
Random Reshuffling: Simple Analysis with Vast Improvements
NeurIPS 2020
Robustness Analysis of Non-Convex Stochastic Gradient Descent using Biased Expectations
NeurIPS 2020
Robust One-Bit Recovery via ReLU Generative Networks: Near-Optimal Statistical Rate and Global Landscape Analysis
ICML 2020
Safe Sample Screening for Robust Support Vector Machine
AAAI 2020
Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations
COLT 2020
Second Order Optimality in Decentralized Non-Convex Optimization via Perturbed Gradient Tracking
NeurIPS 2020
SGD with shuffling: optimal rates without component convexity and large epoch requirements
NeurIPS 2020
Short and Sparse Deconvolution --- A Geometric Approach
ICLR 2020
Stochastic Gauss-Newton Algorithms for Nonconvex Compositional Optimization
ICML 2020
Stochastic Gradient and Langevin Processes
ICML 2020
Stochastic Nested Variance Reduction for Nonconvex Optimization
JMLR 2020
Stochastic Optimization for Non-convex Inf-Projection Problems
ICML 2020
Stochastic Recursive Gradient Descent Ascent for Stochastic Nonconvex-Strongly-Concave Minimax Problems
NeurIPS 2020
Stochastic Recursive Variance-Reduced Cubic Regularization Methods
AISTATS 2020
The Complexity of Finding Stationary Points with Stochastic Gradient Descent
ICML 2020
Tight Convergence Rate of Gradient Descent for Eigenvalue Computation
IJCAI 2020
Towards Better Generalization of Adaptive Gradient Methods
NeurIPS 2020
Towards Better Understanding of Adaptive Gradient Algorithms in Generative Adversarial Nets
ICLR 2020
Transferring Optimality Across Data Distributions via Homotopy Methods
ICLR 2020
Uncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality
ICML 2020
Zeroth Order Non-convex optimization with Dueling-Choice Bandits
UAI 2020
ACCELERATING NONCONVEX LEARNING VIA REPLICA EXCHANGE LANGEVIN DIFFUSION
ICLR 2019
Accelerating Rescaled Gradient Descent: Fast Optimization of Smooth Functions
NeurIPS 2019