Cover Image

Linear regression with overparameterized linear neural networks: Tight upper and lower bounds for implicit $\ell^1$-regularization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Matt, Hannes, Stöger, Dominik
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Information Theory Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-convex matrix sensing: Breaking the quadratic rank barrier in the sample complexity
by: Stöger, Dominik, et al.
Published: (2024)

Tight Regret Bounds for Bayesian Optimization in One Dimension
by: Scarlett, Jonathan
Published: (2018)

Local linear convergence of gradient methods for overparameterized Gaussian mixtures
by: Wang, Jingxing, et al.
Published: (2026)

Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis
by: Li, Gen, et al.
Published: (2021)

The augmented NLP bound for maximum-entropy remote sampling
by: Ponte, Gabriel, et al.
Published: (2026)

A Single-Loop First-Order Algorithm for Linearly Constrained Bilevel Optimization
by: Shen, Wei, et al.
Published: (2025)

High-probability sample complexities for policy evaluation with linear function approximation
by: Li, Gen, et al.
Published: (2023)

Convergence of linear programming hierarchies for Gibbs states of spin systems
by: Fawzi, Hamza, et al.
Published: (2025)

Exact objectives of random linear programs and mean widths of random polyhedrons
by: Stojnic, Mihailo
Published: (2024)

PtyGenography: using generative models for regularization of the phase retrieval problem
by: Aslan, Selin, et al.
Published: (2025)

Semidefinite lower bounds for covering codes
by: Gijswijt, Dion, et al.
Published: (2025)

An L-BFGS-B approach for linear and nonlinear system identification under $\ell_1$ and group-Lasso regularization
by: Bemporad, Alberto
Published: (2024)

Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
by: Liu, Yujie, et al.
Published: (2025)

A Neural Network Algorithm for KL Divergence Estimation with Quantitative Error Bounds
by: Foss, Mikil, et al.
Published: (2025)

A Dual Basis Approach for Structured Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2025)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
by: Zurek, Matthew, et al.
Published: (2025)

On the Convergence Analysis of Muon
by: Shen, Wei, et al.
Published: (2025)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
by: Zurek, Matthew, et al.
Published: (2025)

MLorc: Momentum Low-rank Compression for Memory Efficient Large Language Model Adaptation
by: Shen, Wei, et al.
Published: (2025)

Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation
by: Cui, Chengyu, et al.
Published: (2026)

Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least Squares
by: Kümmerle, Christian, et al.
Published: (2023)

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
by: Ling, Shuyang
Published: (2021)

On the Robustness of Cross-Concentrated Sampling for Matrix Completion
by: Cai, HanQin, et al.
Published: (2024)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

Optimal Variance-Dependent Regret Bounds for Infinite-Horizon MDPs
by: Zamir, Guy, et al.
Published: (2026)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
by: Yu, Qian, et al.
Published: (2024)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
by: Shen, Wei, et al.
Published: (2023)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
by: Zurek, Matthew, et al.
Published: (2024)

Variational Inference on the Boolean Hypercube with the Quantum Entropy
by: Beyler, Eliot, et al.
Published: (2024)

Span-Based Optimal Sample Complexity for Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2023)

Structured Sampling for Robust Euclidean Distance Geometry
by: Kundu, Chandra, et al.
Published: (2024)

More is Less: Inducing Sparsity via Overparameterization
by: Chou, Hung-Hsu, et al.
Published: (2021)

Adversarial Water-Filling: Theory, Algorithms and Foundation Model
by: Tong, Xindi, et al.
Published: (2026)

Group Projected Subspace Pursuit for Block Sparse Signal Reconstruction: Convergence Analysis and Applications
by: He, Roy Y., et al.
Published: (2024)

Geometry, Computation, and Optimality in Stochastic Optimization
by: Cheng, Chen, et al.
Published: (2019)

Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuning
by: Aolaritei, Liviu, et al.
Published: (2022)

Closed-form $\ell_r$ norm scaling with data for overparameterized linear regression and diagonal linear networks under $\ell_p$ bias
by: Zhang, Shuofeng, et al.
Published: (2025)

Taming "data-hungry" reinforcement learning? Stability in continuous state-action spaces
by: Duan, Yaqi, et al.
Published: (2024)

How to induce regularization in linear models: A guide to reparametrizing gradient flow
by: Chou, Hung-Hsu, et al.
Published: (2023)

Long-time dynamics and universality of nonconvex gradient descent
by: Han, Qiyang
Published: (2025)