mlsanityData to 7 Oct 2026

A Generalized Weighted Optimization Method for Computational Learning and Inversion

arXiv 2201.09223 ↗First posted 23 Jan 2022cs.LG cs.NA math.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

The generalization capacity of various machine learning models exhibits different phenomena in the under- and over-parameterized regimes. In this paper, we focus on regression models such as feature regression and kernel regression and analyze a generalized weighted least-squares optimization method for computational learning and inversion with noisy data. The highlight of the proposed framework is that we allow weighting in both the parameter space and the data space. The weighting scheme encodes both a priori knowledge on the object to be learned and a strategy to weight the contribution of different data points in the loss function. Here, we characterize the impact of the weighting scheme on the generalization error of the learning method, where we derive explicit generalization errors for the random Fourier feature model in both the under- and over-parameterized regimes. For more general feature maps, error bounds are provided based on the singular values of the feature matrix. We demonstrate that appropriate weighting from prior knowledge can improve the generalization capability of the learned model.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 29 of its 44 references that are in the map. First posted on arXiv 23 Jan 2022.

Builds on

29 of 44 references.

References · 29

  1. 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,806
  2. 2019Benign Overfitting in Linear Regressioncited by 544
  3. 2019High Frequency Component Helps Explain the Generalization of Convolutional Neural Networkscited by 310
  4. 2018What is the Effect of Importance Weighting in Deep Learning?cited by 250
  5. 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 211
  6. 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
  7. 2019Two models of double descent for weak featurescited by 194
  8. 2019On the Inductive Bias of Neural Tangent Kernelscited by 177
  9. 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networkscited by 166
  10. 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
  11. 2019The Convergence Rate of Neural Networks for Learned Functions of Different Frequenciescited by 134
  12. 2013Stochastic Gradient Descent, Weighted Sampling, and the Randomized Kaczmarz algorithmcited by 132
17 more
  1. 2020Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyondcited by 107
  2. 2020On the Similarity between the Laplace and Neural Tangent Kernelscited by 76
  3. 2020Deep Neural Tangent Kernel and Laplace Kernel Have the Same RKHScited by 74
  4. 2020A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descentcited by 69
  5. 2019A Fine-Grained Spectral Perspective on Neural Networkscited by 68
  6. 2020Triple descent and the two kinds of overfitting: Where & why do they appear?cited by 64
  7. 2018Kernel Flows: from learning kernels from data into the abysscited by 49
  8. 2020Kernel regression in high dimensions: Refined analysis beyond double descentcited by 39
  9. 2015Optimal Rates for Random Fourier Featurescited by 38
  10. 2018Semi-supervised Deep Kernel Learning: Regression with Unlabeled Data by Minimizing Predictive Variancecited by 33
  11. 2021Towards an Understanding of Benign Overfitting in Neural Networkscited by 29
  12. 2018On the Spectrum of Random Features Maps of High Dimensional Datacited by 27
  13. 2018Semi-Supervised Learning via Compact Latent Space Clusteringcited by 15
  14. 2019On Sampling Random Features From Empirical Leverage Scores: Implementation and Theoretical Guaranteescited by 5
  15. 2019The quadratic Wasserstein metric for inverse data matchingcited by 5
  16. 2020Sparse Recovery With Non-Linear Fourier Featurescited by 3
  17. 2020Overparameterization and generalization error: weighted trigonometric interpolationcited by 1

Built on by

Not cited yet.