Andrew Lowy

Orcid: 0009-0001-9893-5669

According to our database1, Andrew Lowy authored at least 24 papers between 2021 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Optimal Rates for Pure {\varepsilon}-Differentially Private Stochastic Convex Optimization with Heavy Tails.
CoRR, April, 2026

2025
Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates.
CoRR, June, 2025

Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter.
J. Priv. Confidentiality, 2025

Optimal Rates for Robust Stochastic Convex Optimization.
Proceedings of the 6th Symposium on Foundations of Responsible Computing, 2025

2024
A Stochastic Optimization Framework for Private and Fair Learning From Decentralized Data.
CoRR, 2024

Exploring User-level Gradient Inversion with a Diffusion Prior.
CoRR, 2024

Efficient Differentially Private Fine-Tuning of Diffusion Models.
CoRR, 2024

Why Does Differential Privacy with Large Epsilon Defend Against Practical Membership Inference Attacks?
CoRR, 2024

Faster Algorithms for User-Level Private Stochastic Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

How to Make the Gradients Small Privately: Improved Rates for Differentially Private Non-Convex Optimization.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Optimal Differentially Private Model Training with Public Data.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Private Heterogeneous Federated Learning Without a Trusted Server Revisited: Error-Optimal and Communication-Efficient Algorithms for Convex Losses.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Analyzing Inference Privacy Risks Through Gradients In Machine Learning.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Optimal Differentially Private Learning with Public Data.
CoRR, 2023

Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Losses.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Stochastic Differentially Private and Fair Learning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter: Optimal Rates for (Non-Smooth) Convex Losses and Extension to Non-Convex Losses.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

Private Non-Convex Federated Learning Without a Trusted Server.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
A Stochastic Optimization Framework for Fair Risk Minimization.
Trans. Mach. Learn. Res., 2022

Private Stochastic Optimization in the Presence of Outliers: Optimal Rates for (Non-Smooth) Convex Losses and Extension to Non-Convex Losses.
CoRR, 2022

2021
Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems.
SIAM J. Optim., 2021

Locally Differentially Private Federated Learning: Efficient Algorithms with Tight Risk Bounds.
CoRR, 2021

FERMI: Fair Empirical Risk Minimization via Exponential Rényi Mutual Information.
CoRR, 2021

Output Perturbation for Differentially Private Convex Optimization with Improved Population Loss Bounds, Runtimes and Applications to Private Adversarial Training.
CoRR, 2021


  Loading...