176 articles tagged with #graph-neural-networks. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce 1D-CGS, a lightweight deep learning model combining 1D-CNN and GraphSAGE for identifying influential nodes in complex networks. The model achieves 4.73% improvement over existing methods while maintaining significantly faster computational performance, with applications across network analysis domains.
Researchers introduce TCAR-Gen, a retrieval-augmented generation framework that improves temporal reasoning and evidence fusion for answering complex questions over historical narratives. The system outperforms existing RAG approaches on the Victorian Crime Diaries benchmark by combining graph neural networks with temporal modeling and chain-of-trees reasoning.
Researchers propose GJDNet, a robust Graph Neural Network defense framework that protects against adversarial attacks by jointly disentangling node representations and decision spaces. The approach addresses vulnerabilities in GNNs caused by adversarial perturbations that invert graph connectivity patterns, achieving improved robustness across different graph types.
Researchers present a machine learning architecture combining BERT and Graph Neural Networks to automatically extract entities and relationships from historical texts and construct structured knowledge graphs. The system demonstrates superior performance compared to traditional rule-based methods when processing complex historical documents with linguistic ambiguities and implicit references.
A comprehensive survey introduces graph neural networks (GNNs) through an encoder-decoder framework, demonstrating their effectiveness across various graph analytics tasks. The paper emphasizes critical challenges like oversmoothing and oversquashing in GNN training, providing experimental insights on how network performance scales with training data and graph complexity.
Researchers present RGPD, a physics-informed neural network framework that dynamically balances multiple loss functions to improve Remaining Useful Life (RUL) and State of Health (SoH) predictions across industrial assets. The model achieves up to 20% improvement in accuracy over existing methods by combining graph-based representation learning with reinforcement learning-driven adaptive weighting, demonstrating strong generalization across engine, bearing, and battery degradation datasets.
M-DESIGN, a new retrieval-augmented framework, addresses the inefficiency gap between expensive neural architecture search and suboptimal model retrieval by dynamically leveraging historical evidence from prior tasks to discover near-optimal network modifications. Tested on 67,760 graph neural networks across 22 datasets, the method achieves state-of-the-art performance in 79% of cases under computational constraints.
Researchers propose RGVQ, a novel framework addressing codebook collapse in Vector Quantization for graph neural networks, a technical limitation that degrades token expressiveness and generalization. By integrating graph topology as regularization and introducing soft assignments, RGVQ improves codebook utilization across downstream graph learning tasks.
Researchers introduce GraphARC, a new benchmark for evaluating artificial intelligence systems on abstract reasoning tasks using graph-structured data. The framework extends the popular ARC benchmark to graph domains, revealing significant limitations in current language models—particularly a gap between understanding graph properties and executing complex transformations, with performance degrading substantially on larger instances.
Researchers propose GC-MoE, a graph-conditioned mixture of experts framework that improves traffic forecasting by assigning specialized neural network experts to different road segments based on graph topology. The approach trains only 17K parameters while leveraging 1.5M frozen expert weights, achieving competitive results across four standard traffic prediction benchmarks.
Researchers introduce simplified and factored cellular Weisfeiler Leman tests alongside maximal clique complexes to enable scalable higher-order graph neural networks. The CliqueWalk algorithm samples maximal cliques efficiently without explicit enumeration, addressing the critical scalability bottleneck that has limited adoption of topological learning approaches in production systems.
Researchers introduce XXLTraffic and EvoXXLTraffic, new datasets spanning 27 years of California and Australian traffic sensor data that account for real-world network growth. Unlike existing benchmarks assuming fixed sensor networks, these datasets expose the challenge of forecasting across dynamically evolving road infrastructure with sensor growth rates exceeding 10,000%, and reveal that current state-of-the-art models fail to generalize under such conditions.
Researchers introduce Dual-Scale Retentive Dynamics (DSRD), a machine learning framework that improves how AI systems understand evolving network structures by simultaneously modeling temporal changes and structural relationships. The approach achieves state-of-the-art results on 14 benchmarks for graph prediction tasks, suggesting improved capabilities for systems that must adapt to dynamic, real-world data.
Researchers present a factorial benchmark decomposing 2D molecular message-passing neural networks into 84 distinct configurations to identify which operator components drive molecular property prediction performance. The study finds that message construction methods significantly outweigh update complexity in determining model effectiveness, with concatenation-based mixing showing superior performance in differentiating molecular structures.
Researchers present Graph-Enhanced Policy Optimization (GEPO), a new training framework for multi-step LLM agents that improves credit assignment by analyzing state-transition graphs and task relevance. The method achieves 1.1-3.8% performance gains across multiple benchmarks by differentiating the importance of individual steps and trajectories based on their structural and semantic roles.
Researchers introduce Rel-MOSS, a novel graph neural network approach designed to address class imbalance problems in relational database entity classification. The method uses relation-centric gating and minority oversampling techniques to prevent underrepresentation of minority classes, achieving 2-4% performance improvements over existing relational deep learning methods.
Researchers propose GraD-IBD, a graph-based machine learning model that analyzes patient diagnosis histories encoded in ICD codes to detect inflammatory bowel disease risk earlier and more efficiently than existing sequential models. The approach reformulates longitudinal diagnostic trajectories as temporally directed graphs with a novel message-passing mechanism, demonstrating improved accuracy while reducing computational complexity.
Researchers propose LGSPF, an LLM-GNN framework using soft prompts to improve fraud detection without relying on textual data. The method combines language models with graph neural networks to capture multi-relational complexity in fraud patterns, achieving state-of-the-art results across benchmarks.
SignGAD introduces a novel framework for graph anomaly detection that dynamically designs task-specific workflows rather than relying on fixed detection pipelines. The approach combines self-designing agentic workflows with a guarded refit strategy to improve detection accuracy in few-shot learning scenarios, addressing longstanding limitations in identifying anomalous nodes within attributed graphs.
Researchers demonstrate that Cross-Attention Graph Neural Networks significantly outperform traditional architectures for predicting drug-drug interaction mechanisms, improving multi-class classification by 45% while showing minimal gains in binary detection. Validation on acetylsalicylic acid pairs confirms the approach's effectiveness, suggesting atom-level inter-molecular communication is critical for mechanism-type prediction rather than simple interaction detection.
Researchers introduce FluxMem, a memory framework for AI agents that treats memory as a continuously evolving graph rather than a static repository. The system dynamically refines memory connections through feedback and consolidation across three stages, achieving state-of-the-art results on multiple benchmarks.
Researchers demonstrate that graph autoencoders (GAEs), traditionally viewed as distinct from graph contrastive learning approaches, actually function as implicit contrastive learners. By unifying these paradigms and introducing asymmetric contrastive views as a design principle, the work provides a clearer framework for understanding and building more effective graph neural networks for self-supervised learning tasks.
Researchers introduce STFlow, a machine learning model that improves trajectory simulation for complex dynamical systems by using graph neural networks and data-dependent couplings within a Flow Matching framework. The approach outperforms existing methods on molecular dynamics, N-body systems, and pedestrian forecasting with fewer simulation steps and lower computational costs.
Researchers propose a novel machine learning framework for estimating individual treatment effects from graph-structured data that explicitly models differentiated networked effects—how neighbors of varying importance and scales influence outcomes. The method uses partial attention mechanisms and message amplifiers to improve accuracy in observational studies across commerce and medicine.
Researchers introduce Periodic-TDL, a deep learning framework using topological data analysis to predict polymer properties more accurately than existing models. The approach captures many-body interactions across polymer chains and has been validated against experimental data from newly synthesized polymers, demonstrating practical utility in accelerating polymer discovery.
