Overparameterization enhances SAM's effectiveness in minimizing sharpness.
problem Improving generalization in deep neural networks.
method Analysis of Sharpness-Aware Minimization (SAM) under varying degrees of overparameterization.
result Overparameterization significantly improves SAM's performance, particularly in noisy and sparse settings.
Study shows overparameterization helps in generalizing from smooth interpolants.
problem Understanding generalization in overparameterized linear models.
method Analysis of random Fourier series model with weighted trigonometric interpolation.
result Weighted trigonometric interpolation leads to lower generalization error in overparameterized scenarios.
Overparameterized models are more vulnerable to membership inference attacks.
problem Vulnerability of overparameterized models to membership inference attacks.
method Theoretical and empirical analysis of overparameterized linear and ridge-regularized linear regression models in the Gaussian data setting.
result Increased number of parameters and model complexity increase vulnerability to membership inference attacks.
Overparameterized ensembles don't offer generalization benefits over single large models.
problem Theoretical limitations of ensembles in overparameterized settings.
method Using ensembles of random feature (RF) regressors, the paper clarifies how modern ensembles differ from underparameterized counterparts.
result Infinite ensembles of overparameterized RF regressors become pointwise equivalent to single infinite-width RF regressors, and finite width ensembles converge to single models with the same parameter budget.
This work analyzes how overparameterization aids GANs in reaching global saddle points.
problem Understanding the role of overparameterization in GANs for convergence to global saddle points.
method Theoretical and empirical analysis of overparameterized GANs with various architectures and datasets.
result GDA converges to a global saddle point in overparameterized GANs with certain assumptions.
Overparameterized models improve performance in sequential learning tasks.
problem Catastrophic forgetting in overparameterized neural networks.
method Two-task linear regression problem with random orthogonal transformations.
result Overparameterization mitigates catastrophic forgetting in sequential learning tasks.
Overparameterized models can worsen minority group errors even when overall test error improves.
problem Overparameterization exacerbates spurious correlations, harming minority groups.
method Simulations and experiments on image datasets, theoretical analysis of linear models.
result Subsampling the majority group can achieve low minority error in overparameterized models.
Estimates generalization gap for overparameterized models using Langevin approximation.
problem Estimating the difference between training and generalization performance in overparameterized models.
method Functional variance and Langevin approximation of functional variance.
result Demonstrates efficient estimation of generalization gaps for overparameterized models.
Meta learning works well with overparameterized models, a phenomenon called 'benign overfitting'.
problem Understanding why overparameterized models perform well in few-shot learning.
method Analyzed the generalization performance of gradient-based meta learning with an overparameterized meta linear regression model.
result Demonstrated that overparameterized meta learning can still generalize well, a phenomenon called 'benign overfitting'.
Weight normalization speeds up matrix sensing problems.
problem Matrix sensing with overparameterization.
method Generalized weight normalization with Riemannian optimization.
result WN achieves linear convergence, improving speed and complexity.
Overparameterized models generalize well despite fitting noisy data.
problem Understanding why overparameterized models generalize well despite fitting noisy data.
method Statistical signal processing perspective.
result Overparameterized models often outperform underparameterized models in test performance.
A new criterion selects models in overparameterized settings.
problem Model selection for overparameterized models with more parameters than data.
method Establishes Bayesian duality and introduces the Interpolating Information Criterion.
result The Interpolating Information Criterion selects models in overparameterized settings.
Improves overparameterized models' robustness to distribution shifts.
problem Accuracy drop on testing distributions different from training.
method Importance tempering to improve decision boundaries.
result State-of-the-art results on worst group classification tasks.
The paper shows how data and algorithm interactions affect overparameterized linear regression generalization.
problem Understanding generalization in overparameterized linear regression.
method Introducing data-algorithm compatibility and performing data-dependent trajectory analysis with gradient descent.
result Early stopping iterates lead to better generalization than last-iterate analysis, with weaker restrictions.
One of the most surprising and exciting discoveries in supervised learning was the benefit of overparameterization (i.e. training a very large model) to improving the optimization landscape of a problem, with minimal effect on statistical performance (i.e. generalization). In contrast, unsupervised settings have been u…
Sharp global guarantees for noisy overparameterized low-rank recovery.
problem Understanding practical success of overparameterization in noisy conditions.
method Unified proof technique combining escape directions and counterexample inexistence.
result Near-second-order points achieve minimax-optimal recovery bounds.
This paper explains how overparameterization aids in meta-learning with few samples.
problem Building a generalizable model with few samples in meta-learning.
method Analyzes the optimal linear representation and sample complexity for meta-learning tasks.
result Overparameterization naturally answers fundamental meta-learning questions, reducing sample complexity.
Bayesian method improves predictions in overparameterized nonlinear regression.
problem Understanding overparameterization in nonlinear regression models.
method Bayesian framework with adaptive prior considering data spectral structure.
result Posterior contraction established for generalized linear and single-neuron models, demonstrating prediction consistency.
Overparameterized models generalize well in offline contextual bandits, but policy-based algorithms struggle.
problem The performance gap between value-based and policy-based algorithms in offline contextual bandits with overparameterized models.
method Analysis of action-stability in objectives and formal proofs of regret bounds.
result The performance gap is due to action-stability of objectives, with value-based objectives being stable and policy-based objectives unstable.
The paper examines VI for overparameterized BNNs, revealing a trade-off between likelihood and KL terms.
problem Critical issue in mean-field VI training for overparameterized BNNs.
method Theoretical and empirical study of overparameterized two-layer BNNs using VI.
result A trade-off between likelihood and KL terms in overparameterized regime, with KL scaling crucial.
Uniform bounds for neural networks' generalization error in overparameterized settings.
problem Generalization error in overparameterized neural networks.
method Neural Tangent kernel theory and Mercer decomposition of the NT kernel in spherical harmonics.
result Uniform generalization bounds for overparameterized neural networks in RKHS.
Improved TD learning with neural nets reduces sample complexity and overparameterization.
problem Temporal difference learning with neural networks in large state spaces.
method Projection-free and max-norm regularized Neural TD learning, with Lyapunov drift analysis.
result Max-norm regularization significantly improves TD learning's sample complexity and overparameterization.
This work explains how large neural networks generalize well despite overparameterization.
problem Understanding the generalization behavior of large neural networks.
method Theoretical analysis of approximation and generalization errors in regression and classification tasks.
result Deep overparameterized neural networks are statistically consistent across different tasks when regularization is applied.
New approach uses compressible dynamics to train deep models efficiently.
problem Efficient training of deep overparameterized models with low-rank structures.
method Leveraging low-dimensional structures and compressible dynamics within model parameters.
result Improved training efficiency and reduced overfitting in language models.
Overparameterized MLR fits hyper-curves, improving model robustness.
problem Improper predictors degrade model generalizability.
method Parameterizing with a scalar and monomial basis, fitting hyper-curves.
result Hyper-curve approach yields robust predictions for noisy data.
New loss function restores importance weighting in overparameterized models.
problem Restoring importance weighting in overparameterized neural networks.
method Introduced polynomially-tailed losses to restore effects of importance weighting.
result Polynomially-tailed losses improve performance in correcting distribution shift.
Gradient descent with preconditioning finds global optima in overparameterized nonconvex factorization.
problem Finding global optima in nonconvex Burer-Monteiro factorization.
method Preconditioned gradient descent for overparameterized nonconvex function minimization.
result Gradient descent with preconditioning achieves linear convergence in the overparameterized case.
Classification and regression tasks in overparameterized models show different generalization properties.
problem Comparing classification and regression in overparameterized models.
method Comparison of least-squares minimum-norm interpolation and hard-margin SVM using different loss functions.
result Interpolating solutions generalize well with 0-1 loss but not with square loss.
Gradient method converges locally linearly for overparameterized Gaussian mixtures.
problem Learning Gaussian mixtures under overparameterization.
method Gradient-based method alternating short descent steps and long Polyak steps.
result Gradient method converges locally linearly to minimizers.
New method improves generalization in deep learning models.
problem Improving generalization in overparameterized deep neural networks.
method Stochastic Gauss-Newton method with Levenberg-Marquardt damping and mini-batch sampling.
result Established finite-time convergence and non-asymptotic generalization bounds.
Study shows overparameterization helps shallow neural networks recover signals in high dimensions.
problem Signal recovery in shallow neural networks with overparameterization.
method Gradient flow on population risk, Gaussian distribution assumption, high-dimensional limit analysis.
result Minimal overparameterization is sufficient for strong recovery of signals.
Sharp analysis of out-of-distribution error in overparameterized models with importance weights.
problem Understanding and quantifying the degradation of performance in overparameterized models when faced with underrepresented data.
method Sharp analysis of an overparameterized Gaussian mixture model with spurious features and cost-sensitive interpolating solutions incorporating importance weights.
result Characterization of a novel tradeoff between worst-case robustness and average accuracy as a function of importance weight magnitude.
Overparameterization aids in model pruning, leading to improved test accuracy.
problem Improving lightweight model performance through pruning.
method Theoretical analysis and high-dimensional asymptotics of model pruning in overparameterized neural networks.
result Even with known informative features, training a large model and then pruning leads to better test accuracy.
This study explains how different training methods affect the minimizer of neural networks.
problem How training methods influence the minimizer of neural networks.
method Explains how initialization size, adaptive optimization (AdaGrad), and stochastic mini-batch training affect the minimizer.
result Different training methods lead to different minimizers, even in overparameterized networks.
Deep ReLU networks with extra parameters have mostly good loss landscapes.
problem Finding good local minima in the loss landscape of deep neural networks.
method Analyzing shallow and deep ReLU networks with extra parameters on a generic dataset.
result Most activation patterns correspond to regions with no bad local minima.
New approach shows why overparameterized neural nets generalize well.
problem Understanding why overparameterized neural nets generalize well in practice.
method An alternative notion of capacity for attention-based models based on the effective rank of attention matrices.
result Generalization bound matches empirical scaling laws observed in large language models.
This paper investigates how synthetic data and overparameterization improve VAE generalization.
problem Improving generalization performance of Variational Autoencoders (VAEs).
method Investigates the effectiveness of synthetic data and overparameterization in VAEs.
result Training on synthetic data and using more parameters improves VAE generalization, inference, and robustness.
CPCR mitigates bias in PCR for overparameterized models.
problem Bias in Principal Component Regression (PCR) for overparameterized models.
method Calibrated Principal Component Regression (CPCR) learns a low-variance prior in the PC subspace and calibrates the model in the original feature space.
result CPCR outperforms standard PCR in overparameterized settings, improving prediction across multiple problems.
Efficiently compress overparameterized deep models by focusing on low-dimensional learning dynamics.
problem Overparameterized models increase computational and memory costs.
method Study of learning dynamics reveals updates occur within a low-dimensional subspace, leading to a compression algorithm.
result Compressed deep linear networks converge faster and yield smaller recovery errors.
Study shows DNNs can recover functions with fewer samples than model parameters at overparameterization.
problem Determining reliable function recovery in overparameterized deep neural networks.
method Introducing 'local linear recovery' (LLR) and proving upper bounds on sample sizes for recovery.
result Upper bounds on optimistic sample sizes for function recovery in overparameterized DNNs are achieved.
The paper analyzes how overparameterized models can generalize well in multiclass classification.
problem Generalization in multiclass classification with overparameterized models.
method Survival/contamination analysis framework adapted for multiclass classification.
result Multiclass classification can generalize well even with many classes, unlike regression tasks.
Overparameterization helps prevent forgetting in sequential learning tasks.
problem Catastrophic forgetting in continual learning systems.
method Analytical study of gradient descent with linear regression model.
result Overparameterization can mitigate forgetting in a two-task setting.
Recent studies show overparameterized neural networks behave like convex systems.
problem Understanding the behavior of overparameterized neural networks.
method Analysis of two-layer neural networks, focusing on restricted settings and neural tangent kernel space.
result Overparameterized neural networks behave like convex systems under certain conditions.
Improved guarantees for nonconvex matrix factorization with rank overparameterization.
problem Minimizing nonconvex objective over low-rank matrices.
method Overparameterized Burer--Monteiro approach, leveraging smoothness and strong convexity.
result Local optimization globally converges to global optimum under certain rank conditions.
Local SGD proves efficient in overparameterized linear regression.
problem Efficiently learning overparameterized linear models in distributed settings.
method Distributed SGD (DSGD) with overparameterized models.
result Excess risk of SGD is smaller than ridge regression in the same sample complexity.
KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.
problem Multi-way data imputation for high-dimensional functional MRI and dynamic graph recovery.
method Reformulates imputation as RKHS regression with TT-constrained coefficients and Hadamard overparameterization. Optimizes TT coefficients and kernel matrices on Riemannian manifolds.
result Consistently outperforms state-of-the-art methods in modeling accuracy.
KReTTaH uses tensor trains and Hadamard overparameterization for fast, interpretable multi-way data imputation.
problem Multi-way data imputation in high-dimensional spaces.
method Reformulates imputation as RKHS regression with TT-constrained coefficients, optimized on manifold frameworks.
result Consistently outperforms state-of-the-art methods in accuracy.
We theoretically study the landscape of the training error for neural networks in overparameterized cases. We consider three basic methods for embedding a network into a wider one with more hidden units, and discuss whether a minimum point of the narrower network gives a minimum or saddle point of the wider one. Our re…