The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality

Understanding the computational complexity of training simple neural networks with rectified linear units (ReLUs) has recently been a subject of intensive research. Closing gaps and complementing results from the literature, we present several results on the parameterized complexity of training two-...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Froese, Vincent, Hertrich, Christoph, Niedermeier, Rolf
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 23.08.2022
Predmet:	Algorithms Complexity Lower bounds Neural networks Parameterization Parameters Polynomials Training
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!