AIBullisharXiv – CS AI · 5d ago7/10
🧠Researchers introduce MP-SSM, a novel framework that integrates State-Space Model principles into message-passing neural networks for improved graph learning. The approach achieves permutation equivariance, computational efficiency, and long-range information propagation while enabling theoretical analysis of gradient flow and information dynamics across deep networks.
AIBullisharXiv – CS AI · May 127/10
🧠Researchers introduce VLADriver-RAG, a new framework that combines Vision-Language-Action models with retrieval-augmented generation for autonomous driving. By grounding decisions in explicit historical knowledge rather than relying solely on learned parameters, the system achieves state-of-the-art performance on the Bench2Drive benchmark with a Driving Score of 89.12, demonstrating improved generalization in complex driving scenarios.
AIBullisharXiv – CS AI · May 127/10
🧠Researchers introduce PRAETORIAN, a novel defense mechanism against backdoor attacks on Graph Neural Networks that targets the fundamental requirements of effective attacks rather than surface-level indicators. The defense achieves a 99.45% reduction in attack success rates while maintaining minimal accuracy degradation, forcing adversaries into an unfavorable trade-off between attack effectiveness and detectability.
AIBullisharXiv – CS AI · May 127/10
🧠Researchers introduce HA-HeteroGNN, a Graph Neural Network framework that improves both interpretability and efficiency through hierarchical attention mechanisms and relevance-driven pruning. The approach achieves a 27% reduction in graph edges while improving classification accuracy by up to 2.46%, alongside 43.9% training time reductions.
AIBullisharXiv – CS AI · May 117/10
🧠Researchers introduce GASim, a graph-accelerated framework that combines large language models with agent-based models for large-scale social simulations. The system achieves 9.94x speedup and reduces computational token usage by 80% while maintaining accuracy in modeling real-world opinion dynamics.
AIBullisharXiv – CS AI · May 77/10
🧠Researchers have developed a neural network architecture inspired by large language models to predict high-dimensional molecular potential energy surfaces, successfully computing accurate predictions for a 186-dimensional system representing a protonated 21-water cluster—a significant advance in computational chemistry that could accelerate reaction rate predictions.
AIBullisharXiv – CS AI · Apr 207/10
🧠Researchers have developed an exascale workflow using graph foundation models trained on 544+ million atomistic structures to accelerate materials discovery. The system can screen 1.1 billion structures in 50 seconds—a task requiring years of traditional computation—and demonstrates strong transfer learning capabilities across diverse chemical applications.
AIBearisharXiv – CS AI · Apr 107/10
🧠Researchers have demonstrated the first multi-targeted backdoor attack against graph neural networks (GNNs) in graph classification tasks, using a novel subgraph injection method that simultaneously redirects multiple predictions to different target labels while maintaining clean accuracy. The attack shows high efficacy across multiple GNN architectures and datasets, with resilience against existing defense mechanisms, exposing significant vulnerabilities in GNN security.
AI × CryptoBullisharXiv – CS AI · Mar 177/10
🤖Researchers developed TAS-GNN, a novel Graph Neural Network framework specifically designed to detect fraudulent behavior in Bitcoin trust systems. The system addresses critical limitations in existing anomaly detection methods by using a dual-channel architecture that separately processes trust and distrust signals to better identify Sybil attacks and exit scams.
$BTC
AIBullisharXiv – CS AI · Mar 56/10
🧠Researchers introduce ANOMIX, a new framework that improves graph neural network anomaly detection by generating hard negative samples through mixup techniques. The method addresses the limitation of existing GNN-based detection systems that struggle with subtle boundary anomalies by creating more robust decision boundaries.
AINeutralarXiv – CS AI · Mar 57/10
🧠Researchers explain why Graph Neural Networks (GNNs) struggle with complex Boolean Satisfiability Problems (SATs) through geometric analysis using graph Ricci Curvature. They prove that harder SAT instances have more negative curvature, creating connectivity bottlenecks that prevent GNNs from effectively processing long-range dependencies.
AIBullisharXiv – CS AI · Mar 57/10
🧠Researchers introduce AxelGNN, a new Graph Neural Network architecture inspired by cultural dissemination theory that addresses key limitations of existing GNNs including oversmoothing and poor handling of heterogeneous relationships. The model demonstrates superior performance in node classification and influence estimation while maintaining computational efficiency across both homophilic and heterophilic graphs.
AIBullisharXiv – CS AI · Mar 46/104
🧠Researchers introduce MASPOB, a bandit-based framework that optimizes prompts for Multi-Agent Systems using Graph Neural Networks to handle topology-induced coupling. The system reduces search complexity from exponential to linear while achieving state-of-the-art performance across benchmarks.
AINeutralarXiv – CS AI · Mar 47/104
🧠Researchers introduce GraphSSR, a new framework that improves zero-shot graph learning by combining Large Language Models with adaptive subgraph denoising. The system addresses structural noise issues in existing methods through a dynamic 'Sample-Select-Reason' pipeline and reinforcement learning training.
AIBullisharXiv – CS AI · Mar 47/102
🧠Researchers propose MIStar, a memory-enhanced improvement search framework using heterogeneous graph neural networks for flexible job-shop scheduling problems in smart manufacturing. The approach significantly outperforms traditional heuristics and state-of-the-art deep reinforcement learning methods in optimizing production schedules.
$NEAR
AINeutralarXiv – CS AI · Mar 37/104
🧠Researchers developed a new graph concept bottleneck layer (GCBM) that can be integrated into Graph Neural Networks to make their decision-making process more interpretable. The method treats graph concepts as 'words' and uses language models to improve understanding of how GNNs make predictions, achieving state-of-the-art performance in both classification accuracy and interpretability.
AINeutralarXiv – CS AI · Mar 37/103
🧠Researchers introduce FSW-GNN, the first Message Passing Neural Network that is fully bi-Lipschitz with respect to standard WL-equivalent graph metrics. This addresses the limitation where standard MPNNs produce poorly distinguishable outputs for separable graphs, with empirical results showing competitive performance and superior accuracy in long-range tasks.
AIBullisharXiv – CS AI · 3d ago6/10
🧠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.
AINeutralarXiv – CS AI · 3d ago6/10
🧠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.
AINeutralarXiv – CS AI · 3d ago6/10
🧠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.
AINeutralarXiv – CS AI · 3d ago6/10
🧠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.
AINeutralarXiv – CS AI · 3d ago6/10
🧠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.
AINeutralarXiv – CS AI · 4d ago6/10
🧠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.
AIBullisharXiv – CS AI · 4d ago6/10
🧠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.
AINeutralarXiv – CS AI · 4d ago6/10
🧠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.
