Differential Privacy Mechanisms in Neural Tangent Kernel Regression
Not on the map. Why?
Abstract (arXiv)
Training data privacy is a fundamental problem in modern Artificial Intelligence (AI) applications, such as face recognition, recommendation systems, language generation, and many others, as it may contain sensitive user information related to legal issues. To fundamentally understand how privacy mechanisms work in AI applications, we study differential privacy (DP) in the Neural Tangent Kernel (NTK) regression setting, where DP is one of the most powerful tools for measuring privacy under statistical learning, and NTK is one of the most popular analysis frameworks for studying the learning mechanisms of deep neural networks. In our work, we can show provable guarantees for both differential privacy and test accuracy of our NTK regression. Furthermore, we conduct experiments on the basic image classification dataset CIFAR10 to demonstrate that NTK regression can preserve good accuracy under a modest privacy budget, supporting the validity of our analysis. To our knowledge, this is the first work to provide a DP guarantee for NTK regression.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 105 of its 142 references that are in the map. First posted on arXiv 18 Jul 2024.
Builds on
105 of 142 references.
References · 105
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2023GPT-4 Technical Reportcited by 18,132
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
- 2021On the Opportunities and Risks of Foundation Modelscited by 3,961
- 2016Deep Learning with Differential Privacycited by 2,682
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
38 more
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2021Large Language Models Can Be Strong Differentially Private Learnerscited by 405
- 2021Differentially Private Fine-tuning of Language Modelscited by 392
- 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
- 2023Multi-step Jailbreaking Privacy Attacks on ChatGPTcited by 320
- 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
- 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 267
- 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 260
- 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 221
- 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
- 2019Towards moderate overparameterization: global convergence guarantees for training shallow neural networkscited by 176
- 2021Numerical Composition of Differential Privacycited by 174
- 2019Towards Understanding the Spectral Bias of Deep Learningcited by 173
- 2023How to DP-fy ML: A Practical Guide to Machine Learning with Differential Privacycited by 150
- 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 146
- 2018Stochastic Gradient Descent Optimizes Over-parameterized Deep ReLU Networkscited by 139
- 2017Deep Learning based Recommender System: A Survey and New Perspectivescited by 136
- 2019An Improved Analysis of Training Over-parameterized Deep Neural Networkscited by 120
- 2019Polylogarithmic width suffices for gradient descent to achieve arbitrarily small test error with shallow ReLU networkscited by 120
- 2022A Kernel-Based View of Language Model Fine-Tuningcited by 118
- 2022Benign Overfitting in Two-layer Convolutional Neural Networkscited by 90
- 2018Overparameterized Nonlinear Learning: Gradient Descent Takes the Shortest Path?cited by 87
- 2019How Much Over-parameterization Is Sufficient to Learn Deep ReLU Networks?cited by 84
- 2020The Interpolation Phase Transition in Neural Networks: Memorization and Generalization under Lazy Trainingcited by 84
- 2018On the Convergence Rate of Training Recurrent Neural Networkscited by 82
- 2021Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Biascited by 82
- 2022Differentially Private Language Models for Secure Data Sharingcited by 68
- 2019Generalization Guarantees for Neural Networks via Harnessing the Low-rank Structure of the Jacobiancited by 67
- 2020When Machine Learning Meets Privacy: A Survey and Outlookcited by 67
- 2024JailbreakZoo: Survey, Landscapes, and Horizons in Jailbreaking Large Language and Vision-Language Modelscited by 67
- 2021Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Timecited by 62
- 2019Quadratic Suffices for Over-parametrization via Matrix Chernoff Boundcited by 58
- 2020Training (Overparametrized) Neural Networks in Near-Linear Timecited by 58
- 2022Mixed Differential Privacy in Computer Visioncited by 53
- 2022A Theoretical Analysis on Feature Learning in Neural Networks: Emergence from Inputs and Advantage over Fixed Featurescited by 49
- 2022When Does Differentially Private Learning Not Suffer in High Dimensions?cited by 48
- 2023Privacy in Large Language Models: Attacks, Defenses and Future Directionscited by 48
50 most cited of 105 All 105 (JSON)
Built on by
Citing papers per year: 2024: 5; 2025: 9.
14 papers.
Sort:
By area:
- 2024LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformerscited by 35
- 2024Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Timecited by 22
- 2025High-Order Matching for One-Step Shortcut Diffusion Modelscited by 15
- 2025Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modelingcited by 12
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flowscited by 9
- 2025Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transformcited by 9
- 2024Fast John Ellipsoid Computation with Differential Privacy Optimizationcited by 7
- 2025Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapsecited by 7
- 2025Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approachescited by 4
- 2025HOFAR: High-Order Augmentation of Flow Autoregressive Transformerscited by 4
- 2024Inverting the Leverage Score Gradient: An Efficient Approximate Newton Methodcited by 3
- 2024Differentially Private Kernel Density Estimationcited by 2
- 2025Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse22 May 2025
- 2025Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform17 May 2025
- 2025How Private is Your Attention? Bridging Privacy with In-Context Learning22 Apr 2025
- 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiency18 Mar 2025
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows12 Mar 2025
- 2025HOFAR: High-Order Augmentation of Flow Autoregressive Transformers11 Mar 2025
- 2025Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approaches3 Mar 2025
- 2025Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modeling12 Feb 2025
- 2025High-Order Matching for One-Step Shortcut Diffusion Models2 Feb 2025
- 2024LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers17 Dec 2024
- 2024Differentially Private Kernel Density Estimation3 Sep 2024
- 2024Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time23 Aug 2024
- 2024LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformerscited by 35
- 2025High-Order Matching for One-Step Shortcut Diffusion Modelscited by 15
- 2025Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modelingcited by 12
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flowscited by 9
- 2025HOFAR: High-Order Augmentation of Flow Autoregressive Transformerscited by 4
- 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiencycited by 2
- 2025Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiency18 Mar 2025
- 2025Theoretical Guarantees for High Order Trajectory Refinement in Generative Flows12 Mar 2025
- 2025HOFAR: High-Order Augmentation of Flow Autoregressive Transformers11 Mar 2025
- 2025Force Matching with Relativistic Constraints: A Physics-Inspired Approach to Stable and Efficient Generative Modeling12 Feb 2025
- 2025High-Order Matching for One-Step Shortcut Diffusion Models2 Feb 2025
- 2024LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers17 Dec 2024
- 2024Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Timecited by 22
- 2025Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transformcited by 9
- 2024Fast John Ellipsoid Computation with Differential Privacy Optimizationcited by 7
- 2025Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapsecited by 7
- 2025Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approachescited by 4
- 2024Inverting the Leverage Score Gradient: An Efficient Approximate Newton Methodcited by 3
- 2024Differentially Private Kernel Density Estimationcited by 2
- 2025How Private is Your Attention? Bridging Privacy with In-Context Learningcited by 0
- 2025Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse22 May 2025
- 2025Fast RoPE Attention: Combining the Polynomial Method and Fast Fourier Transform17 May 2025
- 2025How Private is Your Attention? Bridging Privacy with In-Context Learning22 Apr 2025
- 2025Scaling Law Phenomena Across Regression Paradigms: Multiple and Kernel Approaches3 Mar 2025
- 2024Differentially Private Kernel Density Estimation3 Sep 2024
- 2024Multi-Layer Transformers Gradient Can be Approximated in Almost Linear Time23 Aug 2024
- 2024Inverting the Leverage Score Gradient: An Efficient Approximate Newton Method21 Aug 2024
- 2024Fast John Ellipsoid Computation with Differential Privacy Optimization12 Aug 2024