Convex Optimization

Top-K ranking with a monotone adversary COLT 2024 A Second-Order Method for Stochastic Bandit Convex Optimisation COLT 2023 Contextual bandits with concave rewards, and an application to fair ranking ICLR 2023 Differentially Private Algorithms for the Stochastic Saddle Point Problem with Optimal Rates for the Strong Gap COLT 2023 Exploring Local Norms in Exp-concave Statistical Learning COLT 2023 Improved Dynamic Regret for Online Frank-Wolfe COLT 2023 Open Problem: Polynomial linearly-convergent method for g-convex optimization? COLT 2023 Proper Losses, Moduli of Convexity, and Surrogate Regret Bounds COLT 2023 Negative curvature obstructs acceleration for strongly geodesically convex optimization, even with exact first-order oracles COLT 2022 Parameter-free Mirror Descent COLT 2022 Shuffle Private Stochastic Convex Optimization ICLR 2022 The Structured Abstain Problem and the Lovász Hinge COLT 2022 Convex Potential Flows: Universal Probability Distributions with Optimal Transport and Convex Optimization ICLR 2021 Fast convergence of stochastic subgradient method under interpolation ICLR 2021 (Nearly) Dimension Independent Private ERM with AdaGrad Rates\{via Publicly Estimated Subspaces COLT 2021 Non-Euclidean Differentially Private Stochastic Convex Optimization COLT 2021 Robust Online Convex Optimization in the Presence of Outliers COLT 2021 The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication COLT 2021 From Nesterov’s Estimate Sequence to Riemannian Acceleration COLT 2020 Learning Interpretable Models using Soft Integrity Constraints ACML 2020 Leveraging Predictions in Smoothed Online Convex Optimization via Gradient-based Algorithms NeurIPS 2020 Lipschitz and Comparator-Norm Adaptivity in Online Learning COLT 2020 Near-Optimal Algorithms for Minimax Optimization COLT 2020 Open Problem: Fast and Optimal Online Portfolio Selection COLT 2020 Penalized Langevin dynamics with vanishing penalty for smooth and log-concave targets NeurIPS 2020