ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2606.00342v1· 20 results

cs.CRcs.LGeess.SPRecentMar 27, 2026

On the Optimal Number of Grids for Differentially Private Non-Interactive $K$-Means Clustering

Gokularam Muthukrishnan, Anshoo Tandon

This paper proposes a principled, theoretically derived rule for selecting the optimal grid size in differentially private non-interactive K-Means clustering, improving accuracy over existing empirica…

View →
cs.LGcs.CRmath.STRecentApr 1, 2026

Differentially Private Manifold Denoising

Jiaqi Wu, Yiqing Sun, Zhigang Yao

The paper introduces a differentially private manifold denoising framework that allows noisy, non-private query points to be corrected using sensitive reference data while providing formal $(\varepsil…

View →
cs.LGcs.CRRecentApr 22, 2026

Differentially Private Clustered Federated Learning with Privacy-Preserving Initialization and Normality-Driven Aggregation

Jie Xu, Haaris Mehmood, Rogier Van Dalen, Karthikeyan Saravanan +1 more

The paper proposes PINA, a two-stage differentially private clustered federated learning framework that improves convergence and robustness by using low-rank adaptation and a normality-driven aggregat…

View →
cs.CRRecentApr 1, 2026

Preserving Target Distributions With Differentially Private Count Mechanisms

Nitin Kohli, Paul Laskowski

The paper proposes a novel two-stage framework to differentially privatize tables of counts by focusing on preserving the accuracy of the underlying count distribution, introducing the specialized cyc…

View →
cs.CRcs.DScs.LGRecentMay 27, 2026

Privately Estimating Monotone Statistics in Polynomial Time

Gavin Brown, Ephraim Linder, Mahbod Majid, Vikrant Singhal

The paper introduces novel, efficient differentially private algorithms for estimating monotone statistics, significantly improving sample complexity compared to existing methods.

View →
cs.DSEmpiricalRecentJun 15, 2026

Scalable K-clique Estimation with Differential Privacy

Dung Nguyen, Ritwick Mishra, Anil Vullikanti

This paper introduces a new algorithm for estimating $k$-clique counts with differential privacy, which is scalable and significantly faster than previous methods.

View →
cs.ITcs.CRTheoreticalRecentJul 20, 2026

Optimal Domain-Aware Privacy Mechanisms for Synthetic Data Generation

Sajani Vithana, Sangwon Jung, Haoyang Hu, Viveck R. Cadambe +2 more

This paper lays the theoretical foundation for incorporating public data into differential privacy mechanisms for improved synthetic data generation.

View →
stat.MLcs.CRcs.LGRecentMay 11, 2026

Differentially Private Sampling from Distributions via Wasserstein Projection

Shokichi Takakura, Seng Pei Liew, Satoshi Hasegawa

This paper introduces a novel framework for differentially private sampling by using the Wasserstein distance as the utility measure, proposing the Wasserstein Projection Mechanism (WPM) to address li…

View →
cs.DSEmpiricalRecentJun 12, 2026

An Efficient Private Algorithm for Community Detection

Vincent Cohen-Addad, Alessandro Epasto, Haim Kaplan, Hanna Komlós +1 more

This paper introduces private and efficient algorithms for exact community detection in the stochastic block model under privacy constraints, achieving near-linear time and space complexity.

View →
cs.CRcs.SIRecentMar 19, 2026

SoK: Practical Aspects of Releasing Differentially Private Graphs

Nicholas D'Silva, Surya Nepal, Salil S. Kanhere

This paper provides a comprehensive, practitioner-oriented framework and survey to guide the selection and evaluation of differentially private methods for releasing sensitive graph data.

View →
cs.DScs.CRRecentJun 4, 2026

Multi-Objective Submodular Maximization with Differential Privacy

Ting Hou, Yanhao Wang, Yiping Wang, Cen Chen +2 more

This paper addresses the challenging problem of multi-objective submodular maximization under a cardinality constraint while ensuring differential privacy, proposing novel algorithms with approximatio…

View →
cs.CRcs.LGEmpiricalRecentJul 3, 2026

Scalable Differentially Private Data Compression via Diffusion and Stochastic Codes

Gergely Flamich, Oykü Sıla Güner, Yanxiao Liu, Deniz Gündüz

This paper introduces DP-DiPP, a compression pipeline for differentially private image data using stochastic codes and diffusion models, achieving significant compression rates while retaining compara…

View →
cs.LGcs.AIcs.CRRecentApr 22, 2026

Differentially Private Model Merging

Qichuan Yin, Manzil Zaheer, Tian Li

This paper proposes two post-processing techniques, random selection and linear combination, to construct a model that satisfies any desired differential privacy level without retraining, given a set…

View →
cs.ITcs.CRcs.LGRecentMay 28, 2026

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

Madhura Pathegama, Srikanth Avasarala, Viveck R. Cadambe, Juba Ziani

The paper demonstrates that by introducing carefully designed correlations among locally added noise variables, local differential privacy mechanisms can achieve an estimation cost matching the optima…

View →
cs.CRRecentMay 15, 2026

Rethinking the Security of DP-SGD: A Corrected Analysis of Differentially Private Machine Learning

Wenhao Wang, Shujie Cui, Hui Cui, Xingliang Yuan

This paper corrects the theoretical analysis of DP-SGD by identifying that common implementations, which use batch averaging, result in weaker privacy guarantees than previously reported.

View →
cs.CRRecentMay 25, 2026

Efficient and Privacy-Preserving Distribution Statistics Analytics on Mobile Spatial Data

Xuhao Ren, Mingyang Zhao, Ruichen Zhang, Liehuang Zhu +1 more

The paper proposes eSpat-B and eSpat+ systems to enable efficient and privacy-preserving distribution statistics analysis on massive, dynamic mobile spatial data.

View →
cs.CRstat.METheoreticalRecentJul 24, 2026

A Maximum Entropy Implementation of Differential Privacy Under Linear Invariants

Ryan Lafferty, Anindya Roy

This paper proposes a high entropy differential privacy implementation that maintains aggregation invariants with probability one or exponentially close to one.

View →
cs.CRcs.LGRecentMay 13, 2026

Limits of Personalizing Differential Privacy Budgets

Edwige Cyffers, Juba Ziani

The paper demonstrates that for mean estimation under differential privacy, the benefits of fully personalized privacy budgets are often limited, suggesting that choosing the correct effective budget…

View →
cs.CRRecentMar 25, 2026

PAC-DP: Personalized Adaptive Clipping for Differentially Private Federated Learning

Hao Zhou, Siqi Cai, Hua Dai, Geng Yang +2 more

The paper proposes PAC-DP, a personalized adaptive clipping framework that dynamically adjusts gradient clipping thresholds based on the desired privacy budget, significantly improving the privacy-uti…

View →