pith. sign in

arxiv: 2306.17301 · v3 · pith:R62ZAFG4new · submitted 2023-06-29 · 💻 cs.LG · cs.NA· math.NA· stat.ML

Why Shallow Networks Struggle to Approximate and Learn High Frequencies

classification 💻 cs.LG cs.NAmath.NAstat.ML
keywords computationalnumericalanalysiscostfrequencieshighlearningprecision
0
0 comments X
read the original abstract

In this work, we present a comprehensive study combining mathematical and computational analysis to explain why a two-layer neural network struggles to handle high frequencies in both approximation and learning, especially when machine precision, numerical noise, and computational cost are significant factors in practice. Specifically, we investigate the following fundamental computational issues: (1) the minimal numerical error achievable under finite precision, (2) the computational cost required to attain a given accuracy, and (3) the stability of the method with respect to perturbations. The core of our analysis lies in the conditioning of the representation and its learning dynamics. Explicit answers to these questions are provided, along with supporting numerical evidence.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Second-Order Path Kernel Interpolation Formulas in Machine Learning

    cs.LG 2026-06 unverdicted novelty 6.0

    Derives second-order path-kernel interpolation formulas for gradient descent, SGD, and momentum training, adding curvature terms and a concentration estimate around the expected prediction.