Learning Steady-States of Iterative Algorithms over Graphs

This paper proposesembeddingrepresentation for iterativealgorithm sovergraphs, and a design method which alternates between updating the embeddings and projecting them onto the steady-state constraints, and demonstrates the effectiveness of the framework.