Fetching the paper…
Reading the bibliography…
Deep learning has received much attention lately due to the impressive empirical performance achieved by training algorithms.
Graph minors II: Algorithmic aspects of tree-width
Neil Robertson and Paul D. Seymour · 1986
Earlier work this paper cites.
Neural network training via linear programming
Kristin P Bennett and Olvi L Mangasarian · 1990
Earlier work this paper cites.
On embedding graphs in trees
Dan Bienstock · 1990
Earlier work this paper cites.
Robust linear programming discrimination of two linearly inseparable sets
Kristin P Bennett and Olvi L Mangasarian · 1992
Earlier work this paper cites.
Training a 3-node neural network is np-complete
Avrim L. Blum and Ronald L. Rivest · 1992
Earlier work this paper cites.
A polynomial time algorithm for generating neural networks for pattern classification: Its stability properties and some test results
Somnath Mukhopadhyay, Asim Roy, Lark Sang Kim, and Sandeep Govil · 1993
Earlier work this paper cites.
A polynomial time algorithm for the construction and training of a class of multilayer perceptrons
Asim Roy, Lark Sang Kim, and Somnath Mukhopadhyay · 1993
Earlier work this paper cites.
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Gruia Calinescu, Cristina G Fernandes, and Bruce Reed · 1998
Earlier work this paper cites.
On digraph coloring problems and treewidth duality
Albert Atserias · 2008
Earlier work this paper cites.
Lectures on stochastic programming: modeling and theory
Alexander Shapiro, Darinka Dentcheva, and Andrzej Ruszczyński · 2009
Earlier work this paper cites.
Matthieu Courbariaux, Itay Hubara, Daniel Soudry, Ran El-Yaniv, and Yoshua Bengio · 2016
Earlier work this paper cites.
Deep learning
Ian Goodfellow, Yoshua Bengio, and Aaron Courville · 2016
Earlier work this paper cites.
l1-regularized neural networks are improperly learnable in polynomial time
Yuchen Zhang, Jason D Lee, and Michael I Jordan · 2016
Cited alongside, same era.
A Graduate Course on Stochastic Programming
Shabbir Ahmed · 2017
Cited alongside, same era.
Input convex neural networks
Brandon Amos, Lei Xu, and J Zico Kolter · 2017
Cited alongside, same era.
Maximum resilience of artificial neural networks
Chih-Hong Cheng, Georg Nührenberg, and Harald Ruess · 2017
Cited alongside, same era.
Optimization methods for supervised machine learning: From linear models to deep learning
Frank E Curtis and Katya Scheinberg · 2017
Cited alongside, same era.
Reliably learning the relu in polynomial time
Surbhi Goel, Varun Kanade, Adam Klivans, and Justin Thaler · 2017
Cited alongside, same era.
Optimization methods for large-scale machine learning
Léon Bottou, Frank E Curtis, and Jorge Nocedal · 2018
Closest in time.
Deep neural networks and mixed integer linear optimization
Matteo Fischetti and Jason Jo · 2018
Closest in time.
Regularisation of neural networks by enforcing lipschitz continuity
Henry Gouk, Eibe Frank, Bernhard Pfahringer, and Michael Cree · 2018
Closest in time.
The treewidth of line graphs
Daniel J Harvey and David R Wood · 2018
Closest in time.
Combinatorial attacks on binarized neural networks
Elias B Khalil, Amrita Gupta, and Bistra Dilkina · 2018
Closest in time.
A surprising linear relationship predicts test performance in deep networks
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Thiago Serra, Christian Tjandraatmadja, and Srikumar Ramalingam · 2017
Cited alongside, same era.
Strong convex relaxations and mixed-integer programming formulations for trained neural networks
Ross Anderson, Joey Huchette, Christian Tjandraatmadja, and Juan Pablo Vielma · 2018
Cited alongside, same era.
Understanding deep neural networks with rectified linear units
Raman Arora, Amitabh Basu, Poorya Mianjy, and Anribit Mukherjee · 2018
Cited alongside, same era.
Deep frank-wolfe for neural network optimization
Leonard Berrada, Andrew Zisserman, and M Pawan Kumar · 2018
Cited alongside, same era.
Lp formulations for polynomial optimization problems
Daniel Bienstock and Gonzalo Muñoz · 2018
Cited alongside, same era.
Complexity of training relu neural network
Digvijay Boob, Santanu S Dey, and Guanghui Lan · 2018
Cited alongside, same era.
Qianli Liao, Brando Miranda, Andrzej Banburski, Jack Hidary, and Tomaso Poggio · 2018
Closest in time.
The computational complexity of training relu (s)
Pasin Manurangsi and Daniel Reichman · 2018
Closest in time.
Optimization algorithms for data analysis
Stephen J Wright · 2018
Closest in time.
Deep neural network training with frank-wolfe
Sebastian Pokutta, Christoph Spiegel, and Max Zimmer · 2020
Closest in time.
Efficient projection-free online methods with stochastic recursive gradient
Jiahao Xie, Zebang Shen, Chao Zhang, Boyu Wang, and Hui Qian · 2020
Closest in time.
Training of relu activated multilayerd neural networks with mixed integer linear programs
Steffen Goebbels · 2021
Closest in time.