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

HGOOD: Hypergraph-enhanced Graph Contrastive Learning for Graph Out-of-Distribution Detection

Xuanting Fan, Chenyu Wang, Yueyue Gao, Wei Ju, Yifan Wang

With the increasing application of graph learning advanced by deep learning, out-of-distribution (OOD) detection for graph-structured data has become an imperative challenge in the real world. Graph neural networks (GNNs) provide a promising solution for OOD detection. However, GNNs' core message-passing mechanism inherently relies on local neighborhood aggregation, and traditional graph structures only characterize pairwise node relations, failing to capture high-order associations and global patterns. Towards this end, in this paper, we propose a Hypergraph-enhanced graph contrastive learning framework for Graph Out-Of Distribution detection (termed HGOOD). Specifically, we construct two branches to mine graph semantics in a comprehensive manner. On the one hand, we employ a graph feature branch to encode neighborhood interactions via node-level and graph-level contrastive learning. On the other hand, we incorporate the hypergraph-global branch, which adaptively models graphs’ high-order global correlations. Building upon this, we introduce a cross-branch prototype contrast that aligns the captured graph patterns with their cross-branch clustering prototypes to enhance the semantic manifold of the in-distribution (ID) graph. Extensive experiments on benchmark datasets demonstrate that our HGOOD consistently outperforms prior methods. Our code is available at https://anonymous.4open.science/r/HGOOD-CFE2/.

IJCAI 2026

Rethinking Convolutional Networks for Attribute-Aware Sequential Recommendation

Shereen Elsayed, Ngoc Son Le, Ahmed Rashed, Lars Schmidt-Thieme

Attribute-aware sequential recommendation entails predicting the next item a user will interact with based on a chronologically ordered history of past interactions, enriched with item attributes. Existing methods typically leverage self-attention mechanisms to aggregate the entire sequence into a unified representation used for next-item prediction. While effective, these models often suffer from high computational complexity and memory consumption, limiting their ability to process long user histories. This constraint restricts the model's capacity to fully capture long-term user preferences. In some scenarios, modeling item interactions purely through attention may also not be the most effective approach to extract sequential patterns. In this work, we propose ConvRec, an alternative method with linear computational and memory complexity that employs convolutional layers in a hierarchical, down-scaled fashion to generate compact, yet expressive sequence representations. To further enhance the model's ability to capture diverse sequential patterns, each layer aggregates the neighboring items gradually to reach a comprehensive sequence representation. Extensive experiments on four real-world datasets demonstrate that our approach outperforms state-of-the-art sequential recommendation models, highlighting the potential of convolution-based architectures for efficient and effective sequence modeling in recommendation systems. Our implementation code and datasets are available at https://github.com/ismll-research/ConvRec.

IJCAI 2026

DiffVec: Diffusion Model for Trajectory Vector Recovery

Jiaqi Duan, Shengwei Tian, Long Yu, Xiangfu Meng, Ya Zhang

The increasing availability of trajectory data is often hampered by sparsity and noise. Existing trajectory recovery methods are further limited by either information loss from coordinate discretization into location IDs, or the inefficiency of conventional diffusion models that require a lengthy denoising process from pure noise. To address these challenges, we propose DiffVec, a novel and efficient diffusion framework for free-space trajectory recovery that operates directly on continuous coordinate data. The backbone of our framework is MVformer, a Transformer-based architecture that models motion vectors—the differences between consecutive coordinates—to better capture the local motion patterns of movement. This model is trained within our ResTraj diffusion paradigm, which commences the denoising process from a structured, interpolated prior to significantly reduce sampling steps. Extensive experiments on the Geolife and Porto datasets demonstrate that DiffVec significantly outperforms state-of-the-art baselines across MAE, MSE, and NDTW.

IJCAI 2026

Breaking the Reasoning Horizon in Entity Alignment Foundation Models

Yuanning Cui, Zequn Sun, Wei Hu, Kexuan Xin, Zhangjie Fu

