Hypergraph Echo State Network (2310.10177v1)
Abstract: A hypergraph as a generalization of graphs records higher-order interactions among nodes, yields a more flexible network model, and allows non-linear features for a group of nodes. In this article, we propose a hypergraph echo state network (HypergraphESN) as a generalization of graph echo state network (GraphESN) designed for efficient processing of hypergraph-structured data, derive convergence conditions for the algorithm, and discuss its versatility in comparison to GraphESN. The numerical experiments on the binary classification tasks demonstrate that HypergraphESN exhibits comparable or superior accuracy performance to GraphESN for hypergraph-structured data, and accuracy increases if more higher-order interactions in a network are identified.
- Gallicchio, c. (2023). Euler State Networks: Non-dissipative Reservoir Computing. arXiv preprint arXiv: 2203.09382.
- Higham D. J. & Henry-Louis d. K. (2021). Epidemics on hypergraphs: spectral thresholds for extinction. Processings of the Royal Society A, 477. http://doi.org/10.1098/rspa.2021.0232
- Jaeger, H. (2001). The “echo state” approach to analysing and training recurrent neural networks-with an erratum note. Bonn, Germany: German National Research Center for Information Technology GMD Technical Report, 148. https://api.semanticscholar.org/CorpusID:15467150
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.