AI conference papers

AI conference paper library

Search papers from 30+ top conferences, including NeurIPS, ICLR, ICML, CVPR, ACL and AAAI. Filter by keyword, then open any paper for its abstract, authors and links.

IJCAI 2026

Contrastive Flow Matching for Sequential Recommendation

Wangyu Jin, Yang Xue, Wenwen Xia, Hongliang He, Guanfeng Liu, Pengpeng Zhao

Flow Matching (FM), as a highly promising generative paradigm, has recently been introduced into sequential recommendation. However, the lack of explicit inter-user supervision in existing FM-based method may lead to an averaged flow phenomenon, where the model tends to produce similar velocity directions for different users during item generation. This greatly undermines the model’s ability to generate personalized item. To address this issue, we propose a Contrastive Flow Matching (ConFM) for sequential reconmendation, aiming to inject inter-user separation signals so as to preserve the discriminability of users’ velocity directions. Specifically, considering the common design where velocities are derived from predicted item representations, we introduce a Representation Contrastive Regularizer in the representation space, which forces the predicted item embeddings of different users to be separated from each other. In addition, we introduce a Velocity Contrastive Regularizer in the induced velocity space, which directly encourages each user’s induced velocity to stay far from other users’ velocity targets, thereby better aligning the generation process with the user’s own interests. Extensive experiments on four datasets demonstrate that ConFM consistently outperforms strong baselines, and it also achieves notable improvements on long-tail items.

IJCAI 2026

Collateral Damage Constrained Backdoor Attacks on Graph Neural Networks

Di Jin, Zechuan Zhang, Bingdao Feng, Xiaobao Wang, Dongxiao He, Zhen Wang

Graph Neural Networks (GNNs) are vulnerable to backdoor attacks, where models behave normally on clean data but exhibit targeted misclassifications once specific triggers are activated. Existing backdoor attacks on GNNs mainly focus on enhancing trigger stealthiness or diversifying attack paradigms. However, these methods overlook a fundamental property of GNNs: trigger-induced malicious signals inevitably propagate through graph neighborhoods, causing unintended mispredictions on clean nodes, i.e., Collateral Damage. To address this issue, we propose the Collateral Damage Constrained Graph Backdoor Attack (CDCA), a novel framework that explicitly controls malicious diffusion. Specifically, the proposed method combines neighborhood-aware target node selection with a self-constrained trigger generation strategy to suppress trigger-induced propagation by enforcing prediction consistency on clean K-hop neighboring nodes. Extensive experiments on real-world datasets demonstrate that the proposed method remains effective while significantly reducing collateral damage.

IJCAI 2026

Learnable Data Augmentation and Contrastive Pre-training for Temporal Link Prediction

Canghong Jin, Jiafeng Zhao, Feng Xu, Tongya Zheng, Zemin Liu, Lina Wei, Mingli Song

Link prediction is a foundational task in temporal graphs. While temporal graph neural networks exhibit commendable performance, they are often criticized for providing inadequate representations, especially under limited data. Contrastive learning has been introduced as a solution for graph pre-training to mitigate data scarcity. However, the data augmentation techniques on which they depend frequently lead to suboptimal augmentations, manifesting either as over-augmentation or under-augmentation. In light of these challenges, we explore the under-explored domain of contrastive learning of temporal graph transformers and propose a novel model, ContraTGT, which employs a dual-view graph transformer. This transformer is fine-tuned to extract sequences tailored for specific target nodes, encapsulating both spatial and temporal perspectives. To optimize the contrastive learning of this dual-view transformer, we put forth an innovative, learnable data augmentation method. This technique, which involves selective masking of elements within dual-view sequences, generates superior augmentations, thereby amplifying the potency of the contrastive learning approach. Extensive experiments on five public temporal network datasets demonstrate that our model can consistently outperform all baselines, especially in small training set conditions.

IJCAI 2026

History Doesn’t Repeat, but Its Patterns Echo: A Parallel Pairwise Negative-Sampling Framework for Temporal Link Prediction

Yongchun Jiang, Heng Zhang, Jian Gao, Xin Zheng

