Understanding Implicit Regularization in Over-Parameterized Single Index Model
Jianqing Fan, Zhuoran Yang, Mengxin Yu

TL;DR
This paper investigates how over-parameterized gradient descent algorithms implicitly regularize high-dimensional single index models, achieving optimal statistical rates without explicit regularization, especially for heavy-tailed data.
Contribution
It introduces a regularization-free approach using over-parameterization and gradient descent for vector and matrix single index models with theoretical guarantees.
Findings
Achieves minimax optimal convergence rates.
Outperforms classical regularized methods empirically.
Handles heavy-tailed data effectively.
Abstract
In this paper, we leverage over-parameterization to design regularization-free algorithms for the high-dimensional single index model and provide theoretical guarantees for the induced implicit regularization phenomenon. Specifically, we study both vector and matrix single index models where the link function is nonlinear and unknown, the signal parameter is either a sparse vector or a low-rank symmetric matrix, and the response variable can be heavy-tailed. To gain a better understanding of the role played by implicit regularization without excess technicality, we assume that the distribution of the covariates is known a priori. For both the vector and matrix settings, we construct an over-parameterized least-squares loss function by employing the score function transform and a robust truncation step designed specifically for heavy-tailed data. We propose to estimate the true parameter…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRandom Matrices and Applications · Advanced Neuroimaging Techniques and Applications · Statistical Methods and Inference
