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-...
Uložené v:
| Vydané v: | arXiv.org |
|---|---|
| Hlavní autori: | , , |
| Médium: | Paper |
| Jazyk: | English |
| Vydavateľské údaje: |
Ithaca
Cornell University Library, arXiv.org
23.08.2022
|
| Predmet: | |
| ISSN: | 2331-8422 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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-layer ReLU networks with respect to various loss functions. After a brief discussion of other parameters, we focus on analyzing the influence of the dimension \(d\) of the training data on the computational complexity. We provide running time lower bounds in terms of W[1]-hardness for parameter \(d\) and prove that known brute-force strategies are essentially optimal (assuming the Exponential Time Hypothesis). In comparison with previous work, our results hold for a broad(er) range of loss functions, including \(\ell^p\)-loss for all \(p\in[0,\infty]\). In particular, we extend a known polynomial-time algorithm for constant \(d\) and convex loss functions to a more general class of loss functions, matching our running time lower bounds also in these cases. |
|---|---|
| Bibliografia: | SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| ISSN: | 2331-8422 |
| DOI: | 10.48550/arxiv.2105.08675 |