DP-KFC: Data-Free Preconditioning for Privacy-Preserving Deep Learning
Not on the map. Why?
Abstract (arXiv)
Differentially private optimization suffers from a fundamental geometric mismatch: deep networks have highly anisotropic loss landscapes, yet DP-SGD injects isotropic noise. Second-order preconditioning can resolve this, but estimating curvature typically requires private data (consuming privacy budget) or public data (introducing distribution shift). We show that the Fisher Information Matrix decouples into architectural sensitivity, recoverable via synthetic noise, and input correlations, approximable from modality-specific frequency statistics. We propose DP-KFC, which constructs KFAC preconditioners by probing networks with structured synthetic noise, requiring neither private nor public data. Empirically, DP-KFC consistently outperforms DP-SGD and adaptive baselines across diverse modalities in strong privacy regimes (varepsilon ≤ 3). DP-KFC matches private-data preconditioners while public-data variants degrade by up to 4.8%, showing that curvature can be estimated without consuming privacy budget or introducing distribution shift. This enables privacy-preserving learning in specialized domains (e.g., medical applications) where regulatory constraints make data scarce.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 37 references that are in the map. First posted on arXiv 13 May 2026.
Builds on
27 of 37 references.
References · 27
- 2016Deep Learning with Differential Privacycited by 2,728
- 2018On the Spectral Bias of Neural Networkscited by 1,341
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2021Opacus: User-Friendly Differential Privacy Library in PyTorchcited by 383
- 2019Lower Bounds for Non-Convex Stochastic Optimizationcited by 307
- 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
- 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 290
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 261
- 2020Differentially Private Learning Needs Better Features (or Much More Data)cited by 235
- 2019Differentially Private Learning with Adaptive Clippingcited by 220
- 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
- 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
15 more
- 2020Understanding Gradient Clipping in Private SGD: A Geometric Perspectivecited by 142
- 2014Differentially Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Boundscited by 107
- 2018Universal Statistics of Fisher Information in Deep Neural Networks: Mean Field Approachcited by 91
- 2017Mean Field Residual Networks: On the Edge of Chaoscited by 83
- 2021Public Data-Assisted Mirror Descent for Private Model Trainingcited by 49
- 2023Kronecker-Factored Approximate Curvature for Modern Neural Network Architecturescited by 49
- 2022Private Adaptive Optimization with Side Informationcited by 38
- 2023DP-AdamBC: Your DP-Adam Is Actually DP-SGD (Unless You Apply Bias Correction)cited by 28
- 2021Differentially private inference via noisy optimizationcited by 27
- 2022Differentially Private Adaptive Optimization with Delayed Preconditionerscited by 18
- 2023Faster Differentially Private Convex Optimization via Second-Order Methodscited by 13
- 2024DiSK: Differentially Private Optimizer with Simplified Kalman Filter for Noise Reductioncited by 11
- 2024Oracle-Efficient Differentially Private Learning with Public Datacited by 6
- 2025On Design Principles for Private Adaptive Optimizerscited by 6
- 2025Kronecker-factored Approximate Curvature (KFAC) From Scratchcited by 6
Built on by
Not cited yet.