Temporal link prediction with temporal graph neural networks (TGNNs) is increasingly used to model spatio-temporal dependencies in temporal graphs and to forecast future interactions among entities. Existing sampling-based training methods typically rely on random negative sampling and pointwise loss formulations, which often lead to suboptimal convergence and limited generalization due to low-quality negative samples. We propose ATNSF, a temporal graph learning framework with a hybrid negative sampling strategy that uses a portion of historical edges as hard negatives. For efficiency, we design an asynchronous parallel training pipeline for scalable optimization and introduce a pairwise sampled softmax loss that contrasts each positive instance with a batch of negatives to learn more discriminative representations. Finally, we theoretically show that jointly designing the loss function and negative sampling strategy is crucial for improving performance and generalization. Extensive experiments across six temporal graph datasets demonstrate that ATNSF improves the average AP from 0.724 to 0.827 (+0.103). Remarkably, it also accelerates training by 1.37× to 6.85×, achieving a 2.57× geometric mean speedup. The source code of this paper can be found at https://github.com/yongqiu-star/ATNSF.

IJCAI 2026

DELTA: Disentangled Hierarchical Interaction and Adaptive Adjustment for Emotion and Intent Understanding in Multimodal Conversations

Shenjie Jiang, Xiangfeng Liu, Xianghua Li, Xuecheng Wu

Emotion and intent joint understanding in multimodal conversations (MC-EIU) aims to infer emotion and intent information by leveraging the semantic dependencies among multimodal data. However, prior works largely ignore redundancy interference and suffer from insufficient interaction and inter-task noise propagation due to their reliance on shallow mechanisms. To overcome these limitations, we propose a novel framework named Disentangled Hierarchical Interaction and Adaptive Adjustment (DELTA) for MC-EIU. We first design a Disentangled Feature Denoising module based on orthogonal decomposition to effectively filter out noise and redundancy from heterogeneous data. Second, we propose a Dual-Level Adaptive Adjustment mechanism to dynamically optimize learning dynamics from both modality and instance perspectives. Furthermore, we introduce a Hierarchical Task-Bottleneck Interaction(HTBI) module, which employs a set of progressively compressed bottleneck tokens as a communication hub. This design can effectively simulating the multi-round iterative interaction between emotion and intent tasks. Experiments on the benchmark MC-EIU bilingual dataset demonstrate that our framework significantly outperforms state-of-the-art baselines in both emotion and intent tasks.

IJCAI 2026

LLM-Summarized Interest Distillation for Multimedia Recommendation

Meng Jian, Zhuoyang Xia, Haolun Fan, Lifang Wu

Recommendation system technology faces the fundamental challenge of data sparsity. Although incorporating auxiliary textual data works to enrich interactions, lengthy and unstructured item descriptions often fail to depict user interests, as they primarily describe item attributes. Furthermore, the sparse interactions provide incomplete interest patterns, leading to biased recommendations. To address these issues, this work proposes an LLM-summarized interest distillation (SID) model to enrich interactions by interest summarization and retrieval augmentation. Interest summarization leverages large language model to improve user interest descriptions and filters out interest-irrelevant details, generating compact, user-centric interest texts. Retrieval augmentation utilizes semantic neighbors as multiple teachers to adaptively transfer their multimodal collaborative knowledge to augment behaviorally sparse student users, thereby enriching interest learning for recommendation. It enhances interactions both qualitatively, through improved interest descriptions, and quantitatively, through expanded semantic neighbors. Extensive experiments show the superior performance of SID over the state-of-the-art models, demonstrating its effectiveness of interest summarization and retrieval augmentation to improve recommendations.

IJCAI 2026

HiCD: Hyperbolic Insight Through Decomposed Educational Graphs for Long-Tailed Cognitive Diagnosis

Shengwei Ji, Wenli Wang, Yongqiang Xie, Fei Liu, Yonghui Yang

Cognitive diagnosis (CD) aims to infer students' mastery of knowledge concepts from their response behaviors and constitutes a core component of intelligent education and personalized learning. However, existing graph-based CD models struggle to handle the pronounced long-tail distributions in educational data, where most students and concepts interact with only a limited number of exercises, resulting in suboptimal representation learning and poor generalization to low-frequency instances. To address this challenge, we propose HiCD (Hyperbolic insight for Cognitive Diagnosis), a novel hyperbolic model that embeds students, exercises, and concepts into non-Euclidean space. By exploiting the exponential representational capacity of hyperbolic geometry, HiCD naturally captures hierarchical and sparse structures, effectively alleviating long-tail bias while enhancing embedding expressiveness. A key contribution of HiCD is a hyperbolic diagnostic function that operates directly on the manifold, avoiding Euclidean approximations and preserving geometric consistency. Moreover, HiCD decomposes the educational graph into three semantically distinct subgraphs and assigns each a dedicated curvature, enabling adaptive geometric modeling of heterogeneous relations. Extensive experiments on multiple benchmark datasets demonstrate that HiCD consistently improves diagnostic accuracy and robustness, particularly under severe long-tail scenarios. The source code is available at: https://github.com/CyberXie/HiCD.

