Meta-learning optimizes predictions of missing links in real-world networks

• URL: http://arxiv.org/abs/2508.09069v1
• Date: Tue, 12 Aug 2025 16:41:16 GMT
• Title: Meta-learning optimizes predictions of missing links in real-world networks
• Authors: Bisman Singh, Lucy Van Kleunen, Aaron Clauset,
• Abstract summary: We show that no algorithm is best across all input networks.<n>We introduce a meta-learning algorithm that exploits this variability to optimize link predictions for individual networks.
• Score: 1.5976170220566237
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Relational data are ubiquitous in real-world data applications, e.g., in social network analysis or biological modeling, but networks are nearly always incompletely observed. The state-of-the-art for predicting missing links in the hard case of a network without node attributes uses model stacking or neural network techniques. It remains unknown which approach is best, and whether or how the best choice of algorithm depends on the input network's characteristics. We answer these questions systematically using a large, structurally diverse benchmark of 550 real-world networks under two standard accuracy measures (AUC and Top-k), comparing four stacking algorithms with 42 topological link predictors, two of which we introduce here, and two graph neural network algorithms. We show that no algorithm is best across all input networks, all algorithms perform well on most social networks, and few perform well on economic and biological networks. Overall, model stacking with a random forest is both highly scalable and surpasses on AUC or is competitive with graph neural networks on Top-k accuracy. But, algorithm performance depends strongly on network characteristics like the degree distribution, triangle density, and degree assortativity. We introduce a meta-learning algorithm that exploits this variability to optimize link predictions for individual networks by selecting the best algorithm to apply, which we show outperforms all state-of-the-art algorithms and scales to large networks.

Related papers

• Coverage Analysis of Multi-Environment Q-Learning Algorithms for Wireless Network Optimization [18.035417008213077]
  Recent advancements include ensemble multi-environment hybrid Q-learning algorithms. We show that our algorithm can achieve %50 less policy error and %40 less runtime complexity than state-of-the-art reinforcement learning algorithms.
  arXiv  Detail & Related papers  (2024-08-29T20:09:20Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Towards Better Out-of-Distribution Generalization of Neural Algorithmic Reasoning Tasks [51.8723187709964]
  We study the OOD generalization of neural algorithmic reasoning tasks. The goal is to learn an algorithm from input-output pairs using deep neural networks.
  arXiv  Detail & Related papers  (2022-11-01T18:33:20Z)
• TeleGraph: A Benchmark Dataset for Hierarchical Link Prediction [11.051062214108894]
  Link prediction is a key problem for network-structured data, attracting considerable research efforts owing to its diverse applications. We present a new benchmark dataset TeleGraph, a highly sparse and hierarchical telecommunication network associated with rich node attributes. Our empirical results suggest that most of the algorithms fail to produce a satisfactory performance on a nearly tree-like dataset.
  arXiv  Detail & Related papers  (2022-04-16T03:01:10Z)
• Unsupervised Domain-adaptive Hash for Networks [81.49184987430333]
  Domain-adaptive hash learning has enjoyed considerable success in the computer vision community. We develop an unsupervised domain-adaptive hash learning method for networks, dubbed UDAH.
  arXiv  Detail & Related papers  (2021-08-20T12:09:38Z)
• Hashing-Accelerated Graph Neural Networks for Link Prediction [14.806621296069649]
  #GNN is able to efficiently acquire node representation in the Hamming space for link prediction. #GNN is able to efficiently acquire node representation in the Hamming space for link prediction.
  arXiv  Detail & Related papers  (2021-05-29T12:04:27Z)
• Learning Structures for Deep Neural Networks [99.8331363309895]
  We propose to adopt the efficient coding principle, rooted in information theory and developed in computational neuroscience. We show that sparse coding can effectively maximize the entropy of the output signals. Our experiments on a public image classification dataset demonstrate that using the structure learned from scratch by our proposed algorithm, one can achieve a classification accuracy comparable to the best expert-designed structure.
  arXiv  Detail & Related papers  (2021-05-27T12:27:24Z)
• Firefly Neural Architecture Descent: a General Approach for Growing Neural Networks [50.684661759340145]
  Firefly neural architecture descent is a general framework for progressively and dynamically growing neural networks. We show that firefly descent can flexibly grow networks both wider and deeper, and can be applied to learn accurate but resource-efficient neural architectures. In particular, it learns networks that are smaller in size but have higher average accuracy than those learned by the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-02-17T04:47:18Z)
• MODEL: Motif-based Deep Feature Learning for Link Prediction [23.12527010960999]
  We propose a novel embedding algorithm that incorporates network motifs to capture higher-order structures in the network. Experiments were conducted on three types of networks: social networks, biological networks, and academic networks. Our algorithm outperforms both the traditional similarity-based algorithms by 20% and the state-of-the-art embedding-based algorithms by 19%.
  arXiv  Detail & Related papers  (2020-08-09T03:39:28Z)
• Topological Insights into Sparse Neural Networks [16.515620374178535]
  We introduce an approach to understand and compare sparse neural network topologies from the perspective of graph theory. We first propose Neural Network Sparse Topology Distance (NNSTD) to measure the distance between different sparse neural networks. We show that adaptive sparse connectivity can always unveil a plenitude of sparse sub-networks with very different topologies which outperform the dense model.
  arXiv  Detail & Related papers  (2020-06-24T22:27:21Z)
• Communication-Efficient Distributed Stochastic AUC Maximization with Deep Neural Networks [50.42141893913188]
  We study a distributed variable for large-scale AUC for a neural network as with a deep neural network. Our model requires a much less number of communication rounds and still a number of communication rounds in theory. Our experiments on several datasets show the effectiveness of our theory and also confirm our theory.
  arXiv  Detail & Related papers  (2020-05-05T18:08:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.