← 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

Differentially Private Pairwise Learning Revisited IJCAI 2021
Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving NIPS 2021
Accelerated Algorithms for Smooth Convex-Concave Minimax Problems with O(1/k^2) Rate on Squared Gradient Norm ICML 2021
Training Quantized Neural Networks to Global Optimality via Semidefinite Programming ICML 2021
From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021
Efficient Certification of Spatial Robustness AAAI 2021
Information-constrained optimization: can adaptive processing of gradients help? NIPS 2021
CANITA: Faster Rates for Distributed Convex Optimization with Communication Compression NIPS 2021
Private Adaptive Gradient Methods for Convex Optimization ICML 2021
Adaptive Newton Sketch: Linear-time Optimization with Quadratic Convergence and Effective Hessian Dimensionality ICML 2021
Adaptive First-Order Methods Revisited: Convex Minimization without Lipschitz Requirements NIPS 2021
Low Resource Quadratic Forms for Knowledge Graph Embeddings EMNLP 2021
R-SLAM: Optimizing Eye Tracking From Rolling Shutter Video of the Retina ICCV 2021
Simple steps are all you need: Frank-Wolfe and generalized self-concordant functions NIPS 2021
A Geometric Structure of Acceleration and Its Role in Making Gradients Small Fast NIPS 2021
Fast Stochastic Bregman Gradient Methods: Sharp Analysis and Variance Reduction ICML 2021
ConvexVST: A Convex Optimization Approach to Variance-stabilizing Transformation ICML 2021
Sequential Domain Adaptation by Synthesizing Distributionally Robust Experts ICML 2021
Oblivious Sketching-based Central Path Method for Linear Programming ICML 2021
Outside the Echo Chamber: Optimizing the Performative Risk ICML 2021
Global Optimality Beyond Two Layers: Training Deep ReLU Networks via Convex Programs ICML 2021
Parameter-free Locally Accelerated Conditional Gradients ICML 2021
Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent AISTATS 2021
Transforms Based Tensor Robust PCA: Corrupted Low-Rank Tensors Recovery via Convex Optimization ICCV 2021
Variance Reduction via Primal-Dual Accelerated Dual Averaging for Nonsmooth Convex Finite-Sums ICML 2021