IJCAI 2026

MiniST: Unlocking Input Window Length in Traffic Flow Forecasting with Compact Parameters

Sheng Huang, Guanjun Wang, Jiaming Ma, Binwu Wang, Yang Wang

Spatiotemporal traffic forecasting currently faces dual challenges: capturing long-range periodic dependencies and managing the computational burden of increasingly complex deep neural network architectures. Mainstream models typically contain millions of parameters and struggle to handle long sequence historical data due to memory bottlenecks. To address these challenges, we present MiniST, a minimalist framework that decouples information content from sequence length by exploiting the intrinsic redundancy of traffic data. Instead of modeling dense point-wise dependencies, MiniST projects high-dimensional traffic history into a compact set of Orthogonal Basis Vectors, effectively distilling dominant traffic modes into a disentangled latent space. Furthermore, we introduce a Template-based Update Module (TUM), which models temporal dynamics by anchoring these latent bases to a set of learnable, time-invariant global templates. Extensive experiments on multiple large-scale datasets, including a network with over 50,000 nodes, demonstrate that MiniST achieves state-of-the-art performance in both short-term and long-term traffic forecasting, outperforming 22 benchmark models with improvements of up to 11.58%, while maintaining minimal parameter size and competitive efficiency.The source code is available at MiniST Repository.

IJCAI 2026

DeepSTE: Deep Spectral Temporal Embeddings for Dynamic Graph Representation Learning

Qiang Huang, Ke Liu, Renjie Gong, Sijing Zhang, Hao Wang, Shanshan Feng, Xiao Yan, Jiawei Jiang

Temporal embeddings play a crucial role in dynamic graph neural networks (DGNNs) by capturing the temporal dynamics of interactions. However, existing Random Fourier Feature (RFF)-based methods in DGNNs directly sample Fourier frequencies from a fixed, data-independent distribution, neglecting the temporal characteristics of dynamic graphs and thereby limiting representational capacity. We propose DeepSTE, a deep spectral temporal embedding framework for dynamic graphs. DeepSTE learns RFF representations via Monte Carlo importance sampling with a tractable proposal distribution (e.g., Gaussian) to approximate the feature map of a shift-invariant or positive-definite kernel whose latent spectral density is analytically intractable. DeepSTE adopts a data-dependent scale parameter, estimated from interaction intervals, to construct the frequency proposal distribution reflecting time–frequency uncertainty. The frequency DNN and the importance-weighting DNN, initialized from the proposal distribution, are jointly optimized to model the importance-sampled spectral representation and learn adaptive temporal features. Experiments demonstrate the effectiveness of DeepSTE on dynamic link prediction and node classification tasks, while also revealing insights such as temporal embedding decay and accelerated convergence.

IJCAI 2026

Tracking Topological Shifts: How Can Dynamic Graph Invariant Learning Enable Reliable Out-of-Time Spatio-Temporal Prediction?

Xinyan Hao, Huaiyu Wan, Shengnan Guo, Shaojiang Wang, Youfang Lin

Spatio-temporal graph networks form the foundation of modern traffic prediction, yet their deployment is fundamentally challenged by the pervasive reality of distribution shifts. While out-of-distribution (OOD) learning holds promise for robustness, existing methods rely on static graph structures, failing to capture the inherent topological dynamics of real-world traffic systems and thus limiting long-term deployment reliability. To bridge this gap, we propose DynaSTar, a Dynamic Spatio-Temporal Graph Invariant Learning model designed for reliable out-of-time (OOT) traffic prediction under evolving topologies. Our model employs a dynamic probabilistic graph structure, which is continuously refined through momentum-based updates and differentiable sparse sampling to model evolving inter-node dependencies. Besides, it utilizes node-level environment construction and modulated prediction to extract representations invariant to heterogeneous neighborhood fluctuations, enabling robust generalization. Comprehensive experiments on large-scale, long-term real-world datasets demonstrate that by effectively tracking evolving topological shifts, DynaSTar consistently outperforms state-of-the-art baselines across various OOT scenarios.

IJCAI 2026

HyperXRec: Unifying Preference Clusters and LLM Experts for Robust Explainable Recommendations

Xue Han, Zhiwen Luo, Zhixiang Li, Nizar Bouguila, Weifeng Su, Wentao Fan