Entity alignment (EA) is critical for knowledge graph (KG) fusion. Existing EA models lack transferability and are incapable of aligning unseen KGs without retraining. While using graph foundation models (GFMs) offer a solution, we find that directly adapting GFMs to EA remains largely ineffective. This stems from a critical "reasoning horizon gap": unlike link prediction in GFMs, EA necessitates capturing long-range dependencies across sparse and heterogeneous KG structures. To address this challenge, we propose a EA foundation model driven by a parallel encoding strategy. We utilize seed EA pairs as local anchors to guide the information flow, initializing and encoding two parallel streams simultaneously. This facilitates anchor-conditioned message passing and significantly shortens the inference trajectory by leveraging local structural proximity instead of global search. Additionally, we incorporate a merged relation graph to model global dependencies and a learnable interaction module for precise matching. Extensive experiments verify the effectiveness of our framework, highlighting its strong generalizability to unseen KGs.

IJCAI 2026

Sentiment-aware Rating-based Recommendation via Semantic-enhanced Item Alignment

Yingjie Chen, Xiang Li, Dongliang Chen, Guoqing Chao, Zhongying Zhao, Yanwei Yu

Leveraging review texts to mine deep user preferences is vital for recommendation. However, existing methods neglect the positive-negative counteraction and rely on noisy hard sentiment thresholds. Furthermore, the feature density asymmetry causes dense semantic features to overwhelm sparse collaborative signals. To address these issues, we propose the SENSE model for fine-grained sentiment-aware and structurally aligned recommendation. We employ a confidence-aware soft sentiment assignment and a sentiment exchange mechanism to quantify fine-grained preferences and explicitly model sentiment interaction. For feature fusion, we construct a collaborative-semantic graph and incorporate adaptive data augmentation. Finally, via anchor-guided cross-view alignment, we use the reliable behavior view as a topological anchor to force semantic alignment, thereby preserving semantic richness while preventing collaborative signals from being overwhelmed. Through experiments on four datasets, we verify that SENSE outperforms state-of-the-art methods. It achieves average improvements of 19.26% in MSE for rating prediction, 13.41% in Recall@10 and 13.89% in NDCG@10 for Top-N recommendation. Our source code is available at https://github.com/yingjie160/SENSE.

IJCAI 2026

Bridging Feature-structural Homophily and Long-range Heterogeneity for Self-supervised Heterogeneous Graph Learning

Minda Chen, Yujie Mo, Junkai Huang, Guoqiu Wen, Xiaofeng Zhu

Self-supervised heterogeneous graph learning has achieved promising results in diverse applications but still faces two issues: (i) existing methods focus on either feature similarity or meta-path to capture homophily, neglecting their inherent complementarity; (ii) existing methods rely on meta-paths to capture interactions among same-type nodes, which may introduce noise and inherently exclude long-range cross-type interactions. To address these issues, we first propose a self-expressive solver that captures the complementary homophily between meta-paths and node features to obtain homophilous representations. Meanwhile, we design separate path encoders to model diverse interactions, thus explicitly including cross-type interactions while mitigating noise via adaptive fusion. Theoretical analysis verifies that homophilous representations exhibit a high-order grouping effect to capture complementary homophily, while path encoders possess adaptive smoothness capabilities to filter noise. Extensive experiments on diverse datasets, including a large-scale dataset, demonstrate the superiority of the proposed method.

IJCAI 2026

An Information-theoretic Propagation Denoising and Fusion Framework for Fake News Detection

Mengyang Chen, Lingwei Wei, Wei Zhou, Songlin Hu

Incomplete propagation data significantly hinders robust fake news detection. Recent approaches leverage large language models to simulate missing user interactions via role-playing, thereby enriching propagation with synthetic signals. However, such propagation data is intrinsically unreliable, and directly fusing it can lead to biased representations, leading to limited detection performance. In this paper, we alleviate the unreliability of synthetic propagation from the mutual information perspective and propose a novel information-theoretic propagation denoising and fusion (InfoPDF) framework to learn effective representations from both real and synthetic propagation. Specifically, we first generate attribute-specific synthetic propagation using large language models. Then we model each synthetic propagation graph as a probabilistic latent distribution to guide reliability-aware adaptive fusion with real propagation. During training, we design a mutual information-based objective to learn compressed and task-sufficient propagation representations. It jointly suppresses noisy signals across attribute-specific synthetic propagation, maintains consistency between real and synthetic propagation representations, and ensures task sufficiency for fake news detection and attribute prediction. Experiments on three real-world datasets show that InfoPDF consistently achieves superior performance across various fake news detection tasks. Further analysis demonstrates that InfoPDF can estimate attribute-level reliabilities and learn more discriminative propagation representations.

