Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2204.01368
Cited By
Training Fully Connected Neural Networks is
∃
R
\exists\mathbb{R}
∃
R
-Complete
4 April 2022
Daniel Bertschinger
Christoph Hertrich
Paul Jungeblut
Tillmann Miltzow
Simon Weber
OffRL
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete"
2 / 2 papers shown
Title
When Deep Learning Meets Polyhedral Theory: A Survey
Joey Huchette
Gonzalo Muñoz
Thiago Serra
Calvin Tsay
AI4CE
84
32
0
29 Apr 2023
Benefits of depth in neural networks
Matus Telgarsky
121
600
0
14 Feb 2016
1