Lower and upper bounds for numbers of linear regions of graph convolutional networks
From MaRDI portal
(Redirected from Publication:6535213)
Recommendations
Cites work
- An introduction to hyperplane arrangements
- An optimal lower bound on the number of variables for graph identification
- Analytic combinatorics
- Approximation and estimation bounds for artificial neural networks
- Deep learning
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
- Error bounds for approximations with deep ReLU networks
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- PEBBLE GAMES AND LINEAR EQUATIONS
- Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks
- Random Graph Isomorphism
Cited in
(3)
This page was built for publication: Lower and upper bounds for numbers of linear regions of graph convolutional networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535213)