How Does Preconditioning Guide Feature Learning in Deep Neural Networks?
Not on the map. Why?
Abstract (arXiv)
Preconditioning is widely used in machine learning to accelerate convergence on the empirical risk, yet its role on the expected risk remains underexplored. In this work, we investigate how preconditioning affects feature learning and generalization performance. We first show that the input information available to the model is conveyed solely through the Gram matrix defined by the preconditioner's metric, thereby inducing a controllable spectral bias on feature learning. Concretely, instantiating the preconditioner as the p-th power of the input covariance matrix, we prove that, for a single ReLU neuron, increasing p monotonically shifts the learned feature's sensitivity toward higher-variance eigenspaces, even though all choices of p attain the same limiting population loss. We then empirically investigate how this spectral bias interacts with task-relevant features in three settings: robustness to noise, out-of-distribution generalization, and forward knowledge transfer. Our experiments show that learned representations favor the spectral components emphasized by preconditioning, and that generalization improves when this bias aligns with task-relevant features.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 32 references that are in the map. First posted on arXiv 30 Sep 2025.
Builds on
25 of 32 references.
References · 25
- 2019Invariant Risk Minimizationcited by 1,854
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2014How transferable are features in deep neural networks?cited by 1,225
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 289
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 265
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 250
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 202
13 more
- 2021Whitening Sentence Representations for Better Semantics and Faster Retrievalcited by 202
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 183
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2020When Does Preconditioning Help or Hurt Generalization?cited by 31
- 2025Optimizers Qualitatively Alter Solutions And We Should Leverage Thiscited by 17
- 2020Whitening and second order optimization both make information in the dataset unusable during training, and can reduce or prevent generalizationcited by 15
- 2023On the Parameterization of Second-Order Optimization Effective Towards the Infinite Widthcited by 15
- 2023Sample-Efficient Linear Representation Learning from Non-IID Non-Isotropic Datacited by 13
- 2022An initial alignment between neural network and target is needed for gradient descent to learncited by 12
- 2025On The Concurrence of Layer-wise Preconditioning Methods and Provable Feature Learningcited by 12
- 2025Optimal Algorithms in Linear Regression under Covariate Shift: On the Importance of Preconditioncited by 5
- 2024Zipfian Whiteningcited by 3
- 2025SASSHA: Sharpness-aware Adaptive Second-order Optimization with Stable Hessian Approximationcited by 3
Built on by
Not cited yet.