PulseAugur
EN
LIVE 13:46:29

New research advances differential privacy in machine learning

Researchers have developed new methods to enhance differential privacy in machine learning, particularly for decentralized and causal structure learning. One approach, DPDL, uses a similarity-based calibration technique with Gaussian noise to protect privacy in decentralized learning on non-IID data, achieving linear speedup. Another method leverages fully homomorphic encryption (FHE) to enable calculations on encrypted data for causal structure learning, employing circuit simplification and approximations to manage FHE's computational cost. Additionally, a new DP sketching mechanism based on fast transforms offers improved runtime for DP linear regression, and a local differential privacy model with correlated noise demonstrates that optimal centralized privacy costs can be achieved without sacrificing utility. AI

IMPACT These advancements in differential privacy techniques could enable more secure and robust AI systems, particularly in decentralized learning and causal inference.

RANK_REASON Multiple academic papers published on arXiv detailing novel methods for differential privacy in machine learning.

Read on arXiv cs.LG →

AI-generated summary · Google Gemini · from 5 sources. How we write summaries →

New research advances differential privacy in machine learning

COVERAGE [5]

  1. arXiv cs.LG TIER_1 English(EN) · Yunsheng Yuan, Xue Xiao, Lina Wang, Feng Li ·

    DPDL: Towards Differential Privacy Preservation in Decentralized Stochastic Learning on Non-IID Data

    arXiv:2606.04399v1 Announce Type: new Abstract: In the paradigm of decentralized learning, a group of agents collaborate to train a global model using distributed datasets without a central server. Although the power of collaboration has been verified by many state-of-the-art stu…

  2. arXiv cs.LG TIER_1 English(EN) · Jian Yang, Yuan Tong, Qinbin Li, Zeyi Wen, Xiaofang Zhou ·

    Preserving Data Privacy in Learning Causal Structure with Fully Homomorphic Encryption

    arXiv:2606.05129v1 Announce Type: cross Abstract: Preserving data privacy is an important topic in structural data management and data mining. However, the issue of privacy leakage in distributed causal structure learning is a persistent challenge, especially in cases where data …

  3. arXiv cs.LG TIER_1 English(EN) · Xiaofang Zhou ·

    Preserving Data Privacy in Learning Causal Structure with Fully Homomorphic Encryption

    Preserving data privacy is an important topic in structural data management and data mining. However, the issue of privacy leakage in distributed causal structure learning is a persistent challenge, especially in cases where data transmission and computation are required. In this…

  4. arXiv cs.LG TIER_1 English(EN) · Omri Lev, Moshe Shenfeld, Vishwak Srinivasan, Katrina Ligett, Ashia C. Wilson ·

    The Fast Mixing Mechanism for Differential Privacy

    arXiv:2605.30600v1 Announce Type: new Abstract: Randomized sketching is a central tool for compressing large-scale optimization problems while preserving accuracy. In particular, sketches that are based on structured matrices, such as the Hadamard matrix, can be applied efficient…

  5. arXiv cs.LG TIER_1 English(EN) · Madhura Pathegama, Srikanth Avasarala, Viveck R. Cadambe, Juba Ziani ·

    Local Differential Privacy with Correlated Noise Achieves Central-DP Optimal Cost

    arXiv:2605.30476v1 Announce Type: cross Abstract: We study privately estimating the sum of $n$ user-held values in the presence of an honest-but-curious server. This motivates requiring privacy not only at data release but also throughout server-side computation. We therefore ado…