Publications
Publications by categories in reversed chronological order. The authors of most papers are ordered alphabetically.
2024
- Neurips 24Private Stochastic Convex Optimization with Heavy Tails: Near-Optimality from Simple ReductionsarXiv preprint arXiv:2406.02789, 2024
- Neurips 24Private Online Learning via Lazy AlgorithmsarXiv preprint arXiv:2406.03620, 2024
- Neurips 24Faster Algorithms for User-Level Private Stochastic Convex OptimizationarXiv preprint arXiv:2410.18391, 2024
- COLM 24Mind the Privacy Unit! User-Level Differential Privacy for Language Model Fine-TuningarXiv preprint arXiv:2406.14322, 2024
- ICML 24Private gradient descent for linear regression: Tighter error bounds and instance-specific uncertainty estimationarXiv preprint arXiv:2402.13531, 2024
- AISTATS 24User-level differentially private stochastic convex optimization: Efficient algorithms with optimal ratesIn International Conference on Artificial Intelligence and Statistics, 2024
2023
- ICLR 24
- Neurips 23 SpotlightPrivate (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess RisksarXiv preprint arXiv:2302.09699, 2023
- FOCS 23ReSQueing Parallel and Private Stochastic Convex OptimizationIn 64th IEEE Symposium on Foundations of Computer Science (FOCS), 2023
- COLT 23Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal SamplerIn Conference on Learning Theory, 2023
- STOC 23Pandora Box Problem with Nonobligatory Inspection: Hardness and Improved Approximation AlgorithmsIn Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC), 2023
- SODA 23Private Convex Optimization in General NormsIn Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023
- SODA 23Super-resolution and Robust Sparse Continuous Fourier Transform in Any Constant Dimension: Nearly Linear Time and Sample ComplexityIn Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023
- ICLR 23Augmentation with Projection: Towards an Effective and Efficient Data Augmentation Paradigm for DistillationarXiv preprint arXiv:2210.11768, 2023
2022
- Neurips 22When Does Differentially Private Learning Not Suffer in High Dimensions?arXiv preprint arXiv:2207.00160, 2022
- COLT 22
- COLT 22
- SODA 22Multi-token Markov Game with Switching Costs∗In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022
2021
- Neurips 21 SpotlightPrivate non-smooth erm and sco in subquadratic stepsAdvances in Neural Information Processing Systems, 2021
2020
- ITCS 20Algorithms and Adaptivity Gaps for Stochastic k-TSPIn 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
2019
- COCOON 19More Efficient Algorithms for Stochastic Diameter and Some Unapproximated Problems in Metric SpaceIn Computing and Combinatorics: 25th International Conference, COCOON 2019, Xi’an, China, July 29–31, 2019, Proceedings, 2019
Manuscript
2024
- Adaptive Batch Size for Privately Finding Second-Order Stationary PointsarXiv preprint arXiv:2410.07502, 2024
- Improved Sample Complexity for Private Nonsmooth Nonconvex OptimizationarXiv preprint arXiv:2410.05880, 2024
- Unlearn and Burn: Adversarial Machine Unlearning Requests Destroy Model AccuracyarXiv preprint arXiv:2410.09591, 2024
- Muse: Machine unlearning six-way evaluation for language modelsarXiv preprint arXiv:2407.06460, 2024