Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Matt, Hannes, Stöger, Dominik
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Information Theory Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries
por: Ling, Shuyang
Publicado: (2021)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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