Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Compression with bayesian implicit neural representations
Many common types of data can be represented as functions that map coordinates to signal
values, such as pixel locations to RGB values in the case of an image. Based on this view …
values, such as pixel locations to RGB values in the case of an image. Based on this view …
Privacy amplification via compression: Achieving the optimal privacy-accuracy-communication trade-off in distributed mean estimation
Privacy and communication constraints are two major bottlenecks in federated learning (FL)
and analytics (FA). We study the optimal accuracy of mean and frequency estimation …
and analytics (FA). We study the optimal accuracy of mean and frequency estimation …
Faster relative entropy coding with greedy rejection coding
Relative entropy coding (REC) algorithms encode a sample from a target distribution $ Q $
using a proposal distribution $ P $ using as few bits as possible. Unlike entropy coding, REC …
using a proposal distribution $ P $ using as few bits as possible. Unlike entropy coding, REC …
Algorithms for the communication of samples
The efficient communication of noisy data has applications in several areas of machine
learning, such as neural compression or differential privacy, and is also known as reverse …
learning, such as neural compression or differential privacy, and is also known as reverse …
Exact optimality of communication-privacy-utility tradeoffs in distributed mean estimation
We study the mean estimation problem under communication and local differential privacy
constraints. While previous work has proposed order-optimal algorithms for the same …
constraints. While previous work has proposed order-optimal algorithms for the same …
Greedy Poisson rejection sampling
G Flamich - Advances in Neural Information Processing …, 2024 - proceedings.neurips.cc
One-shot channel simulation is a fundamental data compression problem concerned with
encoding a single sample from a target distribution $ Q $ using a coding distribution $ P …
encoding a single sample from a target distribution $ Q $ using a coding distribution $ P …
Importance matching lemma for lossy compression with side information
We propose two extensions to existing importance sampling based methods for lossy
compression. First, we introduce an importance sampling based compression scheme that is …
compression. First, we introduce an importance sampling based compression scheme that is …
Channel simulation: Theory and applications to lossy compression and differential privacy
CT Li - Foundations and Trends® in Communications and …, 2024 - nowpublishers.com
One-shot channel simulation (or channel synthesis) has seen increasing applications in
lossy compression, differential privacy and machine learning. In this setting, an encoder …
lossy compression, differential privacy and machine learning. In this setting, an encoder …
Compression with exact error distribution for federated learning
Compression schemes have been extensively used in Federated Learning (FL) to reduce
the communication cost of distributed learning. While most approaches rely on a bounded …
the communication cost of distributed learning. While most approaches rely on a bounded …
Private frequency estimation via projective geometry
In this work, we propose a new algorithm ProjectiveGeometryResponse (PGR) for locally
differentially private (LDP) frequency estimation. For universe size of k and with n users, our …
differentially private (LDP) frequency estimation. For universe size of k and with n users, our …