Facets of neural network complexity

DOI10.14279/DEPOSITONCE-15271MaRDI QIDQ6631274zbMATH OpenFDO

Authors Christoph Hertrich

Publication date 1 November 2024

Full work available at URL https://doi.org/10.14279/DEPOSITONCE-15271

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Complexity of training ReLU neural network
• ReLU neural networks of polynomial size for exact maximum flow computation
• Towards Lower Bounds on the Depth of ReLU Neural Networks
• The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality

Cited in

(6)

• The Computational Complexity of ReLU Network Training Parameterized by Data Dimensionality
• On Transversality of Bent Hyperplane Arrangements and the Topological Expressiveness of ReLU Neural Networks
• Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
• Expressive power of ReLU and step networks under floating-point operations
• Neural networks with linear threshold activations: structure and algorithms
• Mathematical neuron-neural-networks dynamics modeling and brain complexity of multicriteria fractal-based ensemble predictive algorithmic systems

This page was built for publication: Facets of neural network complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631274)