Papers › MLANE: Meta-Learning Based Adaptive Network Embedding
MLANE: Meta-Learning Based Adaptive Network Embedding
Chen Cui, Ning Yang, Philip S. Yu
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Most existing random walk based network embedding methods often follow only one of two principles, homophily or structural equivalence. In real world networks, however, nodes exhibit a mixture of homophily and structural equivalence, which requires adaptive network embedding that can adaptively preserve both homophily and structural equivalence for different nodes in different down-stream analysis tasks. In this paper, we propose a novel method called Meta-Learning based Adaptive Network Embedding (MLANE), which can learn adaptive sampling strategy for different nodes in different tasks by incorporating sampling strategy learning with embedding learning into one optimization problem that can be solved via an end-to-end meta-learning framework. In extensive experiments on real datasets, MLANE shows significant performance improvements over the baselines. The source code of MLANE and the datasets used in experiments and all the hyperparameter settings for baselines are available at https://github.com/7733com/MLANE.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections