AINeutralarXiv – CS AI · May 276/10
🧠Researchers propose G-Substrate, a novel graph framework that treats graph structures as persistent substrates across multiple data modalities and tasks rather than isolated, task-specific constructs. The approach uses unified structural schemas and role-based training to enable graph representations to accumulate knowledge across heterogeneous domains, demonstrating superior performance compared to traditional isolated and multi-task learning methods.
AIBullisharXiv – CS AI · May 276/10
🧠Researchers introduce BOSQ, a framework that optimizes the use of large language models for graph neural network tasks by selectively querying LLMs only when necessary. This approach reduces computational costs by orders of magnitude while maintaining or improving performance on text-attributed graph datasets, addressing a critical bottleneck in practical LLM-enhanced graph learning.
AINeutralarXiv – CS AI · May 276/10
🧠Researchers introduce MuNet, a unified deep learning framework that jointly optimizes 3D human mesh recovery and clothed human reconstruction from single images using graph convolutional networks. The approach leverages mutualistic feedback between the two tasks to achieve state-of-the-art results across six benchmark datasets, with code released for research purposes.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers propose HAGE, a weighted multi-relational memory framework that improves how large language model agents retrieve and traverse information by treating memory as a dynamic graph rather than static lookups. The system uses reinforcement learning to optimize edge representations and routing behavior, achieving better long-horizon reasoning accuracy with improved efficiency compared to existing agentic memory systems.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers propose L3-PPI, a biologically-informed machine learning approach for predicting protein-protein interactions by leveraging the L3 rule—the principle that multiple length-3 paths between proteins indicate interaction likelihood. The method integrates a lightweight graph prompt learning module into existing PPI predictors as a plug-and-play component, demonstrating superior performance over conventional approaches that rely on generic aggregation methods.
AIBullisharXiv – CS AI · May 126/10
🧠Researchers present SLASH, a training-free method that improves how Large Language Models understand graph structures by fixing an internal attention bottleneck. The approach leverages LLMs' spontaneous ability to reconstruct graph topologies internally, addressing a fundamental limitation where language-focused attention patterns suppress graph reasoning capabilities.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers present a novel machine learning framework that combines DNA sequence analysis with graph neural networks to predict biological age from methylation patterns, achieving 12.8% improvement over existing methods. The approach uses handcrafted sequence features rather than deep learning to encode biological context, demonstrating practical advantages in aging research applications.
AINeutralarXiv – CS AI · May 125/10
🧠Researchers have developed a crystal fractional graph neural network that combines graph neural networks with compositional embeddings to predict the energy of high-entropy alloys, achieving accuracy comparable to first-principles calculations on a dataset of over 1,000 crystal structures. The hybrid architecture addresses a key challenge in materials science by integrating local atomic interactions and global elemental composition, though scalability limitations for larger crystal systems remain.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce GCD-FGL, a federated graph learning framework that enables decentralized networks to discover novel categories while preserving knowledge of known ones. The approach addresses critical challenges in distributed graph learning by implementing topology-reliable semantic alignment on client nodes and hierarchical prototype alignment on servers, demonstrating significant performance improvements across multiple datasets.
AINeutralarXiv – CS AI · May 125/10
🧠Researchers propose SimpleST, a lightweight prompt tuning framework that enhances spatio-temporal graph neural networks' ability to generalize across different traffic prediction scenarios. By keeping pre-trained model parameters fixed while adapting through efficient prompting, the approach reduces computational overhead while improving accuracy on real-world urban datasets.
AINeutralarXiv – CS AI · May 126/10
🧠This research paper presents a task-aligned framework for applying Graph Neural Networks (GNNs) to Electronic Design Automation (EDA) problems, arguing that successful implementations require architectural alignment with the underlying mathematics of each specific chip design task. The authors systematize how different EDA challenges—from timing analysis to routing and power delivery—demand distinct GNN computation patterns, identifying current mismatches and failure modes that will likely shape future development.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers propose a Graph Neural Network framework to predict structural displacements in buildings, offering a faster alternative to traditional finite element methods. The GNN approach, trained on synthetic data from a two-story frame structure, outperforms conventional neural networks and demonstrates potential for real-time structural health monitoring and seismic safety applications.
AINeutralarXiv – CS AI · May 125/10
🧠Researchers propose a multi-level graph attention network framework that uses contrastive learning to improve knowledge-graph-based recommendation systems. The approach addresses limitations in existing methods by leveraging multi-view learning and self-supervised techniques to better model user preferences and item representations.
AINeutralarXiv – CS AI · May 126/10
🧠A comprehensive survey paper systematizes recent advances in attention-based graph neural networks (GNNs), proposing a two-level taxonomy spanning three developmental stages: graph recurrent attention networks, graph attention networks, and graph transformers. The work addresses a gap in literature by providing structured analysis of how attention mechanisms enhance GNNs' ability to learn discriminative features while filtering noise in graph-structured data.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers propose Structure-Centric Graph Foundation Models (SCGFM), a novel approach that treats graph topology as the primary source of transferable knowledge using geometric bases and Gromov-Wasserstein distances. The method addresses key limitations in existing graph foundation models by handling structural heterogeneity and incompatible node feature spaces, demonstrating improved generalization across both in-domain and cross-domain graph tasks.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce RAwR, a graph neural network rewiring framework that addresses the oversquashing problem by augmenting graphs with quotient graphs derived from equitable partitions. The method improves GNN performance on long-range prediction tasks while maintaining computational efficiency and demonstrates state-of-the-art results across diverse benchmarks.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce CTQWformer, a novel machine learning framework that combines continuous-time quantum walks with transformer architectures for improved graph classification. The hybrid approach outperforms existing graph neural network and kernel-based methods by better capturing both global structural dependencies and dynamic information propagation in complex networks.
AINeutralarXiv – CS AI · May 125/10
🧠Researchers introduce ChaosNetBench, a synthetic benchmark framework for evaluating spatio-temporal graph neural networks (STGNNs) on chaotic dynamical systems. The framework reveals that STGNNs outperform traditional baselines (TCN, N-BEATS, Transformers) in high-chaos regimes, while non-graph methods remain competitive in low-chaos conditions.
AINeutralarXiv – CS AI · May 126/10
🧠Researchers introduce UFO, a framework addressing robust continual graph learning by simultaneously tackling catastrophic forgetting and noisy data supervision in evolving graphs. The method uses flow-based generative modeling to mitigate forgetting and instance-level reliability scoring to handle corrupted labels, demonstrating superior performance across benchmark datasets.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers introduce AdaTKG, a novel machine learning approach for temporal knowledge graph reasoning that maintains adaptive per-entity memory updated with each interaction, enabling better predictions on evolving relational data and improved handling of unseen entities compared to existing static representation methods.
AIBullisharXiv – CS AI · May 116/10
🧠GraphReAct introduces a new reasoning-acting framework that enhances large language models for multi-step inference over graph-structured data by combining topological and semantic retrieval actions with context refinement. The framework demonstrates consistent improvements over existing methods across six benchmark datasets, advancing how AI systems can reason about interconnected, structured information.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers introduce RelAge-GNN, a graph neural network framework that models complex biological relationships among DNA methylation sites to improve aging clock predictions. The method outperforms existing approaches in estimating biological age and shows enhanced sensitivity for detecting age acceleration in disease cohorts, with interpretability analysis revealing which relationships and CpG sites drive predictions.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers identify why Graph Neural Network explanations produce inconsistent results when re-applied to their own outputs, attributing this to context perturbation during re-explanation. They propose Self-Denoising, a training-free post-processing method that improves explanation quality with minimal computational overhead.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers introduce PPI-Net, a hierarchical graph neural network that integrates protein-protein interaction networks with biological pathway data to predict cancer outcomes and mechanisms. Demonstrating over 90% balanced accuracy across ten cancer types, the model reveals how molecular changes propagate through biological systems to drive disease, offering both predictive power and mechanistic interpretability.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers propose a Hybrid Graph Neural Network (HGNN) for improved EEG-based depression detection that combines fixed and adaptive graph connections to capture both common and individualized brain patterns. The model incorporates a hierarchical pooling mechanism to extract patient-specific brain network information, achieving state-of-the-art results on public datasets.
