paper-with-me

홈 › Papers

Quantitative Gaussian-Process limits of Tensor Programs

2026-07-07 · Andrea Agazzi, Eloy Mosig García, Dario Trevisan arxiv

We study the infinite-width Gaussian-process limit of random neural networks through the lens of tensor programs, and we provide a quantitative convergence theory in Wasserstein distance. Our main result gives explicit finite-width error bounds, of order inverse square-root of the widths between finite-network executions and their Gaussian-process limits. The framework is architecture-agnostic and covers feed-forward models together with weight-sharing schemes relevant for recurrent and transformer-type architectures.

📄 PDF Abstract BibTeX arXiv:2607.06290

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Tensor Programs IVb: Adaptive Optimization in the Infinite-Width Limit

2023-08-03 · Greg Yang, Etai Littwin

Going beyond stochastic gradient descent (SGD), what new phenomena emerge in wide neural networks trained by adaptive optimizers like Adam? Here we show: The same dichotomy between feature learning and kernel behaviors (…

Tensor Programs I: Wide Feedforward or Recurrent Neural Networks of Any Architecture are Gaussian Processes

2019-10-28 · Greg Yang

Wide neural networks with random weights and biases are Gaussian processes, as originally observed by Neal (1995) and more recently by Lee et al. (2018) and Matthews et al. (2018) for deep fully-connected networks, as we…

Gaussian Processes

Learning to Optimize Tensor Programs

2018-05-21 · NeurIPS 2018 12 · Tianqi Chen, Lianmin Zheng, Eddie Yan, Ziheng Jiang 외

We introduce a learning-based framework to optimize tensor programs for deep learning workloads. Efficient implementations of tensor operators, such as matrix multiplication and high dimensional convolution, are key enab…

CPUDeep LearningGPU

Feature Learning in Infinite-Width Neural Networks

2020-11-30 · Greg Yang, Edward J. Hu

As its width tends to infinity, a deep neural network's behavior under gradient descent can become simplified and predictable (e.g. given by the Neural Tangent Kernel (NTK)), if it is parametrized appropriately (e.g. the…

Few-Shot LearningTransfer Learning

Stochastic uncertainty analysis of gravity gradient tensor components and their combinations

2022-05-18 · Pejman Shamsipour, Amin Aghaee, Tedd Kourkounakis, Shawn Hood

Full tensor gravity (FTG) devices provide up to five independent components of the gravity gradient tensor. However, we do not yet have a quantitative understanding of which tensor components or combinations of component…