%0 Generic %1 venkatakrishnan2018graph2seq %A Venkatakrishnan, Shaileshh Bojja %A Alizadeh, Mohammad %A Viswanath, Pramod %D 2018 %K graph %T Graph2Seq: Scalable Learning Dynamics for Graphs %U http://arxiv.org/abs/1802.04948 %X Neural networks have been shown to be an effective tool for learning algorithms over graph-structured data. However, graph representation techniques--that convert graphs to real-valued vectors for use with neural networks--are still in their infancy. Recent works have proposed several approaches (e.g., graph convolutional networks), but these methods have difficulty scaling and generalizing to graphs with different sizes and shapes. We present Graph2Seq, a new technique that represents graphs as an infinite time-series. By not limiting the representation to a fixed dimension, Graph2Seq scales naturally to graphs of arbitrary sizes and shapes. Graph2Seq is also reversible, allowing full recovery of the graph structure from the sequence. By analyzing a formal computational model for graph representation, we show that an unbounded sequence is necessary for scalability. Our experimental results with Graph2Seq show strong generalization and new state-of-the-art performance on a variety of graph combinatorial optimization problems.

@misc{venkatakrishnan2018graph2seq, abstract = {Neural networks have been shown to be an effective tool for learning algorithms over graph-structured data. However, graph representation techniques--that convert graphs to real-valued vectors for use with neural networks--are still in their infancy. Recent works have proposed several approaches (e.g., graph convolutional networks), but these methods have difficulty scaling and generalizing to graphs with different sizes and shapes. We present Graph2Seq, a new technique that represents graphs as an infinite time-series. By not limiting the representation to a fixed dimension, Graph2Seq scales naturally to graphs of arbitrary sizes and shapes. Graph2Seq is also reversible, allowing full recovery of the graph structure from the sequence. By analyzing a formal computational model for graph representation, we show that an unbounded sequence is necessary for scalability. Our experimental results with Graph2Seq show strong generalization and new state-of-the-art performance on a variety of graph combinatorial optimization problems.}, added-at = {2018-02-15T09:08:47.000+0100}, author = {Venkatakrishnan, Shaileshh Bojja and Alizadeh, Mohammad and Viswanath, Pramod}, biburl = {https://www.bibsonomy.org/bibtex/2a7926bffc23b831994739f7196529f1a/jk_itwm}, description = {Graph2Seq: Scalable Learning Dynamics for Graphs}, interhash = {784b6591f0325f1f1baa86d41f93f907}, intrahash = {a7926bffc23b831994739f7196529f1a}, keywords = {graph}, note = {cite arxiv:1802.04948}, timestamp = {2018-02-15T09:08:47.000+0100}, title = {Graph2Seq: Scalable Learning Dynamics for Graphs}, url = {http://arxiv.org/abs/1802.04948}, year = 2018 }