IJCAI 2026

Dual-Channel Hybrid Graph Neural Network for Mobility Social Relationship Inference

Liangkun Chen, Xiang Li, Guiyuan Jiang, Zhongying Zhao, Junyu Dong, Yanwei Yu

Inferring latent social ties from large-scale spatiotemporal mobility traces is a foundational AI task with broad applicability. Existing hypergraph-based methods often model higher-order relations by treating hyperedges as static snapshots, thus failing to capture the temporal dynamics and co-evolution of user interactions. Meanwhile, many approaches still struggle to distinguish stable social gatherings from transient noisy co-occurrences. To address these challenges, we propose a novel Dual-Channel Hybrid Graph Neural Network (HyGNN) that jointly models temporal dynamics and high-order structural dependencies. The framework consists of two complementary components: (1) a temporal meeting graph channel that decomposes multi-user interactions into ordered snapshots and aligns trajectory evolution through message propagation, and (2) a gathering hypergraph channel that uses a structure-aware encoder with homogeneity-guided aggregation to filter noise in high-order co-occurrences. A mutual-information-aware fusion module integrates both views while preserving their distinct semantics. Extensive experiments across three real-world datasets show that HyGNN consistently outperforms state-of-the-art baselines in PRAUC and ROCAUC metrics, and robustly captures the nonlinear interplay between mobility and sociality. The code is available at https://github.com/KunLiangChen/HyGNN.

IJCAI 2026

AdaGeM: Adaptive Geometric Learning on Manifolds for Hyper-Relational Knowledge Graphs

Ke-Jia Chen, Yuzhe Hu, Yu Ni, Linfeng Liu

Hyper-relational Knowledge Graphs (HKGs) extend traditional knowledge graphs by introducing high-order dependencies, where auxiliary qualifiers provide detailed information. However, modeling such intricate topologies (e.g., mixtures of hierarchies, cycles, and chains) is challenging. Existing methods suffer from structural distortion due to reliance on a single geometric space and overlook dynamic semantics across entity roles. To address these issues, we propose AdaGeM (Adaptive Geometric Learning on Manifolds), an innovative space-adaptive framework that integrates geometric learning with a role-aware Transformer. First, we propose an adaptive geometric hypergraph encoder that projects entities into a product manifold and design a topology-aware gating mechanism to dynamically select optimal geometric spaces for each entity. Second, we develop a role-aware Transformer equipped with role-specific projections and micro-structural bias injection to refine embeddings by distinguishing entity semantics across different roles and focusing on valid n-ary interactions, respectively. Extensive experiments on benchmark datasets demonstrate that AdaGeM outperforms state-of-the-art baselines in entity/relation prediction tasks, with ablation studies validating the necessity of multi-manifold modeling for heterogeneous HKG structures.

IJCAI 2026

AnoMamba: Aligning Reconstruction with Time Series Anomaly Detection via Selective Global Dependency Modeling

Junqi Chen, Xu Tan, Jie Chen, Susanto Rahardja

Reconstruction-based frameworks are widely adopted in Time Series Anomaly Detection (TSAD), assuming that models reconstruct normal behavior well but yield larger errors on anomalies. However, in unsupervised TSAD, minimizing reconstruction loss alone often breaks this assumption. Models tend to overfit local patterns for trivial reconstruction and fail to capture the global dependencies that characterize normal behavior. Consequently, anomalies that violate global dependencies can also be reconstructed well, leading to a misalignment between reconstruction and detection. To address this challenge, we propose AnoMamba, a novel TSAD framework that aligns reconstruction with anomaly detection by enhancing global dependency modeling. Specifically, AnoMamba employs patch embedding to reduce local redundancy and introduces a Mamba variant with global step-size reweighting to select meaningful global dependencies. The reweighting process is guided by multi-scale long-tail priors, which adaptively balance global and local dependencies to mitigate overfitting in the unsupervised setting. Extensive experiments on both univariate and multivariate benchmarks demonstrate that AnoMamba consistently outperforms state-of-the-art methods in both accuracy and efficiency, while offering interpretability through its hidden attention map.

