惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

云风的 BLOG
云风的 BLOG
GbyAI
GbyAI
G
Google Developers Blog
Engineering at Meta
Engineering at Meta
月光博客
月光博客
腾讯CDC
Recent Announcements
Recent Announcements
酷 壳 – CoolShell
酷 壳 – CoolShell
爱范儿
爱范儿
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
S
SegmentFault 最新的问题
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
阮一峰的网络日志
阮一峰的网络日志
博客园 - 【当耐特】
The GitHub Blog
The GitHub Blog
Last Week in AI
Last Week in AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
aimingoo的专栏
aimingoo的专栏
Google DeepMind News
Google DeepMind News
Y
Y Combinator Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Martin Fowler
Martin Fowler
A
About on SuperTechFans
博客园 - 叶小钗

cs.SI updates on arXiv.org

Hiding in Plain Sight: Finding MAHA on Reddit Prism: Structural Symmetry Scanning via Duality-Constrained Laplacian Projection MV-Gate: Insider Threat Detection via Multi-View Behavioral Statistics and Semantic Modeling Algorithmic Cultivation: How Social Media Feeds Shape User Language Universal Dynamics of Punctuated Progress AI-Mediated Communication Can Steer Collective Opinion CitePrism: Human-in-the-Loop AI for Citation Auditing and Editorial Integrity Explainable Detection of Depression Status Shifts from User Digital Traces Can Visual Mamba Improve AI-Generated Image Detection? An In-Depth Investigation ScioMind: Cognitively Grounded Multi-Agent Social Simulation with Anchoring-Based Belief Dynamics and Dynamic Profiles Humanwashing -- It Should Leave You Feeling Dirty When Do LLMs Generate Realistic Social Networks? A Multi-Dimensional Study of Culture, Language, Scale, and Method Moltbook Moderation: Uncovering Hidden Intent Through Multi-Turn Dialogue Linking Extreme Discourse to Structural Polarization in Signed Interaction Networks Predicting Channel Closures in the Lightning Network with Machine Learning Latent Causal Void: Explicit Missing-Context Reconstruction for Misinformation Detection Predictive Maps of Multi-Agent Reasoning: A Successor-Representation Spectrum for LLM Communication Topologies Large Language Models for Causal Relations Extraction in Social Media: A Validation Framework for Disaster Intelligence When Can Digital Personas Reliably Approximate Human Survey Findings? RAwR: Role-Aware Rewiring via Approximate Equitable Partition GravityGraphSAGE: Link Prediction in Directed Attributed Graphs Structure-Centric Graph Foundation Model via Geometric Bases Attention-based graph neural networks: a survey When AI Meets Science: Research Diversity, Interdisciplinarity, Visibility, and Retractions across Disciplines in a Global Surge Scalable inference of spatial regions and temporal signatures from time series Can LLMs Emulate Human Belief Dynamics? Predicting Post Virality with Temporal Cross-Attention over Trend Signals H3: A Healthcare Three-Hop Index for Physician Referral Network Prediction Dynamic Graph with Similarity-Aware Attention Graph Neural Network for Recommender Systems Spectral Graph Sparsification Preserves Representation Geometry in Graph Neural Networks
Graph Invariant Learning with Subgraph Co-mixup for Out-O...
Tianrui Jia, Haoyang Li, Cheng Yang, Tao Tao, Chuan Shi · 2023-12-18 · via cs.SI updates on arXiv.org

Graph neural networks (GNNs) have been demonstrated to perform well in graph representation learning, but always lacking in generalization capability when tackling out-of-distribution (OOD) data. Graph invariant learning methods, backed by the invariance principle among defined multiple environments, have shown effectiveness in dealing with this issue. However, existing methods heavily rely on well-predefined or accurately generated environment partitions, which are hard to be obtained in practice, leading to sub-optimal OOD generalization performances. In this paper, we propose a novel graph invariant learning method based on invariant and variant patterns co-mixup strategy, which is capable of jointly generating mixed multiple environments and capturing invariant patterns from the mixed graph data. Specifically, we first adopt a subgraph extractor to identify invariant subgraphs. Subsequently, we design one novel co-mixup strategy, i.e., jointly conducting environment Mixup and invariant Mixup. For the environment Mixup, we mix the variant environment-related subgraphs so as to generate sufficiently diverse multiple environments, which is important to guarantee the quality of the graph invariant learning. For the invariant Mixup, we mix the invariant subgraphs, further encouraging to capture invariant patterns behind graphs while getting rid of spurious correlations for OOD generalization. We demonstrate that the proposed environment Mixup and invariant Mixup can mutually promote each other. Extensive experiments on both synthetic and real-world datasets demonstrate that our method significantly outperforms state-of-the-art under various distribution shifts.