Efficient private SCO for heavy-tailed data via averaged clipping

C Jin, K Zhou, B Han, J Cheng, T Zeng - Machine Learning, 2024 - Springer
We consider stochastic convex optimization for heavy-tailed data with the guarantee of
being differentially private (DP). Most prior works on differentially private stochastic convex …

Truthful High Dimensional Sparse Linear Regression

L Zhu, A Manseur, M Ding, J Liu, J Xu… - arXiv preprint arXiv …, 2024 - arxiv.org
We study the problem of fitting the high dimensional sparse linear regression model with sub-
Gaussian covariates and responses, where the data are provided by strategic or self …

Differentially private stochastic convex optimization in (non)-Euclidean space revisited

J Su, C Zhao, D Wang - Uncertainty in Artificial Intelligence, 2023 - proceedings.mlr.press
In this paper, we revisit the problem of Differentially Private Stochastic Convex Optimization
(DP-SCO) in Euclidean and general $\ell_p^ d $ spaces. Specifically, we focus on three …

Differentially private episodic reinforcement learning with heavy-tailed rewards

Y Wu, X Zhou, SR Chowdhury… - … Conference on Machine …, 2023 - proceedings.mlr.press
In this paper we study the problem of (finite horizon tabular) Markov decision processes
(MDPs) with heavy-tailed rewards under the constraint of differential privacy (DP) …

Gradient complexity and non-stationary views of differentially private empirical risk minimization

D Wang, J Xu - Theoretical Computer Science, 2024 - Elsevier
In this paper, we study the Differentially Private Empirical Risk Minimization (DP-ERM)
problem, considering both convex and non-convex loss functions. For cases where DP-ERM …

Private Least Absolute Deviations with Heavy-tailed Data

D Wang, J Xu - Theoretical Computer Science, 2025 - Elsevier
We study the problem of Differentially Private Stochastic Convex Optimization (DPSCO) with
heavy-tailed data. Specifically, we focus on the problem of Least Absolute Deviations, ie, ℓ 1 …

Finite Sample Guarantees of Differentially Private Expectation Maximization Algorithm

D Wang, J Ding, L Hu, Z Xie, M Pan, J Xu - ECAI 2023, 2023 - ebooks.iospress.nl
Abstract (Gradient) Expectation Maximization (EM) is a widely used algorithm for estimating
the maximum likelihood of mixture models or incomplete data problems. A major challenge …

A unified momentum-based paradigm of decentralized SGD for non-convex models and heterogeneous data

H Du, C Cheng, C Ni - Artificial Intelligence, 2024 - Elsevier
Emerging distributed applications recently boosted the development of decentralized
machine learning, especially in IoT and edge computing fields. In real-world scenarios, the …

Machine Learning with Differential Privacy

AD Sarwate - Handbook of Sharing Confidential Data, 2024 - taylorfrancis.com
In this chapter we take up the problem of machine learning for private or sensitive data. The
phrase “privacy-preserving machine learning” can refer to myriad models for privacy and …

Revisiting Differentially Private ReLU Regression

M Ding, M Lei, L Zhu, S Wang, D Wang, J Xu - The Thirty-eighth Annual … - openreview.net
As one of the most fundamental non-convex learning problems, ReLU regression under
differential privacy (DP) constraints, especially in high-dimensional settings, remains a …