From Euclidean to Graph-Structured Data: A Survey of Collaborative Learning

• URL: http://arxiv.org/abs/2609.02984v1
• Date: Wed, 02 Sep 2026 13:49:46 GMT
• Title: From Euclidean to Graph-Structured Data: A Survey of Collaborative Learning
• Abstract summary: Most collaborative learning research focuses on Euclidean data with regular, grid-like structure.<n>Learning on graphs relies on message-passing mechanisms to propagate information between connected nodes.<n>This survey provides a comprehensive investigation of collaborative learning from Euclidean to graph-structured data.
• Score: 3.402787708517185
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The conventional approach to machine learning, that is, collecting data, training models, and performing inference in a single location, faces fundamental limitations, including scalability and privacy, that restrict its applicability. To address these challenges, recent research has explored collaborative learning approaches, including federated learning and decentralized learning, where individual agents perform training and inference locally, with limited collaboration. Most collaborative learning research focuses on Euclidean data with regular, grid-like structure (e.g., images, text). However, these approaches fail to capture the relational patterns in many real-world applications, best represented by graphs. Learning on graphs relies on message-passing mechanisms to propagate information between connected nodes, making it conceptually well-suited for collaborative environments where agents must exchange information. Yet, the opportunities and challenges of learning on graph-structured data in collaborative settings remain largely underexplored. This survey provides a comprehensive investigation of collaborative learning from Euclidean to graph-structured data, aiming to consolidate this emerging field. We begin by reviewing its foundational principles for Euclidean data, organizing them along three core dimensions: learning effectiveness, efficiency, and privacy preservation. We then extend the discussion to graph-structured data, introducing a taxonomy of graph distribution scenarios, characterizing associated statistical heterogeneities, and developing standardized problem formulations and algorithmic frameworks. Finally, we systematically identify open challenges and promising research directions.

Related papers

• Graph Foundation Models: A Comprehensive Survey [66.74249119139661]
  Graph Foundation Models (GFMs) aim to bring scalable, general-purpose intelligence to structured data.<n>This survey provides a comprehensive overview of GFMs, unifying diverse efforts under a modular framework.<n>GFMs are poised to become foundational infrastructure for open-ended reasoning over structured data.
  arXiv  Detail & Related papers  (2025-05-21T05:08:00Z)
• Towards Graph Prompt Learning: A Survey and Beyond [38.55555996765227]
  Large-scale "pre-train and prompt learning" paradigms have demonstrated remarkable adaptability. This survey categorizes over 100 relevant works in this field, summarizing general design principles and the latest applications.
  arXiv  Detail & Related papers  (2024-08-26T06:36:42Z)
• Interventional Causal Structure Discovery over Graphical Models with Convergence and Optimality Guarantees [0.0]
  We develop a bilevel optimization (Bloom) framework for causal structure learning. Bloom not only provides theoretical support for causal structure discovery from both interventional and observational data, but also aspires to an efficient causal discovery algorithm. It is seen through experiments on both synthetic and real-world datasets that Bloom markedly surpasses other leading learning algorithms.
  arXiv  Detail & Related papers  (2024-08-09T02:22:50Z)
• Graph Enhanced Reinforcement Learning for Effective Group Formation in Collaborative Problem Solving [3.392758494801288]
  This study addresses the challenge of forming effective groups in collaborative problem-solving environments. We propose a novel approach leveraging graph theory and reinforcement learning.
  arXiv  Detail & Related papers  (2024-03-15T04:04:40Z)
• Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning [53.81365215811222]
  We provide a review and summary of the latest approaches, strategies, and insights that address distribution shifts within the context of graph learning. We categorize existing graph learning methods into several essential scenarios, including graph domain adaptation learning, graph out-of-distribution learning, and graph continual learning. We discuss the potential applications and future directions for graph learning under distribution shifts with a systematic analysis of the current state in this field.
  arXiv  Detail & Related papers  (2024-02-26T07:52:40Z)
• Learning Federated Neural Graph Databases for Answering Complex Queries from Distributed Knowledge Graphs [53.03085605769093]
  We propose to learn Federated Neural Graph DataBase (FedNGDB), a pioneering systematic framework that empowers privacy-preserving reasoning over multi-source graph data.<n>FedNGDB leverages federated learning to collaboratively learn graph representations across multiple sources, enriching relationships between entities, and improving the overall quality of graph data.
  arXiv  Detail & Related papers  (2024-02-22T14:57:44Z)
• ADEPT: Hierarchical Bayes Approach to Personalized Federated Unsupervised Learning [7.19348361223786]
  We develop algorithms based on optimization criteria inspired by a hierarchical Bayesian statistical framework.<n>We develop adaptive algorithms that discover the balance between using limited local data and collaborative information.<n>We evaluate our proposed algorithms using synthetic and real data, demonstrating the effective sample amplification for personalized tasks.
  arXiv  Detail & Related papers  (2024-02-19T20:53:27Z)
• A Framework for Exploring Federated Community Detection [4.358468367889626]
  Federated Learning is machine learning in the context of a network of clients whilst maintaining data residency and/or privacy constraints. Community detection is the unsupervised discovery of clusters of nodes within graph-structured data. We conduct initial experiments across a range of existing datasets that showcase the gap in performance introduced by the distributed data.
  arXiv  Detail & Related papers  (2023-12-14T15:13:04Z)
• Exploring Federated Unlearning: Review, Comparison, and Insights [101.64910079905566]
  federated unlearning enables the selective removal of data from models trained in federated systems.<n>This paper examines existing federated unlearning approaches, examining their algorithmic efficiency, impact on model accuracy, and effectiveness in preserving privacy.<n>We propose the OpenFederatedUnlearning framework, a unified benchmark for evaluating federated unlearning methods.
  arXiv  Detail & Related papers  (2023-10-30T01:34:33Z)
• Privacy-Preserving Graph Machine Learning from Data to Computation: A Survey [67.7834898542701]
  We focus on reviewing privacy-preserving techniques of graph machine learning. We first review methods for generating privacy-preserving graph data. Then we describe methods for transmitting privacy-preserved information.
  arXiv  Detail & Related papers  (2023-07-10T04:30:23Z)
• A Field Guide to Federated Optimization [161.3779046812383]
  Federated learning and analytics are a distributed approach for collaboratively learning models (or statistics) from decentralized data. This paper provides recommendations and guidelines on formulating, designing, evaluating and analyzing federated optimization algorithms.
  arXiv  Detail & Related papers  (2021-07-14T18:09:08Z)

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.