Benign Overfitting in Two-Layer ReLU Convolutional Neural Networks for XOR Data
Not on the map. Why?
Abstract (arXiv)
Modern deep learning models are usually highly over-parameterized so that they can overfit the training data. Surprisingly, such overfitting neural networks can usually still achieve high prediction accuracy. To study this "benign overfitting" phenomenon, a line of recent works has theoretically studied the learning of linear models and two-layer neural networks. However, most of these analyses are still limited to the very simple learning problems where the Bayes-optimal classifier is linear. In this work, we investigate a class of XOR-type classification tasks with label-flipping noises. We show that, under a certain condition on the sample complexity and signal-to-noise ratio, an over-parameterized ReLU CNN trained by gradient descent can achieve near Bayes-optimal accuracy. Moreover, we also establish a matching lower bound result showing that when the previous condition is not satisfied, the prediction accuracy of the obtained CNN is an absolute constant away from the Bayes-optimal rate. Our result demonstrates that CNNs have a remarkable capacity to efficiently learn XOR problems, even in the presence of highly correlated features.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 3 Oct 2023.
Builds on
25 of 35 references.
References · 25
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2019Benign Overfitting in Linear Regressioncited by 544
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
- 2019Two models of double descent for weak featurescited by 194
- 2020Benign overfitting in ridge regressioncited by 152
- 2018Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networkscited by 140
- 2018Regularization Matters: Generalization and Optimization of Neural Nets v.s. their Induced Kernelcited by 131
- 2020On the Optimal Weighted ℓ2 Regularization in Overparameterized Linear Regressioncited by 97
- 2022Benign Overfitting in Two-layer Convolutional Neural Networkscited by 90
- 2020The Interpolation Phase Transition in Neural Networks: Memorization and Generalization under Lazy Trainingcited by 84
- 2020Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regimecited by 81
13 more
- 2019Beyond Linearization: On Quadratic and Higher-Order Approximation of Wide Neural Networkscited by 79
- 2022Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Datacited by 74
- 2021Benign Overfitting of Constant-Stepsize SGD for Linear Regressioncited by 71
- 2020A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descentcited by 69
- 2021Classifying high-dimensional Gaussian mixtures: Where kernel methods fail and neural networks succeedcited by 67
- 2021Risk Bounds for Over-parameterized Maximum Margin Classification on Sub-Gaussian Mixturescited by 48
- 2020Towards Understanding Hierarchical Learning: Benefits of Neural Representationscited by 46
- 2022Spectrum of inner-product kernel matrices in the polynomial regime and multiple descent phenomenon in kernel ridge regressioncited by 42
- 2022Precise Learning Curves and Higher-Order Scaling Limits for Dot Product Kernel Regressioncited by 22
- 2019A Random Matrix Perspective on Mixtures of Nonlinearities for Deep Learningcited by 20
- 2022Feature selection with gradient descent on two-layer networks in low-rotation regimescited by 13
- 2022Deep Linear Networks can Benignly Overfit when Shallow Ones Docited by 8
- 2023Per-Example Gradient Regularization Improves Learning Signals from Noisy Datacited by 7
Built on by
Citing papers per year: 2024: 5; 2025: 4; 2026: 1.
10 papers.
- 2024Overfitting Behaviour of Gaussian Kernel Ridgeless Regression: Varying Bandwidth or Dimensionalitycited by 7
- 2024Provably Neural Active Learning Succeeds via Prioritizing Perplexing Samplescited by 5
- 2024Provable Tempered Overfitting of Minimal Nets and Typical Netscited by 5
- 2025On the Role of Label Noise in the Feature Learning Processcited by 4
- 2024When Are Bias-Free ReLU Networks Effectively Linear Networks?cited by 3
- 2025Scanning Trojaned Models Using Out-of-Distribution Samplescited by 3
- 2024Understanding the Benefits of SimCLR Pre-Training in Two-Layer Convolutional Neural Networkscited by 2
- 2025Linearly Separable Features in Shallow Nonlinear Networks: Width Scales Polynomially with Intrinsic Data Dimensioncited by 1
- 2025Gradient Descent Robustly Learns the Intrinsic Dimension of Data in Training Convolutional Neural Networkscited by 0
- 2026The Conflict Between Logic and Memory: Training Conditions for Optimizer-Dependent Rule Acquisitioncited by 0
- 2026The Conflict Between Logic and Memory: Training Conditions for Optimizer-Dependent Rule Acquisition30 Sep 2026
- 2025On the Role of Label Noise in the Feature Learning Process25 May 2025
- 2025Gradient Descent Robustly Learns the Intrinsic Dimension of Data in Training Convolutional Neural Networks11 Apr 2025
- 2025Scanning Trojaned Models Using Out-of-Distribution Samples28 Jan 2025
- 2025Linearly Separable Features in Shallow Nonlinear Networks: Width Scales Polynomially with Intrinsic Data Dimension4 Jan 2025
- 2024Provable Tempered Overfitting of Minimal Nets and Typical Nets24 Oct 2024
- 2024Understanding the Benefits of SimCLR Pre-Training in Two-Layer Convolutional Neural Networks27 Sep 2024
- 2024Overfitting Behaviour of Gaussian Kernel Ridgeless Regression: Varying Bandwidth or Dimensionality5 Sep 2024
- 2024When Are Bias-Free ReLU Networks Effectively Linear Networks?18 Jun 2024
- 2024Provably Neural Active Learning Succeeds via Prioritizing Perplexing Samples6 Jun 2024