Research map / Federated learning and privacy / Differential privacy
Back to Square Roots: An Optimal Bound on the Matrix Factorization Error for Multi-Epoch Differentially Private SGD
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Banded Square Root Matrix Factorization for Differentially Private Model Training (NeurIPS 2024 · similarity 0.92)
- Scaling up the Banded Matrix Factorization Mechanism for Large Scale Differentially Private ML (ICLR 2025 · similarity 0.89)
- Sampling-Free Privacy Accounting for Matrix Mechanisms under Random Allocation (NeurIPS 2026 · similarity 0.87)
- Correlated Noise Provably Beats Independent Noise for Differentially Private Learning (ICLR 2024 · similarity 0.86)
- Private Adaptive Covariance Estimation via Gaussian Graphical Models (NeurIPS 2026 · similarity 0.85)
- An Iterative Algorithm for Differentially Private $k$-PCA with Adaptive Noise (NeurIPS 2025 · similarity 0.85)
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.