← Keywords

convex optimization

1320 papers

Explore in graph

Also known as

ACO ADMM CO OCO

Co-occurring keywords

stochastic optimization (1060) convergence rate (606) stochastic gradient descent (1088) gradient descent (1143) online learning (1770) support vector machine (976) matrix completion (356) regret bound (1918) kernel methods (1096) sparse optimization (246)

Papers

Optimal Non-Convex Exact Recovery in Stochastic Block Model via Projected Power Method ICML 2021
Revealing the Structure of Deep Neural Networks via Convex Duality ICML 2021
Model-Targeted Poisoning Attacks with Provable Convergence ICML 2021
Regularized ERM on random subspaces AISTATS 2021
Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021
Revisiting the Role of Euler Numerical Integration on Acceleration and Stability in Convex Optimization AISTATS 2021
Local SGD: Unified Theory and New Efficient Methods AISTATS 2021
Principal Component Hierarchy for Sparse Quadratic Programs ICML 2021
An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning NIPS 2021
Learning with semi-definite programming: statistical bounds based on fixed point analysis and excess risk curvature JMLR 2021
Training Quantized Neural Networks to Global Optimality via Semidefinite Programming ICML 2021
One-Shot Federated Learning: Theoretical Limits and Algorithms to Achieve Them JMLR 2021
The ensmallen library for flexible numerical optimization JMLR 2021
Variational Fair Clustering AAAI 2021
From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021
GemBag: Group Estimation of Multiple Bayesian Graphical Models JMLR 2021
A Unified Analysis of First-Order Methods for Smooth Games via Integral Quadratic Constraints JMLR 2021
Projection-free Online Learning in Dynamic Environments AAAI 2021
A Primal-Dual Online Algorithm for Online Matching Problem in Dynamic Environments AAAI 2021
Convex Geometry and Duality of Over-parameterized Neural Networks JMLR 2021
Overcoming the Convex Barrier for Simplex Inputs NIPS 2021
Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions NIPS 2021
Additive Error Guarantees for Weighted Low Rank Approximation ICML 2021
Iterative regularization for convex regularizers AISTATS 2021
Approximate optimization of convex functions with outlier noise NIPS 2021