Provable Memorization via Deep Neural Networks using Sub-linear Parameters
Not on the map. Why?
Abstract (arXiv)
It is known that O(N) parameters are sufficient for neural networks to memorize arbitrary N input-label pairs. By exploiting depth, we show that O(N2/3) parameters suffice to memorize N pairs, under a mild condition on the separation of input points. In particular, deeper networks (even with width 3) are shown to memorize more pairs than shallow networks, which also agrees with the recent line of works on the benefits of depth for function approximation. We also provide empirical results that support our theoretical findings.
Key facts. Cited by 34 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 5; 2023: 10; 2024: 6; 2025: 7; 2026: 2.
34 papers.
Sort:
By area:
- 2021Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformerscited by 101
- 2023Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?cited by 46
- 2021On the Optimal Memorization Power of ReLU Neural Networkscited by 40
- 2023Memorization Capacity of Multi-Head Attention in Transformerscited by 39
- 2023On the training and generalization of deep operator networkscited by 31
- 2022Designing Universal Causal Deep Learning Models: The Geometric (Hyper)Transformercited by 22
- 2024On the Complexity of Neural Computation in Superpositioncited by 21
- 2023Minimum width for universal approximation using ReLU networks on compact domaincited by 17
- 2021An Exponential Improvement on the Memorization Capacity of Deep Threshold Networkscited by 14
- 2022Small Transformers Compute Universal Metric Embeddingscited by 12
- 2022Generalization Bounds for Stochastic Gradient Descent via Localized varepsilon-Coverscited by 11
- 2022Width is Less Important than Depth in ReLU Neural Networkscited by 10
22 more
- 2024On the Optimal Memorization Capacity of Transformerscited by 10
- 2022When Expressivity Meets Trainability: Fewer than n Neurons Can Workcited by 8
- 2024Expressive Power of ReLU and Step Networks under Floating-Point Operationscited by 5
- 2023Label-noise-tolerant medical image classification via self-attention and self-supervised learningcited by 4
- 2023Capacity Bounds for Hyperbolic Neural Network Representations of Latent Tree Structurescited by 4
- 2025Approximation Bounds for Transformer Networks with Application to Regressioncited by 4
- 2023Sharp Lower Bounds on Interpolation by Deep ReLU Neural Networks at Irregularly Spaced Datacited by 3
- 2023Memorization Capacity of Neural Networks with Conditional Computationcited by 3
- 2023Transformers Can Solve Non-Linear and Non-Markovian Filtering Problems in Continuous Time For Conditionally Gaussian Signalscited by 3
- 2025Approximation of Permutation Invariant Polynomials by Transformers: Efficient Construction in Column-Sizecited by 3
- 2021Bayesian Statistics Guided Label Refurbishment Mechanism: Mitigating Label Noise in Medical Image Classificationcited by 2
- 2024Constructive Universal Approximation and Finite Sample Memorization by Narrow Deep ReLU Networkscited by 2
- 2025Exact Sequence Interpolation with Transformerscited by 2
- 2025Minimum width for universal approximation using squashable activation functionscited by 2
- 2025Minimum Width of Deep Narrow Networks for Universal Approximationcited by 2
- 2023Memorization With Neural Nets: Going Beyond the Worst Casecited by 1
- 2024Interpolation with deep neural networks with non-polynomial activations: necessary and sufficient numbers of neuronscited by 1
- 2024Generalizability of Memorization Neural Networkscited by 1
- 2025Analyzing the Power of Chain of Thought through Memorization Capabilitiescited by 1
- 2025Generalizability of Neural Networks Minimizing Empirical Risk Based on Expressive Abilitycited by 0
- 2026Memorization capacity of deep ReLU neural networks characterized by width and depthcited by 0
- 2026Approximation Error Upper and Lower Bounds for H"older Class with Transformerscited by 0
- 2026Approximation Error Upper and Lower Bounds for H"older Class with Transformers8 May 2026
- 2026Memorization capacity of deep ReLU neural networks characterized by width and depth10 Mar 2026
- 2025Minimum Width of Deep Narrow Networks for Universal Approximation10 Nov 2025
- 2025Analyzing the Power of Chain of Thought through Memorization Capabilities3 Nov 2025
- 2025Approximation Bounds for Transformer Networks with Application to Regression16 Apr 2025
- 2025Minimum width for universal approximation using squashable activation functions10 Apr 2025
- 2025Generalizability of Neural Networks Minimizing Empirical Risk Based on Expressive Ability6 Mar 2025
- 2025Approximation of Permutation Invariant Polynomials by Transformers: Efficient Construction in Column-Size17 Feb 2025
- 2025Exact Sequence Interpolation with Transformers4 Feb 2025
- 2024Generalizability of Memorization Neural Networks1 Nov 2024
- 2024On the Optimal Memorization Capacity of Transformers26 Sep 2024
- 2024Constructive Universal Approximation and Finite Sample Memorization by Narrow Deep ReLU Networks10 Sep 2024
22 more
- 2024On the Complexity of Neural Computation in Superposition5 Sep 2024
- 2024Interpolation with deep neural networks with non-polynomial activations: necessary and sufficient numbers of neurons22 May 2024
- 2024Expressive Power of ReLU and Step Networks under Floating-Point Operations26 Jan 2024
- 2023Transformers Can Solve Non-Linear and Non-Markovian Filtering Problems in Continuous Time For Conditionally Gaussian Signals30 Oct 2023
- 2023Memorization With Neural Nets: Going Beyond the Worst Case30 Sep 2023
- 2023Minimum width for universal approximation using ReLU networks on compact domain19 Sep 2023
- 2023On the training and generalization of deep operator networks2 Sep 2023
- 2023Capacity Bounds for Hyperbolic Neural Network Representations of Latent Tree Structures18 Aug 2023
- 2023Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?26 Jul 2023
- 2023Label-noise-tolerant medical image classification via self-attention and self-supervised learning16 Jun 2023
- 2023Memorization Capacity of Multi-Head Attention in Transformers3 Jun 2023
- 2023Memorization Capacity of Neural Networks with Conditional Computation20 Mar 2023
- 2023Sharp Lower Bounds on Interpolation by Deep ReLU Neural Networks at Irregularly Spaced Data2 Feb 2023
- 2022When Expressivity Meets Trainability: Fewer than n Neurons Can Work21 Oct 2022
- 2022Generalization Bounds for Stochastic Gradient Descent via Localized varepsilon-Covers19 Sep 2022
- 2022Small Transformers Compute Universal Metric Embeddings14 Sep 2022
- 2022Width is Less Important than Depth in ReLU Neural Networks8 Feb 2022
- 2022Designing Universal Causal Deep Learning Models: The Geometric (Hyper)Transformer31 Jan 2022
- 2021On the Optimal Memorization Power of ReLU Neural Networks7 Oct 2021
- 2021Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers28 Jul 2021
- 2021Bayesian Statistics Guided Label Refurbishment Mechanism: Mitigating Label Noise in Medical Image Classification23 Jun 2021
- 2021An Exponential Improvement on the Memorization Capacity of Deep Threshold Networks14 Jun 2021
- 2021Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformerscited by 101
- 2023Are Transformers with One Layer Self-Attention Using Low-Rank Weight Matrices Universal Approximators?cited by 46
- 2021On the Optimal Memorization Power of ReLU Neural Networkscited by 40
- 2023Memorization Capacity of Multi-Head Attention in Transformerscited by 39
- 2023On the training and generalization of deep operator networkscited by 31
- 2022Designing Universal Causal Deep Learning Models: The Geometric (Hyper)Transformercited by 22
- 2024On the Complexity of Neural Computation in Superpositioncited by 21
- 2023Minimum width for universal approximation using ReLU networks on compact domaincited by 17
- 2021An Exponential Improvement on the Memorization Capacity of Deep Threshold Networkscited by 14
- 2022Small Transformers Compute Universal Metric Embeddingscited by 12
- 2022Generalization Bounds for Stochastic Gradient Descent via Localized varepsilon-Coverscited by 11
- 2022Width is Less Important than Depth in ReLU Neural Networkscited by 10
12 most cited of 33 All 33 (JSON)
- 2026Approximation Error Upper and Lower Bounds for H"older Class with Transformers8 May 2026
- 2026Memorization capacity of deep ReLU neural networks characterized by width and depth10 Mar 2026
- 2025Minimum Width of Deep Narrow Networks for Universal Approximation10 Nov 2025
- 2025Approximation Bounds for Transformer Networks with Application to Regression16 Apr 2025
- 2025Minimum width for universal approximation using squashable activation functions10 Apr 2025
- 2025Generalizability of Neural Networks Minimizing Empirical Risk Based on Expressive Ability6 Mar 2025
- 2025Approximation of Permutation Invariant Polynomials by Transformers: Efficient Construction in Column-Size17 Feb 2025
- 2025Exact Sequence Interpolation with Transformers4 Feb 2025
- 2024Generalizability of Memorization Neural Networks1 Nov 2024
- 2024On the Optimal Memorization Capacity of Transformers26 Sep 2024
- 2024Constructive Universal Approximation and Finite Sample Memorization by Narrow Deep ReLU Networks10 Sep 2024
- 2024On the Complexity of Neural Computation in Superposition5 Sep 2024
12 newest of 33 All 33 (JSON)