Explainable recommendation is crucial for building user trust, yet producing natural-language rationales that faithfully reflect the underlying decision process remains challenging. Most LLM-based explainable recommenders incorporate collaborative signals through shallow prompting or lightweight adapters, which often yields generic explanations that are only loosely grounded in preference evidence, particularly when interactions are sparse. To address this gap, we propose HyperXRec, a novel framework that unifies preference modeling and explanation generation by integrating hyperspherical latent clustering with a cluster-guided mixture-of-experts (MoE) inside an LLM. Specifically, HyperXRec employs a dual-VAE with a von Mises-Fisher mixture prior to learn robust hyperspherical user/item embeddings, resulting in stable and semantically coherent clusters even under sparse interaction settings. These clusters are subsequently leveraged to guide fine-grained expert routing in the LLM, encouraging explanations that are both personalized and explicitly aligned with the learned preference structure. Experiments on multiple benchmarks demonstrate that HyperXRec consistently outperforms strong baselines in explanation fidelity, personalization, and robustness in cold-start scenarios.

IJCAI 2026

Towards Efficient and Effective Unimodal Trajectory Representation Learning: A Simple Yet Powerful Approach

Shaoxuan Gu, Xingyu Zhao, Dongliang Chen, Yuan Cao, Yanwei Yu

Trajectory representation learning transforms trajectory data into low-dimensional embeddings for downstream analytics. Although trajectory data inherently contains rich spatiotemporal information that remains to be more deeply explored, recent approaches have increasingly favored integrating external multimodal information rather than deeply mining internal trajectory patterns, resulting in the underutilization of the significant potential inherent in spatiotemporal features. To address these issues, we propose SimTRL, a novel unimodal framework specifically designed for road network-based trajectory data. Specifically, we design a bi-directional mamba-traj encoder that leverages the linear computational efficiency of State Space Models to capture global non-causal topological dependencies, overcoming the limitations of traditional causal models. Furthermore, we introduce a context-aware time encoder mechanism to explicitly model dynamic time embeddings. Extensive experiments conducted on two real-world datasets demonstrate that our model achieves average performance gains of 5.19%, 13.91%, 7.2%, and 2.69% across four tasks, respectively. Compared to multimodal models, our approach achieves an average improvement of 9.06% across all evaluation metrics, with a pre-training speedup of 11.2×. The source code of our model is available at https://github.com/sxgu1/SimTRL.

IJCAI 2026

TrajAR: Long-Term Trajectory Prediction at Urban Intersections via Multi-scale Interaction Perception

Letian Gong, Yan Lin, Xinyue Zhang, Yiwei Shuang, Guanyu Yao, Cheng Long, Shengnan Guo, Youfang Lin, Huaiyu Wan

Accurate trajectory prediction of multiple road users at urban intersections--including motorized and nonmotorized vehicles and pedestrians--is critical for cooperative vehicle-infrastructure systems and intelligent transportation systems. This study focuses on multiple road users' trajectory prediction in urban intersections. Such predictions face two key challenges: modeling interactions among multiple road users in complex scenarios and achieving accurate long-term prediction. Existing solutions inadequately incorporate these interactions and suffer from error accumulation or overall bias when performing long-term prediction. To overcome these challenges, we propose a long-term Trajectory prediction multi-scale AutoRegressive framework (TrajAR), which follows an encoder-decoder structure. The encoder dynamically perceives road users' motion trends, types, signals, and implicit interactions for effective handling of complex scenarios. The decoder employs a multi-scale prediction strategy that progressively refines the predicted trajectory from coarse to fine scales, where coarse-scale predictions establish long-term path backbones and finer scales enhance precision. These designs allow TrajAR to achieve accurate long-term prediction in real-world scenarios, demonstrated through experiments on four real-world urban datasets from different intersections. Our results show an average improvement of 23.8%. We provide the code of TrajAR at https://github.com/LetianGong/TrajAR.

IJCAI 2026

Can Edge Addition Be Safe and Effective? Adjacency-Centered Augmentation via Langevin and SDE Diffusion for Self-Supervised Graph Anomaly Detection

Haokai Gao, Menghua Jiang, Xuantao Yang, Jiale Liu, Yubin Li, Yuncheng Jiang

