[2007.13664] Universality of Gradient Descent Neural Network Training
Skip to main content
Search arXiv
Press Enter to search · Advanced search
-->
Computer Science > Machine Learning
arXiv:2007.13664 (cs)
[Submitted on 27 Jul 2020]
Title:Universality of Gradient Descent Neural Network Training
Authors:G. Welper<br>View a PDF of the paper titled Universality of Gradient Descent Neural Network Training, by G. Welper
View PDF<br>HTML (experimental)
Abstract:It has been observed that design choices of neural networks are often crucial for their successful optimization. In this article, we therefore discuss the question if it is always possible to redesign a neural network so that it trains well with gradient descent. This yields the following universality result: If, for a given network, there is any algorithm that can find good network weights for a classification task, then there exists an extension of this network that reproduces these weights and the corresponding forward output by mere gradient descent training. The construction is not intended for practical computations, but it provides some orientation on the possibilities of meta-learning and related approaches.
Subjects:
Machine Learning (cs.LG); Machine Learning (stat.ML)
MSC classes:<br>68T07, 68Q04, 90C26
Cite as:<br>arXiv:2007.13664 [cs.LG]
(or<br>arXiv:2007.13664v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2007.13664
Focus to learn more
arXiv-issued DOI via DataCite
Submission history<br>From: Gerrit Welper [view email]<br>[v1]<br>Mon, 27 Jul 2020 16:17:19 UTC (31 KB)
Full-text links:<br>Access Paper:
View a PDF of the paper titled Universality of Gradient Descent Neural Network Training, by G. Welper<br>View PDF<br>HTML (experimental)<br>TeX Source
view license
Current browse context:
cs.LG
next >
new<br>recent<br>| 2020-07
Change to browse by:
cs<br>stat<br>stat.ML
References & Citations
NASA ADS<br>Google Scholar
Semantic Scholar
DBLP - CS Bibliography
listing | bibtex
export BibTeX citation<br>Loading...
BibTeX formatted citation
×
loading...
Data provided by:
Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
IArxiv recommender toggle
IArxiv Recommender<br>(What is IArxiv?)
Author
Venue
Institution
Topic
About arXivLabs
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? |<br>Disable MathJax (What is MathJax?)
Major funding support from