← 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

Differentiating the Value Function by using Convex Duality AISTATS 2021
Square Root Principal Component Pursuit: Tuning-Free Noisy Robust Matrix Recovery NIPS 2021
Optimized auxiliary particle filters: adapting mixture proposals via convex optimization UAI 2021
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness NIPS 2021
Logistic Q-Learning AISTATS 2021
Adaptive Newton Sketch: Linear-time Optimization with Quadratic Convergence and Effective Hessian Dimensionality ICML 2021
Constrained Risk-Averse Markov Decision Processes AAAI 2021
Linear Bandits on Uniformly Convex Sets JMLR 2021
Optimized Score Transformation for Consistent Fair Classification JMLR 2021
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding JMLR 2021
Path Length Bounds for Gradient Descent and Flow JMLR 2021
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements NIPS 2021
A General Framework for Empirical Bayes Estimation in Discrete Linear Exponential Family JMLR 2021
Sparse and Smooth Signal Estimation: Convexification of L0-Formulations JMLR 2021
Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks NIPS 2021
A Fast Globally Linearly Convergent Algorithm for the Computation of Wasserstein Barycenters JMLR 2021
Projection-Free Bandit Optimization with Privacy Guarantees AAAI 2021
Parameter-free Locally Accelerated Conditional Gradients ICML 2021
Adaptive Gradient Methods for Constrained Convex Optimization and Variational Inequalities AAAI 2021
Distributionally Robust Imitation Learning NIPS 2021
Approximate optimization of convex functions with outlier noise NIPS 2021
Differentially Private Pairwise Learning Revisited IJCAI 2021
Smooth Convex Optimization Using Sub-Zeroth-Order Oracles AAAI 2021
Clustering Ensemble Meets Low-rank Tensor Approximation AAAI 2021
Random Shuffling Beats SGD Only After Many Epochs on Ill-Conditioned Problems NIPS 2021