[37] Xavier Glorot, Antoine Bordes, and Yoshua Bengio. Deep Sparse Rectifier Neural Networks. In Geoffrey Gordon, David Dunson, and Miroslav Dudík, editors, Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics (AISTATS 2011), volume 15 of Proceedings of Machine Learning Research, pages 315–323, 2011.
[38] Surbhi Goel, Varun Kanade, Adam R. Klivans, and Justin Thaler. Reliably Learning the ReLU in Polynomial Time. In Satyen Kale and Ohad Shamir, editors, Proceedings of the 2017 Conference on Learning Theory (COLT 2017), volume 65 of Proceedings of Machine Learning Research, pages 1004–1042, 2017.
[39] Surbhi Goel and Adam R. Klivans. Learning Neural Networks with Two Nonlinear Layers in Polynomial Time. In Alina Beygelzimer and Daniel Hsu, editors, Proceedings of the Thirty-Second Conference on Learning Theory (COLT 2019), volume 99 of Proceedings of Machine Learning Research, pages 1470–1499, 2019.
[40] Surbhi Goel, Adam R. Klivans, Pasin Manurangsi, and Daniel Reichman. Tight Hardness Results for Training Depth-2 ReLU Networks. In James R. Lee, editor, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), volume 185 of Leibniz International Proceedings in Informatics (LIPics), pages 22:1–22:14, 2021. doi:10.4230/LIPics.ITCS.2021.22.
[41] Surbhi Goel, Adam R. Klivans, and Raghu Meka. Learning One Convolutional Layer with Overlapping Patches. In Jennifer Dy and Andreas Krause, editors, Proceedings of the 35th International Conference on Machine Learning (ICML 2018), volume 80 of Proceedings of Machine Learning Research, pages 1783-1791, 2018.
[42] Ian Goodfellow, Yoshua Bengio, and Aaron Courville. Deep Learning. MIT Press, 2016. http://www.deeplearningbook.org.
[43] Henry Gouk, Eibe Frank, Bernhard Pfahringer, and Michael J. Cree. Regularisation of neural networks by enforcing Lipschitz continuity. Machine Learning, 110(2):393-416, 2021. doi: 10.1007/s10994-020-05929-w.
[44] Christian Haase, Christoph Hertrich, and Georg Loho. Lower Bounds on the Depth of Integral ReLU Neural Networks via Lattice Polytopes. In The Eleventh International Conference on Learning Representations (ICLR 2023), 2023. URL: https://openreview.net/forum?id=2mvAL0AWaxY.
[45] Boris Hanin. Universal Function Approximation by Deep Neural Nets with Bounded Width and ReLU Activations. Mathematics, 7(10):992:1-9, 2019. doi:10.3390/math7100992.
[46] Boris Hanin and David Rolnick. Complexity of Linear Regions in Deep Networks. In Kamalika Chaudhuri and Ruslan Salakhutdinov, editors, Proceedings of the 36th International Conference on Machine Learning (ICML 2019), volume 97 of Proceedings of Machine Learning Research, pages 2596-260, 2019.
[47] Boris Hanin and Mark Sellke. Approximating Continuous Functions by ReLU Nets of Minimal Width. arXiv preprint, 2018. arXiv:1710.11278.
[48] Simon B. Hengeveld and Tillmann Miltzow. A Practical Algorithm with Performance Guarantees for the Art Gallery Problem. In Kevin Buchin and Éric Colin de Verdière, editors, 37th International Symposium on Computational Geometry (SoCG 2021), volume 189 of Leibniz International Proceedings in Informatics (LIPics), pages 44:1-44:16, 2021. doi:10.4230/LIPics.SoCG.2021.44.
[49] Christoph Hertrich, Amitabh Basu, Marco Di Summa, and Martin Skutella. Towards Lower Bounds on the Depth of ReLU Neural Networks. In Marc A. Ranzato, Alina Beygelzimer, Yann Dauphin, Percy Liang, and Jennifer W. Vaughan, editors, Advances in Neural Information Processing Systems (NeurIPS 2021), volume 34, 2021.
[50] Christoph Hertrich and Leon Sering. ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation. In The 24th Conference on Integer Programming and Combinatorial Optimization (IPCO 2023), 2023.
[51] Christoph Hertrich and Martin Skutella. Provably good solutions to the knapsack problem via neural networks of bounded size. INFORMS Journal on Computing, 35(5):1079-1097, 2023. doi:10.1287/ijoc.2021.0225.
[52] Kurt Hornik. Approximation Capabilities of Multilayer Feedforward Networks. Neural Networks, 4(2):251-257, 1991. doi:10.1016/0893-6080(91)90009-T.