Accepted Papers

Learning Stable Graphs from Heterogeneous Confounded Environments

Yue He: Tsinghua University; Peng Cui: Tsinghua University; Jianxin Ma: Tsinghua University; Zou Hao: Tsinghua University; Xiaowei Wang: Alibaba; Hongxia Yang: Alibaba; Philip S. Yu: University of Illinois at Chicago IL, USA


Nowadays graph has become a general and powerful representation to describe the rich relationships among different kinds of entities via the underlying patterns encoded in its structure. The knowledge (more generally) accumulated in graph is expected to be able to cross populations from one to another and the past to future. However the data collection process of graph generation is full of known or unknown sample selection biases, leading to spurious correlations among entities, especially in the non-stationary and heterogeneous environments. In this paper, we target the problem of learning stable graphs from multiple environments with selection bias. We purpose a Stable Graph Learning (SGL) framework to learn a graph that can capture general relational patterns which are irrelevant with the selection bias in an unsupervised way. Extensive experimental results from both simulation and real data demonstrate that our method could significantly benefit the generalization capacity of graph structure.

How can we assist you?

We'll be updating the website as information becomes available. If you have a question that requires immediate attention, please feel free to contact us. Thank you!

Please enter the word you see in the image below: