Stochastic privacy-preserving methods for nonconvex sparse learning

DOI10.1016/J.INS.2022.09.062MaRDI QIDQ6496176zbMATH OpenFDO

Authors Guannan Liang, Qianqian Tong, Jiahao Ding, Miao Pan, Jin-Bo Bi

Publication date 2 May 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2022.09.062

zbMATH Keywords

differential privacysparse learningstochastic algorithm

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites work

• Correlated tuple data release via differential privacy
• Differentially private empirical risk minimization
• Greedy sparsity-constrained optimization
• scientific article; zbMATH DE number 3173999 (Why is no real title available?)
• Iterative hard thresholding for compressed sensing
• Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
• Matching pursuits with time-frequency dictionaries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• The optimal upper bound of the number of queries for Laplace mechanism under differential privacy
• Theory of Cryptography
• What can we learn privately?

This page was built for publication: Stochastic privacy-preserving methods for nonconvex sparse learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496176)