IJCAI 2026

Falsdo: Benchmarking Artifact-Controlled Multimodal Fake News Verification via Failure-Aligned Auditing

Bowen Chen, Jun Yin, Lele Cao, Zheyuan Zhan, Can Wang

Recent generative AI renders multimodal misinformation structurally harder to detect, making reliable detection dependent on semantic verification grounded in verifiable evidence. However, current benchmarks often fail to isolate true semantic checking from superficial shortcut exploitation. We introduce Falsdo, a diagnostic benchmark designed to make robustness and auditability identifiable. Constructed via a heterogeneous web-mining pipeline, Falsdo provides instruction-conditioned grounding and formalizes a counterfactual artifact-control protocol. This stress test reveals a critical failure: when low-level generation traces are equalized, detector performance degrades, indicating reliance on artifacts rather than robust verification. To enable reproducible diagnosis, we propose DREA, a failure-aligned evidence-auditing baseline. DREA specifies evidence acquisition with explicit noise control and implements constrained channel-wise auditing with reliability-aware late fusion. Experiments demonstrate that Falsdo reliably exposes shortcut dependence, while DREA improves instruction-level grounding (Joint-F1) and minimizes degradation under artifact-controlled settings.

IJCAI 2026

H²SCAN: Adaptive Time Series Representation Learning via Heterogeneous Hypergraph Structure-aware Contrasts

Biao Chen, Zijie Tang, Junhua Fang, Feng Lu, Lang Zhang, Pengpeng Zhao

Learning universal representations for time series is fundamental for diverse downstream tasks. However, current approaches largely rely on handcrafted data augmentations, which may distort intrinsic temporal dynamics and structural regularities. In addition, most static representation learning frameworks struggle to cope with the non-stationary nature of real-world time series. To address these issues, we propose Heterogeneous Hypergraph Structure-aware Contrastive Adaptive Network (H²SCAN), a novel augmentation-free framework that derives contrastive supervision directly from graph topology. Specifically, H²SCAN constructs a heterogeneous hypergraph with three node types to capture multi-scale temporal characteristics. Building upon this representation, a meta-adaptation network is introduced to dynamically reweight heterogeneous hyperedges, enabling the model to adapt to distribution shifts in real-time. Finally, a structure-aware contrastive learning objective is employed to align latent representation similarity with the intrinsic hypergraph topology. Experiments on multiple benchmarks and cloud Kafka cluster datasets demonstrate that H²SCAN outperforms existing methods by modeling high-order multi-domain dependencies and preserving the semantic integrity of time series data.

IJCAI 2026

Bridging the Semantic Gap: Leveraging LLMs for Hierarchical Interest Evolution in Sequential Recommendation

Yifan Cao, Rui Wu, Xiang Wang, Wei Peng, Wei Xu, Caihong Sun, Jian Zeng

Accurate user behavior modeling is fundamental to the prediction of click-through rates (CTR) in industrial recommendation systems and online advertising. Traditional discriminative models, which rely on isolated ID features, struggle to capture the evolving nature of user intents across multiple channels due to the inherent semantic gap. While Large Language Models (LLMs) offer rich semantic understanding to bridge this gap, their direct application faces two main challenges: modality misalignment between continuous semantic representations and discrete item IDs, and prohibitive computational costs that make them unsuitable for real-time inference. To address these issues, we propose the Hierarchical Semantic Interest Evolution Network (HSIEN), a novel generative-discriminative framework. HSIEN leverages an LLM to construct a Markovian state-space model that recursively captures and updates user interests from multi-channel behavior sequences. It then employs a Semantic Mixture-of-Experts (SMoE) strategy to aggregate multi-channel signals into hierarchical intent representations, which are encoded as compact dynamic semantic vectors for integration with downstream discriminative models. Extensive experiments on a public dataset and a large-scale industrial dataset demonstrate that HSIEN significantly alleviates modality misalignment and enhances CTR prediction performance through feature complementarity. This work provides a practical and efficient pathway for leveraging LLMs in large-scale recommendation scenarios.

