中文
相关论文

相关论文: Frequency Estimation in the Shuffle Model with Alm…

200 篇论文

We consider the problem of differentially private (DP) convex empirical risk minimization (ERM). While the standard DP-SGD algorithm is theoretically well-established, practical implementations often rely on shuffled gradient methods that…

机器学习 · 计算机科学 2026-02-25 Shuli Jiang , Pranay Sharma , Zhiwei Steven Wu , Gauri Joshi

Local Differential Privacy (LDP) protocols enable the collection of randomized client messages for data analysis, without the necessity of a trusted data curator. Such protocols have been successfully deployed in real-world scenarios by…

密码学与安全 · 计算机科学 2024-12-24 Bo Jiang , Wanrong Zhang , Donghang Lu , Jian Du , Qiang Yan

For single-carrier systems with frequency domain equalization, decision feedback equalization (DFE) performs better than linear equalization and has much lower computational complexity than sequence maximum likelihood detection. The main…

信息论 · 计算机科学 2015-05-27 Jovana Ilic , Thomas Strohmer

Proper communication is key to the adoption and implementation of differential privacy (DP). However, a prior study found that laypeople did not understand the data perturbation processes of DP and how DP noise protects their sensitive…

密码学与安全 · 计算机科学 2022-02-22 Aiping Xiong , Chuhao Wu , Tianhao Wang , Robert W. Proctor , Jeremiah Blocki , Ninghui Li , Somesh Jha

We study the phase transition phenomenon inherent in the shuffled (permuted) regression problem, which has found numerous applications in databases, privacy, data analysis, etc. In this study, we aim to precisely identify the locations of…

机器学习 · 统计学 2023-11-01 Hang Zhang , Ping Li

In this paper, we investigate one of the most fundamental nonconvex learning problems, ReLU regression, in the Differential Privacy (DP) model. Previous studies on private ReLU regression heavily rely on stringent assumptions, such as…

机器学习 · 计算机科学 2025-06-11 Meng Ding , Mingxi Lei , Shaowei Wang , Tianhang Zheng , Di Wang , Jinhui Xu

We address a decentralized wireless communication network with a fixed number $u$ of frequency sub-bands to be shared among $N$ transmitter-receiver pairs. It is assumed that the number of users $N$ is a random variable with a given…

信息论 · 计算机科学 2009-12-01 Kamyar Moshksar , Alireza Bayesteh , Amir K. Khandani

Estimating the quantiles of a large dataset is a fundamental problem in both the streaming algorithms literature and the differential privacy literature. However, all existing private mechanisms for distribution-independent quantile…

数据结构与算法 · 计算机科学 2022-01-11 Daniel Alabi , Omri Ben-Eliezer , Anamay Chaturvedi

In this note, we consider the problem of differentially privately (DP) computing an anonymized histogram, which is defined as the multiset of counts of the input dataset (without bucket labels). In the low-privacy regime $\epsilon \geq 1$,…

数据结构与算法 · 计算机科学 2021-11-08 Pasin Manurangsi

Hierarchical clustering is a fundamental unsupervised machine learning task with the aim of organizing data into a hierarchy of clusters. Many applications of hierarchical clustering involve sensitive user information, therefore motivating…

数据结构与算法 · 计算机科学 2025-04-23 Chengyuan Deng , Jie Gao , Jalaj Upadhyay , Chen Wang , Samson Zhou

Phase wrapping is a major problem in direction-of-arrival (DOA) estimation using phase-difference observations. For a sensor pair with an inter-sensor spacing greater than half of the wavelength ($\lambda/2$) of the signal, phase wrapping…

信号处理 · 电气工程与系统科学 2021-10-22 Hui Chen , Tarig Ballal , Tareq Y. Al-Naffouri

Diffusion modeling (DM) has high-quality generative performance, and the sampling problem is an important part of the DM performance. Thanks to efficient differential equation solvers, the sampling speed can be reduced while higher sampling…

计算机视觉与模式识别 · 计算机科学 2023-11-14 Zitong Cheng

We present an algorithm for computing $F_p$, the $p$th moment of an $n$-dimensional frequency vector of a data stream, for $2 < p < \log (n) $, to within $1\pm \epsilon$ factors, $\epsilon \in [n^{-1/p},1]$ with high constant probability.…

数据结构与算法 · 计算机科学 2015-03-19 Sumit Ganguly

Federated learning promises to make machine learning feasible on distributed, private datasets by implementing gradient descent using secure aggregation methods. The idea is to compute a global weight update without revealing the…

机器学习 · 计算机科学 2019-12-03 Badih Ghazi , Rasmus Pagh , Ameya Velingker

Fingerprinting arguments, first introduced by Bun, Ullman, and Vadhan (STOC 2014), are the most widely used method for establishing lower bounds on the sample complexity or error of approximately differentially private (DP) algorithms.…

密码学与安全 · 计算机科学 2024-07-08 Naty Peter , Eliad Tsfadia , Jonathan Ullman

We consider the problem of continually releasing an estimate of the population mean of a stream of samples that is user-level differentially private (DP). At each time instant, a user contributes a sample, and the users can arrive in…

机器学习 · 计算机科学 2022-12-21 Anand Jerry George , Lekshmi Ramesh , Aditya Vikram Singh , Himanshu Tyagi

Semidefinite programs (SDPs) are a fundamental class of optimization problems with important recent applications in approximation algorithms, quantum complexity, robust learning, algorithmic rounding, and adversarial deep learning. This…

数据结构与算法 · 计算机科学 2020-09-23 Haotian Jiang , Tarun Kathuria , Yin Tat Lee , Swati Padmanabhan , Zhao Song

Frequency estimation, a.k.a. histograms, is a workhorse of data analysis, and as such has been thoroughly studied under differentially privacy. In particular, computing histograms in the \emph{local} model of privacy has been the focus of a…

数据结构与算法 · 计算机科学 2024-09-05 Clément L. Canonne , Abigail Gentle

We present \textsf{ModularSubsetSelection} (MSS), a new algorithm for locally differentially private (LDP) frequency estimation. Given a universe of size $k$ and $n$ users, our $\varepsilon$-LDP mechanism encodes each input via a Residue…

密码学与安全 · 计算机科学 2025-11-18 Héber H. Arcolezi

This paper concerns {\em randomized} leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete $n$-node networks that runs in O(1) rounds and (with high probability) uses only…

数据结构与算法 · 计算机科学 2013-05-16 Shay Kutten , Gopal Pandurangan , David Peleg , Peter Robinson , Amitabh Trehan