GNN Training
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
AcOrch: Accelerating Sampling-based GNN Training under CPU-NPU Heterogeneous Environments
arXiv:2606.01161v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have achieved remarkable success in various applications. Sampling-based GNN training, which conducts mini-batch training on sampled subgraphs, has become a promising solution for large-scale graphs. Given the resource-intensive nature of sampling-based GNN training, Neural Processing Units (NPUs), such as the Ascend AI processor, offer a promising alternative due to their high throughput and energy efficiency,...
SIGMA: A Versatile Streaming Graph Partitioner for Vertex- and Edge-Balanced Distributed GNN Training
Announce Type: new Abstract: Distributed Graph Neural Network (GNN) training depends critically on how the underlying graph is partitioned across compute resources. Existing graph partitioners focus either on vertex partitioning or edge partitioning and typically optimize only a single communication objective (edge cut or vertex cut) under a single balance constraint (vertex balance or edge balance).
GreenGNN: Energy-Aware Windowed Communication Optimization for Distributed GNN Training
Announce Type: new Abstract: Large-scale graph neural network (GNN) training often requires distributed clusters because graph structure and feature tensors no longer fit in a single node's memory. In sampling-based training, each mini-batch expands into a receptive field that spans partitions and triggers thousands of remote feature fetches per epoch. This wastes energy for two main reasons: each small RPC pays a fixed initiation and protocol cost, and GPUs continue drawing substantial...
Beyond Homophily: Towards Generalized Graph Reconstruction Attack and Defense
arXiv:2606.08067v1 Announce Type: new Abstract: Graph neural networks (GNNs) are widely deployed on relational data, yet they can leak sensitive or proprietary information about the training graph adjacency, e.g., social ties, transactions, and interactions. This work studies graph reconstruction attacks (GRA), a form of model inversion that reconstructs the training adjacency from a trained GNN, given different levels of attacker-side information.
Text-attributed Graph Condensation via Text Selection and Attribute Matching
Announce Type: new Abstract: Text-Attributed Graph (TAG) is an important type of graph structured data, where each node has a text description. TAG models usually train a Graph Neural Network (GNN) and language model jointly, which leads to high space and time consumption, especially on large datasets. To mitigate this, we propose TAGSAM, a condensation method that compresses TAGs while preserving training accuracy.
Reducing the GPU Memory Bottleneck with Lossless Compression for ML -- Extended
arXiv:2605.30728v1 Announce Type: new Abstract: Machine learning (ML) training and inference often process data sets far exceeding GPU memory capacity, forcing them to rely on PCIe for on-demand tensor transfers, causing critical transfer bottlenecks. Lossy compression has been proposed to relieve bottlenecks but introduces workload-dependent accuracy loss, making it complex or even prohibitive to use in existing ML deployments.
ML for the hKLM at the 2nd Detector
arXiv:2604.08447v2 Announce Type: replace Abstract: The present research applies Graph Neural-Networks (GNNs) for energy measurement and particle identification tasks for a proposed second detector at the future Electron Ion Collider (EIC). In particular, an iron-scintillator sampling calorimeter would provide neutral hadron ($K_L$ and neutron) energy measurements and identification, as well as separation of muons from hadrons. Using detector simulations, particle hits in the detector are...
Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms
arXiv:2601.22943v2 Announce Type: replace Abstract: Graph coarsening reduces the size of a graph while preserving certain properties. Most existing methods preserve either spectral or spatial characteristics. Recent research shows that topology-preserving coarsening methods maintain GNN performance on coarsened graphs but suffer from exponential time complexity.
Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias
Announce Type: replace Abstract: Self-supervised pre-training on unlabeled graph data has become a common paradigm for Graph Neural Networks (GNNs). However, an objective gap often remains between pre-training objectives and downstream tasks. To bridge this gap, graph prompting methods adapt frozen pre-trained GNNs to specific downstream tasks through learnable prompts.
DPU or GPU for Accelerating Neural Networks Inference -- Why not both? Split CNN Inference
Announce Type: replace Abstract: Video and image streaming on edge devices requires low latency. To address this, Neural Networks (NNs) are widely used, and prior work mainly focuses on accelerating them with single hardware units such as Graphics Processing Units (GPUs), Field Programmable Gate Arrays (FPGAs), and Deep Learning Processing Units (DPUs). However, further reductions in latency can be observed by combining these units.