Lower and upper bounds for numbers of linear regions of graph convolutional networks
From MaRDI portal
Publication:6535213
DOI10.1016/j.neunet.2023.09.025MaRDI QIDQ6535213
Could not fetch data.
Publication date: 23 November 2023
Published in: Neural Networks (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal lower bound on the number of variables for graph identification
- Approximation and estimation bounds for artificial neural networks
- Error bounds for approximations with deep ReLU networks
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- PEBBLE GAMES AND LINEAR EQUATIONS
- Random Graph Isomorphism
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Permitted and Forbidden Sets in Symmetric Threshold-Linear Networks
- Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Related Items (1)
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)