Edge addition is commonly considered risky in Graph Anomaly Detection (GAD), as random edge addition may induce anomaly–normal connectivity. Consequently, most existing augmentation strategies focus on feature perturbation, edge removal, or subgraph sampling, leaving edge addition largely unexplored. In contrast, we empirically find that moderate and targeted structural completion among normal nodes consistently improves GAD performance, revealing guided edge addition as an overlooked yet effective augmentation dimension. Motivated by this observation, we introduce two adjacency-centered edge generation strategies with complementary mechanisms. One performs a training-free structural completion scheme via spectrum-aware Langevin dynamics, enriching graph connectivity while preserving node features. The other models the joint evolution of node features and graph structure through a stochastic differential equation–based diffusion process, producing structurally coherent and anomaly-aware complementary graphs. Extensive experiments on 12 benchmark datasets with 7 state-of-the-art GAD models demonstrate consistent and substantial improvements in both AUROC and AUPRC. Code and appendices are available at https://github.com/GaoHaokai222/LangGen-JointSDE

IJCAI 2026

Modeling Dynamic Mixtures of Time-Delay Systems from Streaming Time Series

Ren Fujiwara, Yasuko Matsubara, Yasushi Sakurai

This research addresses the problem of adaptive modeling in time-series data streams with clear input-output relationships. This problem is challenging because rapid system changes (regime shifts) caused by environmental factors or input delay changes degrade model performance, and the trade-off among accuracy, robustness, and memory usage arises when using multiple small models for each time-series pattern. To address these issues, this paper presents an online framework/method that treats streaming time series as dynamic mixtures of time-delay systems. This framework maintains robustness of model tracking and reduces memory usage by summarizing past regimes using a fixed-length representation that captures both the system dynamics and input-output delays. Concretely, this approach constructs a summary system tensor using the system's Markov parameter series, capturing both dynamic behavior and delay characteristics. If necessary, a tensor decomposition algorithm extracts relevant past models from the tensor and helps select the system that best fits the current regime. This method enables rapid adaptation to environmental changes and is computationally efficient. Tests on real datasets show that DelayMix consistently outperforms other methods, achieving superior forecast accuracy and faster adaptation to delays, especially for highly non-stationary data.

IJCAI 2026

Keep Experts Diverse: A Task-Aware MoE for Multi-Task Traffic Analysis

Jiadong Fu, Jiang Fang, Jiyan Sun, Laile Xi, Shangyuan Zhuang, Liru Geng, Yinlong Liu, Zhiqiang Lv

Network traffic analysis is crucial for maintaining the security of networks. Yet deploying accurate models on edge nodes remains challenging due to protocol diversity, complex traffic behaviors, and stringent resource constraints. Although recent deep learning models achieve strong performance, their dense architectures incur high inference latency, making them unsuitable for edge deployments. Mixture-of-Experts offers a promising solution through conditional computation, yet existing methods overlook latent inter-task relations and suffer from severe expert load imbalance, leading to expert collapse and suboptimal efficiency. To address these limitations, we propose TAMoE, a novel Task-Aware Mixture-of-Experts framework for multi-task network traffic analysis. TAMoE integrates task semantics into both routing and representation learning through a novel Task-Aware Routing, enabling the router to dynamically select experts conditioned on both traffic features and task information. Besides, to train stably usable and scalable multi-task models, we further design a collaborative multi-task training strategy that encompasses both a dataset mixed construction and a joint training process. Experiments on six public benchmarks show that TAMoE achieves state-of-the-art results. Deployment on an NVIDIA® Jetson AGX Orin edge node demonstrates that TAMoE reduces inference latency by 60.6% compared to dense models and lowers the Gini Coefficient from 0.391 to 0.275 relative to Multi-Router MoE, achieving more balanced expert utilization.

IJCAI 2026

MGRec: Structure-Grounded Medication Recommendation via Condition-Aware Molecular Representation Learning

Jinke Feng, Wenjie Du

Medication recommendation plays a critical role in clinical decision-making by supporting personalized and safe treatment planning. Existing methods rely heavily on historical co-occurrence patterns and primarily optimize discrete prescription prediction objectives, limiting generalization in rare or emerging disease settings. We propose MGRec, a framework that shifts learning from discrete prescription prediction to condition-aware modeling in a continuous molecular representation space. MGRec treats molecular structure as the primary modeling target and employs a Therapeutic--Safety Factorized Conditional Variational Autoencoder to disentangle therapeutic and safety-related factors in a condition-aware molecular latent space. The model infers treatment-relevant molecular representations conditioned on current patient-specific clinical context, which are mapped to clinically approved medications for final recommendation. To improve clinical safety, we further introduce a DDI (drug-drug interaction)-guided latent regularization to integrate drug interaction knowledge at the representation level. Experiments on two real-world benchmarks demonstrate that MGRec achieves state-of-the-art accuracy and reduced interaction risk, particularly in data-sparse scenarios.

