REVIEW 2 cited by
Improved Differential Privacy for SGD via Optimal Private Linear Operators on Adaptive Streams
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Motivated by recent applications requiring differential privacy over adaptive streams, we investigate the question of optimal instantiations of the matrix mechanism in this setting. We prove fundamental theoretical results on the applicability of matrix factorizations to adaptive streams, and provide a parameter-free fixed-point algorithm for computing optimal factorizations. We instantiate this framework with respect to concrete matrices which arise naturally in machine learning, and train user-level differentially private models with the resulting optimal mechanisms, yielding significant improvements in a notable problem in federated learning with user-level differential privacy.
Forward citations
Cited by 2 Pith papers
-
Improved Differentially Private Continual Observation Using Group Algebra
A claimed explicit matrix factorization using roots of unity would match the best known error bound for private continual counting, but the construction as written does not multiply back to the target matrix.
-
Balls-and-Bins Sampling for DP-SGD
Balls-and-Bins sampling for DP-SGD has a tight privacy analysis: as private as Poisson at large epsilon, with shuffle-comparable utility, verified by Monte Carlo accounting.
Discussion (0). Continue with ORCID to comment.