From “Dynamics on Graphs” to “Dynamics of Graphs”: An Adaptive Echo-State Network Solution (Student Abstract)

Authors

  • Lei Zhang Virginia Tech
  • Zhiqian Chen Mississippi State University
  • Chang-Tien Lu Virginia Tech
  • Liang Zhao Emory University

DOI:

https://doi.org/10.1609/aaai.v36i11.21692

Keywords:

Graph, Echo State, Reservoir Computing

Abstract

Many real-world networks evolve over time, which results in dynamic graphs such as human mobility networks and brain networks. Usually, the “dynamics on graphs” (e.g., node attribute values evolving) are observable, and may be related to and indicative of the underlying “dynamics of graphs” (e.g., evolving of the graph topology). Traditional RNN-based methods are not adaptive or scalable for learn- ing the unknown mappings between two types of dynamic graph data. This study presents a AD-ESN, and adaptive echo state network that can automatically learn the best neural net- work architecture for certain data while keeping the efficiency advantage of echo state networks. We show that AD-ESN can successfully discover the underlying pre-defined map- ping function and unknown nonlinear map-ping between time series and graphs.

Downloads

Published

2022-06-28

How to Cite

Zhang, L., Chen, Z., Lu, C.-T., & Zhao, L. (2022). From “Dynamics on Graphs” to “Dynamics of Graphs”: An Adaptive Echo-State Network Solution (Student Abstract). Proceedings of the AAAI Conference on Artificial Intelligence, 36(11), 13111-13112. https://doi.org/10.1609/aaai.v36i11.21692