Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2306.16932

Help | Advanced Search

Mathematics > Probability

arXiv:2306.16932 (math)
[Submitted on 29 Jun 2023 (v1) , last revised 5 Jul 2023 (this version, v2)]

Title: A Quantitative Functional Central Limit Theorem for Shallow Neural Networks

Title: 浅层神经网络的定量功能中心极限定理

Authors:Valentina Cammarota, Domenico Marinucci, Michele Salvi, Stefano Vigogna
Abstract: We prove a Quantitative Functional Central Limit Theorem for one-hidden-layer neural networks with generic activation function. The rates of convergence that we establish depend heavily on the smoothness of the activation function, and they range from logarithmic in non-differentiable cases such as the Relu to $\sqrt{n}$ for very regular activations. Our main tools are functional versions of the Stein-Malliavin approach; in particular, we exploit heavily a quantitative functional central limit theorem which has been recently established by Bourguin and Campese (2020).
Abstract: 我们证明了一个关于具有通用激活函数的一层隐藏层神经网络的定量功能中心极限定理。 我们建立的收敛速率在很大程度上依赖于激活函数的平滑性,它们从非可微情况(如Relu)中的对数速率到非常规则的激活函数的$\sqrt{n}$不等。 我们的主要工具是Stein-Malliavin方法的功能版本;特别是,我们大量利用了Bourguin和Campese(2020)最近建立的一个定量功能中心极限定理。
Subjects: Probability (math.PR) ; Machine Learning (stat.ML)
MSC classes: 60F17, 68T07, 60G60
Cite as: arXiv:2306.16932 [math.PR]
  (or arXiv:2306.16932v2 [math.PR] for this version)
  https://doi.org/10.48550/arXiv.2306.16932
arXiv-issued DOI via DataCite

Submission history

From: Stefano Vigogna [view email]
[v1] Thu, 29 Jun 2023 13:31:22 UTC (18 KB)
[v2] Wed, 5 Jul 2023 14:33:32 UTC (19 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.PR
< prev   |   next >
new | recent | 2023-06
Change to browse by:
math
stat
stat.ML

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号