Timezone: »
Formation mechanisms are fundamental to the study of complex networks, but learning them from observations is challenging. In real-world domains, one often has access only to the final constructed graph, instead of the full construction process, and observed graphs exhibit complex structural properties. In this work, we propose GraphOpt, an end-to-end framework that jointly learns an implicit model of graph structure formation and discovers an underlying optimization mechanism in the form of a latent objective function. The learned objective can serve as an explanation for the observed graph properties, thereby lending itself to transfer across different graphs within a domain. GraphOpt poses link formation in graphs as a sequential decision-making process and solves it using maximum entropy inverse reinforcement learning algorithm. Further, it employs a novel continuous latent action space that aids scalability. Empirically, we demonstrate that GraphOpt discovers a latent objective transferable across graphs with different characteristics. GraphOpt also learns a robust stochastic policy that achieves competitive link prediction performance without being explicitly trained on this task and further enables construction of graphs with properties similar to those of the observed graph.
Author Information
Rakshit Trivedi (Georgia Institute of Technology)
Jiachen Yang (Georgia Institute of Technology)
Hongyuan Zha (Georgia Institute of Technology)
More from the Same Authors
-
2021 Poster: Learning Stochastic Behaviour from Aggregate Data »
Shaojun Ma · Shu Liu · Hongyuan Zha · Haomin Zhou -
2021 Spotlight: Learning Stochastic Behaviour from Aggregate Data »
Shaojun Ma · Shu Liu · Hongyuan Zha · Haomin Zhou -
2020 Poster: Transformer Hawkes Process »
Simiao Zuo · Haoming Jiang · Zichong Li · Tuo Zhao · Hongyuan Zha -
2019 Poster: Gromov-Wasserstein Learning for Graph Matching and Node Embedding »
Hongteng Xu · Dixin Luo · Hongyuan Zha · Lawrence Carin -
2019 Poster: On Scalable and Efficient Computation of Large Scale Optimal Transport »
Yujia Xie · Minshuo Chen · Haoming Jiang · Tuo Zhao · Hongyuan Zha -
2019 Oral: Gromov-Wasserstein Learning for Graph Matching and Node Embedding »
Hongteng Xu · Dixin Luo · Hongyuan Zha · Lawrence Carin -
2019 Oral: On Scalable and Efficient Computation of Large Scale Optimal Transport »
Yujia Xie · Minshuo Chen · Haoming Jiang · Tuo Zhao · Hongyuan Zha -
2018 Poster: Learning Registered Point Processes from Idiosyncratic Observations »
Hongteng Xu · Lawrence Carin · Hongyuan Zha -
2018 Oral: Learning Registered Point Processes from Idiosyncratic Observations »
Hongteng Xu · Lawrence Carin · Hongyuan Zha -
2017 Poster: Learning Hawkes Processes from Short Doubly-Censored Event Sequences »
Hongteng Xu · Dixin Luo · Hongyuan Zha -
2017 Talk: Learning Hawkes Processes from Short Doubly-Censored Event Sequences »
Hongteng Xu · Dixin Luo · Hongyuan Zha -
2017 Poster: Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs »
Rakshit Trivedi · Hanjun Dai · Yichen Wang · Le Song -
2017 Talk: Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs »
Rakshit Trivedi · Hanjun Dai · Yichen Wang · Le Song -
2017 Poster: Fake News Mitigation via Point Process Based Intervention »
Mehrdad Farajtabar · Jiachen Yang · Xiaojing Ye · Huan Xu · Rakshit Trivedi · Elias Khalil · Shuang Li · Le Song · Hongyuan Zha -
2017 Talk: Fake News Mitigation via Point Process Based Intervention »
Mehrdad Farajtabar · Jiachen Yang · Xiaojing Ye · Huan Xu · Rakshit Trivedi · Elias Khalil · Shuang Li · Le Song · Hongyuan Zha