| Publication | Date of Publication | Type |
|---|
Mixing times and privacy analysis for the projected Langevin algorithm under a modulus of continuity
Journal of Machine Learning Research (JMLR) | 2026-08-04 | Paper |
How to DP-fy your data: a practical guide to generating synthetic data with differential privacy
The Journal of Artificial Intelligence Research (JAIR) | 2026-07-31 | Paper |
Optimization on a finer scale: bounded local subgradient variation perspective
SIAM Journal on Optimization | 2026-03-12 | Paper |
Mirror descent algorithms with nearly dimension-independent rates for differentially-private stochastic saddle-point problems
SIAM Journal on Optimization | 2026-03-12 | Paper |
| Differentially private non-convex optimization under the KL condition with optimal rates | 2025-03-06 | Paper |
Complementary composite minimization, small gradients in general norms, and applications
Mathematical Programming. Series A. Series B | 2024-11-07 | Paper |
Corrections to: ``Lower bounds on the oracle complexity of nonsmooth convex optimization via information theory''
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Optimal algorithms for differentially private stochastic monotone variational inequalities and saddle-point problems
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Optimal Algorithms for Stochastic Complementary Composite Minimization
SIAM Journal on Optimization | 2024-01-17 | Paper |
A sequential Stackelberg game for dynamic inspection problems
European Journal of Operational Research | 2022-06-08 | Paper |
Network pricing: how to induce optimal flows under strategic link operators
Operations Research | 2022-02-18 | Paper |
An Optimal Algorithm for Strict Circular Seriation
SIAM Journal on Mathematics of Data Science | 2021-12-27 | Paper |
Statistical query algorithms for mean vector estimation and stochastic convex optimization
Mathematics of Operations Research | 2021-09-14 | Paper |
| Lower bounds for parallel and randomized convex optimization | 2020-10-05 | Paper |
Lower bounds for parallel and randomized convex optimization
(available as arXiv preprint) | 2020-10-05 | Paper |
| scientific article; zbMATH DE number 7042555 (Why is no real title available?) | 2019-03-26 | Paper |
Optimal Affine-Invariant Smooth Minimization Algorithms
SIAM Journal on Optimization | 2018-09-18 | Paper |
Statistical query algorithms for mean vector estimation and stochastic convex optimization
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Fast, deterministic and sparse dimensionality reduction | 2018-03-15 | Paper |
New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
Discrete & Computational Geometry | 2017-10-10 | Paper |
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory
IEEE Transactions on Information Theory | 2017-09-21 | Paper |
On lower complexity bounds for large-scale smooth convex optimization
Journal of Complexity | 2014-12-05 | Paper |
Network congestion control with Markovian multipath routing
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
