UniNet: Scalable Network Representation Learning with Metropolis-Hastings Sampling
Xingyu Yao, Yingxia Shao, Bin Cui, Lei Chen

TL;DR
UniNet introduces a scalable network representation learning framework utilizing a novel Metropolis-Hastings based edge sampler, enabling efficient random walk generation and modeling for large-scale networks.
Contribution
It unifies various random walk models with an efficient sampling method, supporting scalable learning from large networks.
Findings
Demonstrates efficiency on billion-edge networks
Supports flexible transition probability definitions
Achieves scalable network embedding
Abstract
Network representation learning (NRL) technique has been successfully adopted in various data mining and machine learning applications. Random walk based NRL is one popular paradigm, which uses a set of random walks to capture the network structural information, and then employs word2vec models to learn the low-dimensional representations. However, until now there is lack of a framework, which unifies existing random walk based NRL models and supports to efficiently learn from large networks. The main obstacle comes from the diverse random walk models and the inefficient sampling method for the random walk generation. In this paper, we first introduce a new and efficient edge sampler based on Metropolis-Hastings sampling technique, and theoretically show the convergence property of the edge sampler to arbitrary discrete probability distributions. Then we propose a random walk model…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Domain Adaptation and Few-Shot Learning
