paper-with-me

홈 › Papers

Regularization Implies balancedness in the deep linear network

2025-11-03 · Kathryn Lindsey, Govind Menon arxiv

We use geometric invariant theory (GIT) to study the deep linear network (DLN). The Kempf-Ness theorem is used to establish that the $L^2$ regularizer is minimized on the balanced manifold. We introduce related balancing flows using the Riemannian geometry of fibers. The balancing flow defined by the $L^2$ regularizer is shown to converge to the balanced manifold at a uniform exponential rate. The balancing flow defined by the squared moment map is computed explicitly and shown to converge globally. This framework allows us to decompose the training dynamics into two distinct gradient flows: a regularizing flow on fibers and a learning flow on the balanced manifold. It also provides a common mathematical framework for balancedness in deep learning and linear systems theory. We use this framework to interpret balancedness in terms of fast-slow systems, model reduction and Bayesian principles.

📄 PDF Abstract BibTeX arXiv:2511.01137

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Implicit Regularization of Sharpness-Aware Minimization for Scale-Invariant Problems

2024-10-18 · Bingcong Li, Liang Zhang, Niao He

Sharpness-aware minimization (SAM) improves generalization of various deep learning tasks. Motivated by popular architectures such as LoRA, we explore the implicit regularization of SAM for scale-invariant problems invol…

Multi-task Linear Regression without Eigenvalue Lower Bounds: Adaptivity, Robustness, and Safety

2026-05-16 · Seok-Jin Kim arxiv

We study the multi-task linear regression problem in the presence of contaminated tasks. We address the setting where the unknown parameters of a majority of tasks are close in the $\ell_2$-norm, while a fraction of task…

Implicit Regularization in ReLU Networks with the Square Loss

2020-12-09 · Gal Vardi, Ohad Shamir

Understanding the implicit regularization (or implicit bias) of gradient descent has recently been a very active research area. However, the implicit regularization in nonlinear neural networks is still poorly understood…

Orthogonality-Promoting Distance Metric Learning: Convex Relaxation and Theoretical Analysis

2018-02-16 · ICML 2018 7 · Pengtao Xie, Wei Wu, Yichen Zhu, Eric P. Xing

Distance metric learning (DML), which learns a distance metric from labeled "similar" and "dissimilar" data pairs, is widely utilized. Recently, several works investigate orthogonality-promoting regularization (OPR), whi…

Metric Learning

Why the Rich Get Richer? On the Balancedness of Random Partition Models

2022-01-30 · Changwoo J. Lee, Huiyan Sang

Random partition models are widely used in Bayesian methods for various clustering tasks, such as mixture models, topic models, and community detection problems. While the number of clusters induced by random partition m…

Community DetectionEntity ResolutionTopic Models