← 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

Tighter Lower Bounds for Shuffling SGD: Random Permutations and Beyond ICML 2023
Safeguarded Learned Convex Optimization AAAI 2023
Iteratively Enhanced Semidefinite Relaxations for Efficient Neural Network Verification AAAI 2023
A Parameter-Free Conditional Gradient Method for Composite Minimization under Hölder Condition JMLR 2023
Accelerated Cyclic Coordinate Dual Averaging with Extrapolation for Composite Convex Optimization ICML 2023
Exact Inference in High-order Structured Prediction ICML 2023
Accelerated Primal-Dual Methods for Convex-Strongly-Concave Saddle Point Problems ICML 2023
“Why Not Looking backward?” A Robust Two-Step Method to Automatically Terminate Bayesian Optimization NIPS 2023
An Improved Approximation Algorithm for Wage Determination and Online Task Allocation in Crowd-Sourcing AAAI 2023
A Unified Discretization Framework for Differential Equation Approach with Lyapunov Arguments for Convex Optimization NIPS 2023
Learning the Efficient Frontier NIPS 2023
Gradient Descent with Linearly Correlated Noise: Theory and Applications to Differential Privacy NIPS 2023
ReHLine: Regularized Composite ReLU-ReHU Loss Minimization with Linear Computation and Linear Convergence NIPS 2023
An Optimal and Scalable Matrix Mechanism for Noisy Marginals under Convex Loss Functions NIPS 2023
Revisiting Area Convexity: Faster Box-Simplex Games and Spectrahedral Generalizations NIPS 2023
A General Representation Learning Framework with Generalization Performance Guarantees ICML 2023
Memory-Constrained Algorithms for Convex Optimization NIPS 2023
DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method NIPS 2023
CORNN: Convex optimization of recurrent neural networks for rapid inference of neural dynamics NIPS 2023
Non-Euclidean Motion Planning with Graphs of Geodesically-Convex Sets RSS 2023
Improving the Privacy and Practicality of Objective Perturbation for Differentially Private Linear Learners NIPS 2023
Accelerated Zeroth-order Method for Non-Smooth Stochastic Convex Optimization Problem with Infinite Variance NIPS 2023
Randomized Primal-Dual Methods with Adaptive Step Sizes AISTATS 2023
Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking NIPS 2023
A Conditional Gradient-based Method for Simple Bilevel Optimization with Convex Lower-level Problem AISTATS 2023