IJCAI 2026

From Diversity to Uniformity: Cross-modal Time Series Modeling with Dependent Channel Grouping

Minjun Cao, Hao Miao, Wentao Zhang, Senzhang Wang

Emerging foundation models have spurred growing interest in task-unspecific time series modeling, which can accommodate data from diverse domains and support various tasks. However, most existing methods still suffer from poor adaptability and generalization across cross-domain time series with varying feature dimensionalities. This study achieves unified time series modeling to transcend task and data boundaries, inspired by the recent advances in visual foundation models. We propose a universal cross-modal Time series modeling method named TimeIG, featuring Tailored Temporal Imaging and Dependent Channel Grouping. Specifically, TimeIG adopts the novel dependent channel grouping method to project heterogeneous time series into hierarchical spaces to identify representative features and learn inter-dependencies across variables. Then, a tailored temporal imaging method is proposed to generate carefully hand-crafted images from time series, facilitating complementary temporal-spatial feature extraction. Finally, a dual-branch module is designed to simultaneously model the sequential and visual data, enabling cross-modal alignment via the proposed Cross-Modal Attention and Dynamic Weighted-Averaging. Extensive experiments on real-world cross-domain time series datasets show that TimeIG consistently outperforms existing SOTA methods. The code of TimeIG is publicly available at https://github.com/missCmj/TimeIG.

IJCAI 2026

Constraint-Data-Value-Maximization: Utilizing Data Attribution for Effective Data Pruning in Low-Data Environments

Danilo Brajovic, David A. Kreplin, Marco F. Huber

Attributing model behavior to training data is an evolving research field. A common benchmark is data removal, which involves eliminating data instances with either low or high values, then assessing a model's performance trained on the modified dataset. Many existing studies leverage Shapley-based data values for this task. In this paper, we demonstrate that these data values are not optimally suited for pruning low-value data when only a limited amount of data remains. To address this limitation, we introduce the Constraint-Data-Value-Maximization (CDVM) approach, which effectively utilizes data attributions for pruning in low-data scenarios. By casting pruning as a constrained optimization that both maximizes total influence and penalizes excessive per-test contributions, CDVM delivers robust performance when only a small fraction of the data is retained. On the OpenDataVal benchmark, CDVM shows strong performance and competitive runtime.

IJCAI 2026

Weight-Aware Branch-and-Bound for Weighted Maximum Satisfiability

JIALU ZHANG, Chu-Min Li, Sami Cherif, Shuolin Li

The Weighted Partial MaxSAT (WPMS) problem requires finding an assignment that satisfies all hard clauses while maximizing the total weight of satisfied soft clauses. From a computational perspective, WPMS is not merely an extension of the uniform-weight Partial MaxSAT (PMS); rather, it requires search strategies that actively exploit weight information to navigate the solution space. While state-of-the-art heuristic and SAT-based solvers have successfully integrated weight-aware mechanisms, Branch-and-Bound (BnB) solvers, notably WMaxCDCL, largely treat weight information passively during search and pruning. In this paper, we bridge this gap by introducing two novel weight-aware strategies into the BnB framework. Our methods integrate weight information directly into the preprocessing and lower-bound estimation. Experimental results demonstrate that these strategies significantly enhance the performance of WMaxCDCL, establishing a new state-of-the-art for exact WPMS solving.

IJCAI 2026

Safe Multi-Objective Linear Bandits with Hierarchical Preferences

Bo Xue, Mengxia He, Yilu Liu, Ji Cheng, Zhe Zhao, Qingfu Zhang

