Gaussian random field approximation via Stein's method with applications to wide random neural networks

IF 2.6 2区 数学 Q1 MATHEMATICS, APPLIED
Krishnakumar Balasubramanian , Larry Goldstein , Nathan Ross , Adil Salim
{"title":"Gaussian random field approximation via Stein's method with applications to wide random neural networks","authors":"Krishnakumar Balasubramanian ,&nbsp;Larry Goldstein ,&nbsp;Nathan Ross ,&nbsp;Adil Salim","doi":"10.1016/j.acha.2024.101668","DOIUrl":null,"url":null,"abstract":"<div><p>We derive upper bounds on the Wasserstein distance (<span><math><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>), with respect to sup-norm, between any continuous <span><math><msup><mrow><mi>R</mi></mrow><mrow><mi>d</mi></mrow></msup></math></span> valued random field indexed by the <em>n</em>-sphere and the Gaussian, based on Stein's method. We develop a novel Gaussian smoothing technique that allows us to transfer a bound in a smoother metric to the <span><math><msub><mrow><mi>W</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> distance. The smoothing is based on covariance functions constructed using powers of Laplacian operators, designed so that the associated Gaussian process has a tractable Cameron-Martin or Reproducing Kernel Hilbert Space. This feature enables us to move beyond one dimensional interval-based index sets that were previously considered in the literature. Specializing our general result, we obtain the first bounds on the Gaussian random field approximation of wide random neural networks of any depth and Lipschitz activation functions at the random field level. Our bounds are explicitly expressed in terms of the widths of the network and moments of the random weights. We also obtain tighter bounds when the activation function has three bounded derivatives.</p></div>","PeriodicalId":55504,"journal":{"name":"Applied and Computational Harmonic Analysis","volume":"72 ","pages":"Article 101668"},"PeriodicalIF":2.6000,"publicationDate":"2024-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied and Computational Harmonic Analysis","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1063520324000459","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We derive upper bounds on the Wasserstein distance (W1), with respect to sup-norm, between any continuous Rd valued random field indexed by the n-sphere and the Gaussian, based on Stein's method. We develop a novel Gaussian smoothing technique that allows us to transfer a bound in a smoother metric to the W1 distance. The smoothing is based on covariance functions constructed using powers of Laplacian operators, designed so that the associated Gaussian process has a tractable Cameron-Martin or Reproducing Kernel Hilbert Space. This feature enables us to move beyond one dimensional interval-based index sets that were previously considered in the literature. Specializing our general result, we obtain the first bounds on the Gaussian random field approximation of wide random neural networks of any depth and Lipschitz activation functions at the random field level. Our bounds are explicitly expressed in terms of the widths of the network and moments of the random weights. We also obtain tighter bounds when the activation function has three bounded derivatives.

通过斯坦因方法进行高斯随机场逼近并应用于宽随机神经网络
我们基于斯坦因方法,推导出以 n 球为索引的任何连续 Rd 值随机场与高斯之间的瓦瑟斯坦距离(W1)的上界。我们开发了一种新颖的高斯平滑技术,可以将平滑度量中的约束转移到 W1 距离上。这种平滑技术基于使用拉普拉斯算子幂构造的协方差函数,其设计使相关的高斯过程具有可处理的卡梅隆-马丁或再现核希尔伯特空间。这一特点使我们超越了以往文献中考虑的基于一维区间的索引集。根据我们的一般结果,我们首次获得了在随机场水平上对任意深度和 Lipschitz 激活函数的宽随机神经网络的高斯随机场近似的约束。我们的边界用网络宽度和随机权重矩明确表示。当激活函数有三个有界导数时,我们还得到了更严格的约束。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied and Computational Harmonic Analysis
Applied and Computational Harmonic Analysis 物理-物理:数学物理
CiteScore
5.40
自引率
4.00%
发文量
67
审稿时长
22.9 weeks
期刊介绍: Applied and Computational Harmonic Analysis (ACHA) is an interdisciplinary journal that publishes high-quality papers in all areas of mathematical sciences related to the applied and computational aspects of harmonic analysis, with special emphasis on innovative theoretical development, methods, and algorithms, for information processing, manipulation, understanding, and so forth. The objectives of the journal are to chronicle the important publications in the rapidly growing field of data representation and analysis, to stimulate research in relevant interdisciplinary areas, and to provide a common link among mathematical, physical, and life scientists, as well as engineers.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信