Co-occurring keywords · papers mentioning both
Papers
Efficient Bandit Convex Optimization: Beyond Linear Losses
COLT 2021
Fast Projection onto the Capped Simplex with Applications to Sparse Regression in Bioinformatics
NeurIPS 2021
Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit
JMLR 2021
Global Convergence of Online Optimization for Nonlinear Model Predictive Control
NeurIPS 2021
Newton Method over Networks is Fast up to the Statistical Precision
ICML 2021
Acceleration with a Ball Optimization Oracle
NeurIPS 2020
Approximate Cross-validation: Guarantees for Model Assessment and Selection
AISTATS 2020
Convex optimization based on global lower second-order models
NeurIPS 2020
Distributed Newton Can Communicate Less and Resist Byzantine Workers
NeurIPS 2020
On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyond
JMLR 2020
Proximity Operator of the Matrix Perspective Function and its Applications
NeurIPS 2020
SPAN: A Stochastic Projected Approximate Newton Method
AAAI 2020
Cubic Regularization with Momentum for Nonconvex Optimization
UAI 2019
DINGO: Distributed Newton-Type Method for Gradient-Norm Optimization
NeurIPS 2019
Globally Convergent Newton Methods for Ill-conditioned Generalized Self-concordant Losses
NeurIPS 2019
Interior-Point Methods Strike Back: Solving the Wasserstein Barycenter Problem
NeurIPS 2019
Iterative Normalization: Beyond Standardization Towards Efficient Whitening
CVPR 2019
RSN: Randomized Subspace Newton
NeurIPS 2019
Stochastic Variance-Reduced Cubic Regularization Methods
JMLR 2019
A Stein variational Newton method
NeurIPS 2018
Convergence of Cubic Regularization for Nonconvex Optimization under KL Property
NeurIPS 2018
GIANT: Globally Improved Approximate Newton Method for Distributed Optimization
NeurIPS 2018
HONES: A Fast and Tuning-free Homotopy Method For Online Newton Step
AISTATS 2018
Randomized Block Cubic Newton Method
ICML 2018
Stochastic Variance-Reduced Cubic Regularized Newton Methods
ICML 2018