Andrew Lowy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Andrew Lowy has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Bradley Malin
Department of Biomedical Informatics, Vanderbilt University Medical Center, Nashville, USA
1 shared publication - Jing Liu
Mitsubishi Electric Research Laboratories (MERL)
1 shared publication - Kieran Parsons
Mitsubishi Electric Research Laboratories, Cambridge, MA, USA
1 shared publication Meisam Razaviyayn
University of Southern California
1 shared publication- Toshiaki Koike-Akino
Mitsubishi Electric Research Laboratories (MERL), Cambridge, MA, USA
1 shared publication - Ye Wang
Mitsubishi Electric Research Laboratories (MERL), Cambridge, MA, USA
1 shared publication
Latest Publications
- Open Access
- 31 March 2025
- Published by Society for Privacy and Confidentiality Research in Journal of Privacy and Confidentiality
- Vol. 15 (1)
Private Stochastic Optimization with Large Worst-Case Lipschitz Parameter
We study differentially private (DP) stochastic optimization (SO) with loss functions whose worst-case Lipschitz parameter over all data points may be huge or infinite. To date, the most work on DP SO assumes that the loss is uniformly Lipschitz continuous over data (i.e. stochastic gradients are uniformly bounded over all data points). While this assumption is convenient, it often leads to pessimistic excess risk bounds. In practical problems, the worst-case Lipschitz parameter of the loss over all data points may be huge due to outliers and/or heavy-tailed data. In such cases, the error bounds for DP SO, which scale with the worst-case Lipschitz parameter of the loss, are vacuous. To address these limitations, this work provides improved excess risk bounds that do not depend on the worst-case Lipschitz parameter of the loss. Building on a recent line of work (Wang et al., 2020; Kamath et al., 2022), we assume that stochastic gradients have bounded $k$-th order moments for some $k \geq 2$. Compared with works on uniformly Lipschitz DP SO, our excess risk scales with the $k$-th moment bound instead of the worst-case Lipschitz parameter of the loss, allowing for significantly faster rates in the presence of outliers and/or heavy-tailed data. For smooth convex loss functions, we provide linear-time algorithms with state-of-the-art excess risk. We complement our excess risk upper bounds with novel lower bounds. In certain parameter regimes, our linear-time excess risk bounds are minimax optimal. Second, we provide the first algorithm to handle non-smooth convex loss functions. To do so, we develop novel algorithmic and stability-based proof techniques, which we believe will be useful for future work in obtaining optimal excess risk. Finally, our work is the first to address non-convex non-uniformly Lipschitz loss functions satisfying the Proximal-PL inequality. Our Proximal-PL algorithm has near-optimal excess risk.- 31 March 2025
- Published by Society for Privacy and Confidentiality Research in Journal of Privacy and Confidentiality
- Vol. 15 (1)
Open AccessPrivate Stochastic Optimization with Large Worst-Case Lipschitz Parameter
We study differentially private (DP) stochastic optimization (SO) with loss functions whose worst-case Lipschitz parameter over all data points may be huge or infinite. To date, the most work on DP SO assumes that the loss is uniformly Lipschitz continuous over data (i.e. stochastic gradients are uniformly bounded over all data points). While this assumption is convenient, it often leads to pessimistic excess risk bounds. In practical problems, the worst-case Lipschitz parameter of the loss over all data points may be huge due to outliers and/or heavy-tailed data. In such cases, the error bounds for DP SO, which scale with the worst-case Lipschitz parameter of the loss, are vacuous. To address these limitations, this work provides improved excess risk bounds that do not depend on the worst-case Lipschitz parameter of the loss. Building on a recent line of work (Wang et al., 2020; Kamath et al., 2022), we assume that stochastic gradients have bounded $k$-th order moments for some $k \geq 2$. Compared with works on uniformly Lipschitz DP SO, our excess risk scales with the $k$-th moment bound instead of the worst-case Lipschitz parameter of the loss, allowing for significantly faster rates in the presence of outliers and/or heavy-tailed data. For smooth convex loss functions, we provide linear-time algorithms with state-of-the-art excess risk. We complement our excess risk upper bounds with novel lower bounds. In certain parameter regimes, our linear-time excess risk bounds are minimax optimal. Second, we provide the first algorithm to handle non-smooth convex loss functions. To do so, we develop novel algorithmic and stability-based proof techniques, which we believe will be useful for future work in obtaining optimal excess risk. Finally, our work is the first to address non-convex non-uniformly Lipschitz loss functions satisfying the Proximal-PL inequality. Our Proximal-PL algorithm has near-optimal excess risk. - Open Access
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3466-3480
Analyzing Inference Privacy Risks Through Gradients In Machine Learning
In distributed learning settings, models are iteratively updated with shared gradients computed from potentially sensitive user data. While previous work has studied various privacy risks of sharing gradients, our paper aims to provide a systematic approach to analyze private information leakage from gradients. We present a unified game-based framework that encompasses a broad range of attacks including attribute, property, distributional, and user disclosures. We investigate how different uncertainties of the adversary affect their inferential power via extensive experiments on five datasets across various data modalities. Our results demonstrate the inefficacy of solely relying on data aggregation to achieve privacy against inference attacks in distributed learning. We further evaluate five types of defenses, namely, gradient pruning, signed gradient descent, adversarial perturbations, variational information bottleneck, and differential privacy, under both static and adaptive adversary settings. We provide an information-theoretic view for analyzing the effectiveness of these defenses against inference from gradients. Finally, we introduce a method for auditing attribute inference privacy, improving the empirical estimation of worst-case privacy through crafting adversarial canary records.
- 2 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 3466-3480
Open AccessAnalyzing Inference Privacy Risks Through Gradients In Machine Learning
In distributed learning settings, models are iteratively updated with shared gradients computed from potentially sensitive user data. While previous work has studied various privacy risks of sharing gradients, our paper aims to provide a systematic approach to analyze private information leakage from gradients. We present a unified game-based framework that encompasses a broad range of attacks including attribute, property, distributional, and user disclosures. We investigate how different uncertainties of the adversary affect their inferential power via extensive experiments on five datasets across various data modalities. Our results demonstrate the inefficacy of solely relying on data aggregation to achieve privacy against inference attacks in distributed learning. We further evaluate five types of defenses, namely, gradient pruning, signed gradient descent, adversarial perturbations, variational information bottleneck, and differential privacy, under both static and adaptive adversary settings. We provide an information-theoretic view for analyzing the effectiveness of these defenses against inference from gradients. Finally, we introduce a method for auditing attribute inference privacy, improving the empirical estimation of worst-case privacy through crafting adversarial canary records.