An Algorithmic Approach to Establish a Lower Bound for the Size of Semiring Neural Networks.
Martin BöhmThomas SchmidPublished in: ESANN (2021)
Keyphrases
- lower bound
- neural network
- upper bound
- branch and bound algorithm
- running times
- pattern recognition
- branch and bound
- max sat
- optimal solution
- lower and upper bounds
- neural nets
- back propagation
- artificial neural networks
- worst case
- multi layer
- computational complexity
- data structure
- constant factor
- memory requirements
- relational algebra
- sufficiently accurate