Implicit Regularization Paths of Weighted Neural Representations
Jin-Hong Du, Pratik Patil

TL;DR
This paper investigates how weighting pretrained features affects regularization in neural networks, establishing equivalence paths for ridge estimators and proposing an efficient cross-validation method for tuning models.
Contribution
It introduces theoretical equivalence paths for weighted features and ridge regularization, and develops a practical cross-validation approach for model tuning.
Findings
Ridge estimators on weighted features are asymptotically equivalent along certain paths.
The results confirm conjectures about the existence of these paths in random and kernel features.
An efficient cross-validation method for tuning weighted pretrained representations is proposed.
Abstract
We study the implicit regularization effects induced by (observation) weighting of pretrained features. For weight and feature matrices of bounded operator norms that are infinitesimally free with respect to (normalized) trace functionals, we derive equivalence paths connecting different weighting matrices and ridge regularization levels. Specifically, we show that ridge estimators trained on weighted features along the same path are asymptotically equivalent when evaluated against test vectors of bounded norms. These paths can be interpreted as matching the effective degrees of freedom of ridge estimators fitted with weighted features. For the special case of subsampling without replacement, our results apply to independently sampled random features and kernel features and confirm recent conjectures (Conjectures 7 and 8) of the authors on the existence of such paths in Patil et al. We…
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
TopicsNeural Networks and Applications