IJCAI 2026

Dual-Adversarial Dynamic Variational Asset Pricing with Adaptive Spatio-Temporal Feature Clustering for Portfolio Recommendation

Yupeng Fang, Ruirui Liu, Xinyu Xia, Huichou Huang, Johannes Ruf, Qingyao Wu

Asset pricing and portfolio recommendation are two closely related fundamental tasks in quantitative investment, for which machine learning methods have attracted significant attention in both academia and industry. In particular, nonlinear asset pricing models based on deep learning architectures that learn risk factors and risk exposures (betas) conditioned on high-dimensional asset characteristics have become widely used in the field. Despite their popularity, three challenges remain for portfolio recommendation: (i) their static risk pricing structure constrains predictive performance for expected returns; (ii) their representation learning is typically deterministic or fails to account for the inherent distributional uncertainty in the feature space arising from noisy returns and heterogeneous characteristics; and (iii) the sparse factor structure of asset returns and the diversity of characteristics make it difficult to identify incremental predictive information. To address these issues and bridge the gap to practical applications, we propose a novel multi-task dynamic factor model that jointly performs asset pricing and portfolio recommendation. Specifically, we introduce dual-adversarial trainers into the variational prior-posterior learning framework for Factor and Beta Networks, augmented with probabilistic equivariance regularization and dual adaptive spatio-temporal clustering. These components filter redundant information and enhance the model's ability to adapt to changing market conditions. Extensive experiments on a comprehensive open-source stock market dataset demonstrate that our model achieves strong and robust performance relative to baseline methods in the literature.

IJCAI 2026

UniSAGE: Unifying Static and Dynamic Attributes with Hyper-Structure

Taoran Fang, Yan Deng, Chunping Wang, Yang Wang, Lei Chen, Yang Yang

With the rapid growth of digital data, real-world applications increasingly involve hierarchical information that combines static attributes with dynamic records. Modeling such heterogeneous data in a unified and generalizable manner remains challenging. Existing approaches often rely on extensive manual design, are tightly coupled to specific data schemas, and typically process static and dynamic attributes in isolation, thereby overlooking their implicit interactions. We propose UniSAGE, a unified framework for modeling data with both static and dynamic attributes. UniSAGE constructs a global attribute graph that represents hierarchical and temporal relationships in a unified structure. To ensure representational consistency, it introduces two orthogonal parameter subspaces that jointly support static aggregation and dynamic reasoning within a shared semantic space. Building on these unified representations, UniSAGE further enables task-specific interaction between static and dynamic attributes via a lightweight hyper-structure mechanism. UniSAGE is fully automated, robust to evolving data schemas, and capable of capturing complex cross-attribute dependencies. Extensive experiments on multiple public benchmarks and a real-world financial behavior dataset demonstrate that UniSAGE consistently outperforms existing methods, achieving performance improvements of over 10% on several tasks. Our code is available at https://github.com/zjunet/UniSAGE.

IJCAI 2026

Invariant Graph Representations for Continuous-Time Dynamic Graphs Under Distribution Shifts

Lanting Fang, Yulian Yang, Yawei Zhang, Shanshan Feng, Kaiyu Feng, Hanning Yuan

Continuous-Time Dynamic Graphs (CTDGs) enable fine-grained modeling of evolving relational systems. However, most existing CTDG representation learning methods are tailored to in-distribution settings and exhibit limited robustness under out-of-distribution (OOD) shifts. Although recent causal approaches learn invariant representations via interventions, they are primarily designed for static or discrete-time graphs and become computationally prohibitive for CTDGs due to the combinatorial explosion of structural and temporal variations. To address these challenges, we propose CIR, a framework grounded in a novel structural causal model termed the ICCM. To avoid exhaustive interventions, we leverage the Normalized Weighted Geometric Mean (NWGM) to efficiently approximate interventional predictions. We further instantiate ICCM within a practical deep learning architecture that jointly captures invariant structural and temporal patterns through dedicated subgraph extractors, and maintains an environment memory bank to model distributional shifts across evolving contexts. Extensive experiments demonstrate that CIR consistently outperforms existing methods under diverse OOD scenarios.

Keep browsing

More papers from top AI conferences

30+ top conferences, by conference, year, and topic.