Research map / Federated learning and privacy / Differential privacy
The Price of Privacy for Low-rank Factorization
Jalaj Upadhyay
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use the proposed private sketch-and-post-process low-rank factorization instead of Hardt-Roth | private low-rank factorization (random incoherent matrices) · synthetic matrices, varying alpha | additive error | Improved |
| apply careful post-processing to noisy sketches instead of using the noisy sketch directly | private low-rank factorization · theory (error bound) | additive error | Improved |
Closest papers by meaning
- Sampling-Free Privacy Accounting for Matrix Mechanisms under Random Allocation (NeurIPS 2026 · similarity 0.88)
- On Differentially Private Subspace Estimation in a Distribution-Free Setting (NeurIPS 2024 · similarity 0.87)
- A Private Approximation of the 2nd-Moment Matrix of Any Subsamplable Input (NeurIPS 2025 · similarity 0.86)
- An Iterative Algorithm for Differentially Private $k$-PCA with Adaptive Noise (NeurIPS 2025 · similarity 0.86)
- Perturb-and-Project: Differentially Private Similarities and Marginals (ICML 2024 · similarity 0.86)
- Privacy Amplification by Iteration for ADMM with (Strongly) Convex Objective Functions (AAAI 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