Multi-objective bandits with hierarchical preferences and safety constraints is central to many real-world decision-making tasks such as healthcare treatment planning and safe autonomous control, where multiple objectives must be optimized according to their priorities while ensuring safety requirements are satisfied. In this paper, we study a multi-objective stochastic linear bandit framework that incorporates hierarchical preferences together with safety constraints, requiring the learner to remain competitive with respect to a known baseline policy. We consider two practically motivated safety models: (i) cumulative constraints, which require the cumulative performance to exceed the baseline, and (ii) stage-wise constraints, which impose this requirement at each time step. We propose two algorithms, LexUCB-C and LexTS-S, designed for the cumulative and stage-wise settings, respectively. We establish regret bounds showing that both algorithms achieve performance comparable to existing single-objective safe linear bandit methods, while simultaneously optimizing multiple objectives. In addition to theoretical guarantees, we develop a carefully designed experimental framework that captures the interaction between hierarchical preferences and safety constraints. Experiments on synthetic and real-world datasets validate our theory and demonstrate the effectiveness of the proposed methods.

IJCAI 2026

gDMC: A Generic Distributed Model Counting Framework via Work-Stealing

Zhenghang Xu, Minghao Yin, Junping Zhou, Jean-Marie Lagniez

Propositional Model Counting (#SAT) is essential for probabilistic reasoning but faces scalability limits on single cores. Existing distributed approaches struggle with high initialization overheads (static decomposition) or rigid architecture. We propose a novel, generic framework for distributed exact model counting. Leveraging C++ templates, our architecture decouples parallel orchestration from solving logic, enabling state-of-the-art solvers to be parallelized with minimal modification. We implement an adaptive work-stealing strategy that ensures effective load balancing. Experiments on competition benchmarks show that our approach achieves near-linear scalability and significantly outperforms existing distributed solvers.

IJCAI 2026

StructureBench: A Unified Benchmark Suite for Multi-Scenario Structured Generation Tasks with On-Device Models

Xiaokun Xiong, Zhengjie Xu, Junyi Chen, Shihao Bai, Ruihao Gong, Xianglong Liu

Structured output generation is increasingly critical for real-world AI systems, particularly in on-device settings where small language models (0.5B–8B parameters) must produce machine-executable outputs under strict latency and privacy constraints. Although constrained decoding provides formal guarantees of structural validity without retraining, its effectiveness across different tasks, models, and constraint formalisms remains insufficiently understood. We introduce StructureBench, a comprehensive benchmark for structured generation on edge devices, covering JSON and tool-call generation, code synthesis, mathematics, science, and domain-specific languages, and evaluating over 11 on-device language and vision–language models spanning 0.5B–8B parameters. StructureBench systematically compares prompt-based generation with three widely used constrained decoding frameworks—Outlines, XGrammar, and Guidance—and adopts decoupled metrics to separately assess structural validity and semantic correctness. Our experiments show that constrained decoding consistently enforces syntactic validity, but does not reliably improve semantic accuracy and may even degrade performance for smaller models or complex grammars. These findings reveal clear task- and model-dependent boundaries for effective constrained decoding and highlight the need for scenario-aware adaptation in on-device structured generation. We release StructureBench at https://github.com/Str-Ben/StructureBench.

IJCAI 2026

Variable-Oriented Adaptive Singleton Consistency

Yaling Wu, Hongbo Li, Minghao Yin

Singleton consistency significantly reduces the search space of backtracking search for solving constraint satisfaction problems (CSP). However, it is too expensive to be used throughout the search, and it has not been successfully applied in solving general CSPs. In this paper, we propose a variable-oriented adaptive singleton consistency, namely VOASC, that could be applied in general-purpose constraint solvers. It calculates the filtering efficiency of local consistency enforced by the default propagation engine and the singleton-based consistency for each variable, and then selects an appropriate consistency to propagate the decisions of the variable in subsequent searches. We performed extensive experimentation with the MiniZinc benchmark suite. VOASC demonstrates superior solving performance on both CSP and COP, compared to the two candidate local consistencies and several existing adaptive propagation methods.

Keep browsing

More papers from top AI conferences

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