Convex Optimization
132 papers
Papers per year
5
8
8
2
7
6
8
10
6
8
6
1
2
3
9
6
4
7
4
8
14
'10
'15
'20
'25
Papers
Accelerated Mirror Descent for Non-Euclidean Star-convex Functions
ALT 2026
A Convex Framework for Confounding Robust Inference
JMLR 2026
Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leader
COLT 2026
An accelerated proximal bundle method for convex optimization
L4DC 2026
Clipping the Price of Adaptivity at the Tail
COLT 2026
Complexity of Vector-valued Prediction: From Linear Models to Stochastic Convex Optimization
ALT 2026
Functional Stochastic Localization
COLT 2026
Gradient-Variation Regret Bounds for Unconstrained Online Learning
COLT 2026
Improving EV Aggregate Flexibility with End-to-End Learning
L4DC 2026
Learning-Based Resilient Interval Observers for Nonlinear Discrete-Time Bounded-Error Systems
L4DC 2026
Nearly Linear-Time User-Level DP-SCO with Optimal Rates
COLT 2026
Self-Concordant Perturbations for Linear Bandits
COLT 2026
Subgradient Method for System Identification with Non-Smooth Objectives
L4DC 2026
Towards Convexity in Anomaly Detection: A New Formulation of SSLM with Unique Optimal Solutions
JMLR 2026
Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization
AISTATS 2025
Exploiting Hidden Symmetry to Improve Objective Perturbation for DP Linear Learners with a Nonsmooth L1-Norm
ICLR 2025
Fast and Reliable $N - k$ Contingency Screening with Input-Convex Neural Networks
L4DC 2025
Generalization Lower Bounds for GD and SGD in Smooth Stochastic Convex Optimization
AISTATS 2025
MixMax: Distributional Robustness in Function Space via Optimal Data Mixtures
ICLR 2025
On the Inherent Privacy of Zeroth-Order Projected Gradient Descent
AISTATS 2025
Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints
AISTATS 2025
Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
AISTATS 2025
Bounding causal effects with leaky instruments
UAI 2024
Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems extended abstract
COLT 2024
Near-Optimal Solutions of Constrained Learning Problems
ICLR 2024