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

Efficient Optimization of Fixed-Length Paths

Martino Ciaperoni, Nikolaos Tziavelis, Panagiotis Karras

Optimization problems such as Viterbi decoding and V-optimal histogram construction seek a path of exact length L through a state space that minimizes a cost function. These problems are traditionally solved using dynamic programming (DP). A best-first-search (BFS) solution is also applicable, yet requires maintaining a priority queue. In all cases, memory usage grows linearly with both state space size and path length. In this paper, we propose CompactBFS, a framework that limits the growth of the BFS priority queue to space-efficiently determine the exact optimal cost for a fixed-length path and then constructs such a path by a divide-and-conquer strategy that eliminates the memory overhead. We apply CompactBFS to Viterbi decoding, which remains relevant to speech recognition, and V-optimal histogram construction. Our experimental results demonstrate significant gains over state-of-the-art solutions in runtime and memory consumption.

IJCAI 2026

Scalable Algorithms for Approximate DNF Model Counting

Paul Burkhardt, David G. Harris, Kevin T. Schmitt

Model counting of Disjunctive Normal Form (DNF) formulas is a critical problem in applications such as probabilistic inference and network reliability. For example, it is often used for query evaluation in probabilistic databases. Due to the computational intractability of exact DNF counting, there has been a line of research into a variety of approximation algorithms. We develop a new Monte Carlo approach with an adaptive stopping rule and short-circuit formula evaluation. We prove it achieves Probably Approximately Correct (PAC) learning bounds and has asymptotically improved time and randomness complexity compared to previous methods. We also show experimentally that it out-performs prior algorithms by at least three orders of magnitude in running time and scalability.

IJCAI 2026

EKFEdit: Extended Kalman Filter for Training-Free Flow-Based Image Editing

Chengfu Zou, Yaochen Li, Yi Han, Wenlong Zhou, Jia Shu

Despite recent advances in training-free text-guided image editing using pretrained rectified flow models, achieving a balance between text adherence and background preservation remains a challenge. Existing methods typically treat image editing as an open-loop trajectory generation task, adopting either an inversion-based or inversion-free paradigm. However, neither can perfectly achieve this goal. Specifically, inversion-based approaches accumulate inversion errors without feedback, whereas inversion-free methods exhibit unstable trajectories due to the lack of constraints. To address this, we propose EKFEdit, a novel framework that formulates image editing as a sequential state estimation problem in a nonlinear dynamic system, which models inversion-free editing trajectories as the system’s prior dynamics and leverages an Extended Kalman Filter to adaptively fuse observations from external editing algorithms. EKFEdit enables adaptive trajectory correction, effectively combining the complementary strengths of the different paradigms. We instantiate this framework into two concrete approaches (EKFEdit-RF and EKFEdit-DNA) via different observation methods, respectively. Extensive experiments demonstrate that our approaches achieve new state-of-the-art performance compared to previous methods. Code is available at https://github.com/baiyeweiguang/EKFEdit.

IJCAI 2026

Mitigating Backdoors via Decoy Shortcuts and Knowledge Decoupling

Zixuan Zhu, Rui Wang, Lihua Jing, Jinwen Zhong

Backdoor attacks pose a serious threat to deep neural networks, especially when training relies on third-party data, allowing adversaries to inject malicious behaviors through data poisoning. In this work, we reveal that backdoor behaviors tend to be absorbed by a simpler parallel branch when jointly trained with the main network. Motivated by this insight, we propose Trapping and Removing (TR), a simple yet effective training-time defense that introduces a lightweight shortcut branch as a “honeypot” to trap backdoor knowledge. After training, backdoors can be removed by discarding the shortcut, without requiring any additional data. To further enhance backdoor isolation while maintaining benign performance, we design a knowledge decoupling strategy with entropy-based weight assignment, encouraging poisoned samples to flow through the honeypot while guiding the main network to focus on benign learning. In addition, we introduce an automatic shortcut generation strategy to improve generalization across model architectures. Extensive experiments on four benchmark datasets and five model architectures demonstrate that our approach effectively mitigates a wide range of backdoor attacks while preserving performance on benign data. Code: github.com/Zixuan-Zhu/TR.

IJCAI 2026

Raise One and Infer Three: Toward Reasoning- and Memory-Augmented Diffusion Policy Generalization

Yihang Zhu, Yuxuan Wang, Tong Li, Jiexi Yan, Xu Yang, Cheng Deng

Diffusion policy has shown impressive performance in robotic manipulation tasks while struggling with out-of-distribution shifts and limited demonstrations. Recent advances primarily focus on improving geometric or perceptual representations for diffusion policy. However, these approaches rely heavily on instantaneous observations, making them vulnerable when visual inputs deviate from the training distribution. Our key insight is that robust generalization in diffusion policy requires both structured reasoning over skill compositions and an explicit memory mechanism for accumulating and reusing learned policy knowledge. To this end, we propose "raise one and infer three" diffusion policy (ROITDP), a novel approach that introduces two complementary mechanisms. First, we propose a reasoning mechanism built upon the Chain-of-Skill Noise Watermark, which encodes skill-level reasoning graph representations into the initial noise space, thereby enabling temporally coherent multi-step reasoning throughout the diffusion process under distribution shifts. We further introduce a memory mechanism in the form of a Self-evolving Policy Knowledge Bank that discretizes spatio-temporally refined trajectories into reusable skill primitives via a VQ-VAE architecture, providing adaptive memory to guide and refine action generation. Extensive experimental results on both simulated and real-world environments demonstrate the superiority and robustness of our method.

IJCAI 2026

Cross-Domain AI-Generated Image Quality Assessment via Content-Distortion Awareness

Shun Zhu, Xichen Yang, Dechun Zhao, Tianshu Wang, Yan Zhang, Tianyin Li, Xiaobo Shen

With the expanding use of artificial intelligence generated images (AGIs) in scenarios such as gaming, art, and film production, evaluating their quality is essential to ensure their practical utility. To guarantee effective quality measurement, both content and distortion must be considered. However, existing image quality assessment (IQA) methods fail to sufficiently combine the two aspects in their assessments. Meanwhile, the AGIs annotated with credible content and distortion labels are lack, thus, employing cross-domain methods to utilize typically public image datasets is meaningful. Based on the above conclusions, this paper proposed a cross-domain AI-generated IQA via content-distortion awareness (CDAQA). Firstly, the large language model has been utilized to obtain content and distortion expressions of images. Secondly, a dual-stream contrastive language-image pre-training module (DCLIP) has been designed to gain both quality-aware features in images and the corresponding expressions that related to content and distortion, respectively. Thirdly, a graph knowledge transferring module (GKT) that constructs graphs via inter-domain content relevance has been proposed. GKT can update distortion information in the source domain according to the target domain representations. Finally, the cross-domain framework has been designed to update the existing IQA model for AGIs. And, the contrastive loss of DCLIP, feature update loss of GKT, and quality prediction loss are coordinated to jointly update different modules, enabling sufficient fusion of target domain knowledge. Experimental results demonstrate that CDAQA achieves higher accuracy and stability in cross-domain AGIs tasks.

IJCAI 2026

Absorbing Gradient Conflicts: Modeling Semantic Variance via Kent Distributions for Cross-Modal Hashing

Hengjie Zhu, Dayan Wu, Zihao Zhang, Xinze Liu, Jingxuan Yu, Peng Fu, Zheng Lin, Weiping Wang

Supervised proxy-based deep cross-modal hashing has become the dominant paradigm for large-scale retrieval. However, prevalent methods model class proxies as deterministic points in the embedding space. This rigid assumption causes severe gradient conflicts in multi-label scenarios, where gradient conflicts arising from label co-occurrence lead to severe gradient contention and optimization collapse.To resolve this, we propose Kent-based Distributional Proxy Hashing (KDPH), a novel framework that shifts proxy representation from static points to flexible anisotropic Kent distributions on the hypersphere. Unlike point proxies that must shift their positions to accommodate conflicting gradients, KDPH absorbs these conflicts by dynamically adjusting its directional variance. This allows the proxy to maintain a stable semantic mean direction while stretching to cover diverse label correlations. Furthermore, to ensure stable training of these geometric parameters, we derive a tailored loss function incorporating the Cayley transform to enforce strict orthogonality. To the best of our knowledge, KDPH is the first framework to successfully introduce the Kent distributions into cross-modal hashing.Experiments on three benchmark datasets demonstrate that KDPH mitigates proxy collapse and chaotic oscillation, significantly outperforms state-of-the-art methods. Code is available at https://github.com/Senmo996/KDPH-official-code.

IJCAI 2026

A₃B₂: Adaptive Asymmetric Adapter for Alleviating Branch Bias in Vision-Language Image Classification with Few-Shot Learning

Yiyun Zhou, Zhonghua Jiang, WenKang Han, Kunxi Li, Mingjing Xu, Chang Yao, Jingyuan Chen

Efficient transfer learning methods for large-scale vision–language models (e.g., CLIP) enable strong few-shot transfer, yet existing adaptation methods follow a fixed fine-tuning paradigm that implicitly assumes a uniform importance of the image and text branches, which has not been systematically studied in image classification. Through extensive analysis, we reveal a Branch Bias issue in vision–language image classification: adapting the image encoder does not always improve performance under out-of-distribution settings. Motivated by this observation, we propose A₃B₂, an Adaptive Asymmetric Adapter that alleviates Branch Bias in few-shot learning. A₃B₂ introduces Uncertainty-Aware Adapter Dampening (UAAD), which automatically suppresses image-branch adaptation when prediction uncertainty is high, enabling soft and data-driven control without manual intervention. Architecturally, A₃B₂ adopts a lightweight asymmetric design inspired by mixture-of-experts with Load Balancing Regularization. Extensive experiments demonstrate that A₃B₂ consistently outperforms 11 competitive prompt- and adapter-based baselines.

IJCAI 2026

SeGO: Sensitivity-Aware Golden Optimization for Large-Scale VLM Quantization

Tianqi Zhao, Xinrui Cheng, Yang Su, Weiyi Lu, Zhaodong Zhang, Zhongjie Wang, Ruihan Hu

The deployment of Vision-Language Models (VLMs) faces memory and computational bottlenecks because of the massive parameters and intensive computations. While Post-Training Quantization (PTQ) can reduce these costs, existing methods often overlook the heterogeneity of multimodal input when applied to VLMs, leading to quantization accuracy degradation. In this paper, we categorize the Transformer linear layers into Expansion Space (responsible for feature expansion) and Projection Space (responsible for feature aggregation) and reveal a cross-modal structural sensitivity asymmetry in VLMs: The Expansion Space is more sensitive to quantization accuracy than the Projection Space in both LLM and ViT encoders. Based on this, we propose SeGO, a unified structural sensitivity-aware sparse optimization framework. First, it constructs search interval for scaling factors using channel-wise statistics of LLM and ViT weights to exclude invalid solutions. Then it applies scaling protection only to the sensitive Expansion Space while directly quantizing the robust Projection Space. Moreover, SeGO uses a Golden-Section Solver to speedup the search of optimal scaling factors. Experiments show that SeGO achieves the balance among model parameter amount, quantization accuracy and scaling factors' search efficiency on InternVL2 and LLaVA series. Under the W3/W4A16 configuration, SeGO improves the accuracy of 7B-26B models by 3.8%-17.3% and enhances calibration efficiency by dozens of times.

IJCAI 2026

D2MDM2: A Brain-Inspired Deep Network Based on DDM Decision-Making Mechanism for Remote Sensing Change Detection

Kang Zhao, Ye Zhang, Bin Wang, Jianchao Zeng

Remote sensing change detection (RSCD) aims to identify changed regions in bitemporal images. However, conventional one-step modeling suffers from performance degradation caused by imaging temporal differences (e.g., illumination disturbances, seasonal variations). To address this issue, we formulate the problem as an “adversarial attack and defense” paradigm. Then, instead of traditional adversarial training, we propose a brain-inspired deep network based on the drift diffusion model (DDM) decision-making mechanism for RSCD, which is rooted in cognitive neuroscience. By simulating brain decision processes, the network enhances model robustness significantly. Specifically, we design the multi-stage reasoning unit to simulate DDM’s iterative evidence generation, stochastic representation unit with reparameterization sampling to model stochastic diffusion in decision-making, decision aggregation unit to replicate DDM’s evidence accumulation, and loss-guided unit with multi-loss joint constraints to simulate directional drift. Experimental results verify the model’s superior performance on multiple datasets and their perturbed versions.

IJCAI 2026

SPACE: Structure-Preserving Cross-Modal Image Enhancement for Extreme Low-Light Conditions

Yue Zhang, Zhiliang Wu, Yuxuan Hou, Hehe Fan

Low-Light Image Enhancement (LLIE) remains challenging due to severe noise, color artifacts, and structural degradation in extreme low-light environments. Existing methods primarily rely on photometric cues and often fail to preserve geometric consistency, resulting in blurred edges and distorted textures. To address this limitation, we introduce LAMP, a large-scale dataset of Low-light Aligned Multimodal Pairs for LLIE. LAMP contains over 18k high-quality aligned pairs and consists of two complementary subsets. LAMP-Real is captured using LiDAR-based depth sensors under physically controlled illumination, while LAMP-Synthetic is generated through a physics-calibrated degradation pipeline. Both subsets provide precisely aligned RGB images, depth maps, and pixel-wise semantic annotations. Building upon LAMP, we propose SPACE, a Structure Preservation Aware Cross-modal Enhancement framework that explicitly leverages geometric priors. SPACE introduces a Depth-Adaptive HVI Transformation to decouple luminance and chrominance under depth guidance, effectively suppressing color-space noise. Furthermore, a Depth-Manifold Modulated Attention mechanism constrains feature interactions within a learned depth manifold, ensuring structural coherence during enhancement. Extensive experiments demonstrate that SPACE consistently outperforms state-of-the-art methods in visual quality and structural fidelity. The code and data are available at https://github.com/YueCheong/SPACE.

IJCAI 2026

CoDA: Co-adaptive Dual-path Alignment for Vision-Language Models

Yi Zhang, Rui Zhu, Channi Li, Xiaoxu Li, Zhanyu Ma, Jing-Hao Xue

Parameter-efficient adaptation methods, such as adapters and prompt learning, have become popular for transferring pre-trained vision-language models (VLMs) to downstream tasks. However, under limited supervision during adaptation, overly aggressive cross-modal alignment can distort the intrinsic structure of modality-specific representations, leading to degraded generalization. In this paper, we propose Co-adaptive Dual-path Alignment (CoDA), a new adaptation framework that explicitly disentangles and coordinates cross-modal semantic alignment and intra-modal structural consistency. In CoDA, we also propose a parent class labeling strategy that injects hierarchical semantic priors into textual prompts, further stabilizing alignment under limited supervision. Extensive experiments on eleven benchmark datasets show that CoDA outperforms state-of-the-art parameter-efficient methods, particularly under few-shot learning and distribution-shift scenarios. Our code is available at https://github.com/yizhang-ac/CoDA.

IJCAI 2026

GenID: A Generalizable Physical-Layer Device Identification Method for Out-of-Distribution Environments

Yawei Zhang, Lanting Fang, Di Yao, Kaiyu Feng, Shuliang Wang

Physical-layer device identification serves as a critical security mechanism for mitigating cyberattacks and enhancing network resilience. However, its deployment in modern full-duplex Ethernet networks faces two major challenges: (1) the presence of Out-of-Distribution (OOD) data caused by temporal distribution shift and diverse local transmitters, and (2) the difficulty of environment-agnostic device identification, where the unique features of target devices are often obscured in mixed signals. To address these challenges, we propose GenID, which consists of two core components. First, GenID constructs prototypes to emulate the full communication environment through a two stage process: offline and online. Based on the prototype context, it then introduces an invariant feature extraction method to disentangle mixed signals and improve generalization under OOD conditions.Extensive experiments demonstrate that GenID significantly outperforms state-of-the-art baselines, achieving an increase of at least 7.94\% in Macro-F1 score under OOD environments. Our code is available on https://github.com/zyw2004/GenID_IJCAI2026.

IJCAI 2026

Learning to Remove Coupled Rain and Mist from Single Degradation Priors

Yan Zhang, Yuxin Feng, Zhe Huang, Fan Zhou, Zhuo Su

Existing image deraining models struggle to handle complex real-world scenarios with rain-mist coupled degradation. The core challenge stems from the high visual similarity and spatial coupling between rain streaks and mist, making it difficult to accurately model their joint degradation patterns. Consequently, both specialized deraining models and all-in-one models for multiple degradations are ineffective in rain-mist coexistence scenarios. To address these challenges, we propose a novel Rain-Mist Removal (RMR) framework. It effectively utilizes single degradation priors from existing deraining and dehazing datasets to model the joint degradation, thereby achieving effective rain streak removal while preserving background structures obscured by mist. To enhance the generalization to real-world scenarios, we leverage text prompts trained in the CLIP perceptual space to drive the generated results toward real samples. Extensive experiments demonstrate that the proposed RMR outperforms state-of-the-art methods in rain-mist coexistence scenarios.

IJCAI 2026

Uni-RS: A Spatially Faithful Unified Understanding and Generation Model for Remote Sensing

Weiyu Zhang, Yuan Hu, Yong Li, Yu Liu

Unified remote sensing multimodal models exhibit a pronounced spatial reversal curse: although they can accurately recognize and describe object locations in images, they often fail to faithfully execute the same spatial relations during text-to-image generation, where such relations constitute core semantic information in remote sensing. Motivated by this observation, we propose Uni-RS, the first unified multimodal model tailored for remote sensing, to explicitly address the spatial asymmetry between understanding and generation. Specifically, we first introduce explicit Spatial-Layout Planning to transform textual instructions into spatial layout plans, decoupling geometric planning from visual synthesis. We then impose Spatial-Aware Query Supervision to bias learnable queries toward spatial relations explicitly specified in the instruction. Finally, we develop Image–Caption Spatial Layout Variation to expose the model to systematic geometry-consistent spatial transformations. Extensive experiments across multiple benchmarks show that our approach substantially improves spatial faithfulness in text-to-image generation, while maintaining strong performance on multimodal understanding tasks like image captioning, visual grounding, and VQA tasks.

IJCAI 2026

Trajectory-Consistent Denoising Diffusion Codebook Models for Zero-Shot High-Fidelity Image Compression at Ultra-Low Bitrates

Fang Zhang, Linli Xu

Denoising Diffusion Codebook Models (DDCM) have emerged as a promising framework for zero-shot image compression by replacing stochastic sampling with discrete selection from a reproducible Gaussian codebook. By greedily picking noise vectors that best match the target image, DDCM encodes the generative trajectory into a compact sequence of indices for image compression. However, the target-guided noise selection provides only coarse guidance as the discrepancy between the denoiser's output and the target image is substantial. This discrepancy inevitably results in trajectory drift, necessitating massive codebooks to span the enlarged search space and extensive inference steps to gradually compensate for the deviation. In this paper, we propose the Trajectory-Consistent Diffusion Codebook Model (TC-DDCM) to address these inefficiencies. Rather than approximating the distant target, TC-DDCM navigates the generative process by strictly tracking a pre-computed inversion trajectory. This paradigm shift yields two critical advantages: 1) By minimizing the deviation to the proximal reference state along the trajectory, the search space is drastically shrunk, resulting in significantly smaller codebooks. 2) By aligning the generative steps with inversion methods, TC-DDCM achieves optimal reconstruction in a few inference steps. Extensive experiments demonstrate that TC-DDCM significantly outperforms state-of-the-art zero-shot methods in rate-distortion-perception performance at ultra-low bitrates, making zero-shot diffusion-based compression practical.

IJCAI 2026

PDD-RRG: Posterior Diagnostic Decision for Study-level Radiology Report Generation

Yang Yu, Yiming Ji, Bin Dai, Dong Zhang, Zhiyong Zhou, Shoushan Li, Yakang Dai

Automatic radiology report generation (RRG) aims to simulate the workflow of radiologists, assisting them in clinical diagnosis. However, existing methods often fall short in utilizing all information relevant to the examination, as is typically done in clinical practice. Although some works attempt to incorporate multi-view images and historical data, these additional inputs may sometimes lead to avoidable diagnostic errors on the contrary. To address these challenges, we introduce a decision-making stage after report generation for the first time and propose a Posterior Diagnostic Decision framework (PDD-RRG) to integrate potentially conflicting diagnoses. Specifically, we create various subsets of input data and utilize an existing RRG model to generate reports from different perspectives. Then the Bayesian posterior probability and the learned thresholds for each clinical observation are calculated to obtain an aggregated diagnostic conclusion, which is subsequently used to refine the generated report. Experiments on MIMIC-CXR demonstrate that our proposed PDD-RRG can effectively enhance the clinical efficacy of existing RRG models without any retraining.

IJCAI 2026

AC2-VLA: Action-Context-Aware Adaptive Computation in Vision-Language-Action Models for Efficient Robotic Manipulation

Wenda Yu, Tianshi Wang, Fengling Li, Jingjing Li, Lei Zhu

Vision-Language-Action (VLA) models have demonstrated strong performance in robotic manipulation, yet their closed-loop deployment is hindered by the high latency and compute cost of repeatedly running large vision-language backbones at every timestep. We observe that VLA inference exhibits structured redundancies across temporal, spatial, and depth dimensions, and that most existing efficiency methods ignore action context, despite its central role in embodied tasks. To address this gap, we propose Action-Context-aware Adaptive Computation for VLA models (AC2-VLA), a unified framework that conditions computation on current visual observations, language instructions, and previous action states. Based on this action-centric context, AC2-VLA adaptively performs cognition reuse across timesteps, token pruning, and selective execution of model components within a unified mechanism. To train the adaptive policy, we introduce an action-guided self-distillation scheme that preserves the behavior of the dense VLA policy while enabling structured sparsification that transfers across tasks and settings. Extensive experiments on robotic manipulation benchmarks show that AC2-VLA achieves up to a 1.79 X speedup while reducing FLOPs to 29.4% of the dense baseline, with comparable task success.

IJCAI 2026

Diverge to Converge: Mutual Heterogeneous Learning for Robust Pruning

Jinhui Yu, Zikai Zhang, Khaled A. Harras, Yidong Li

Neural network pruning is crucial for efficient deployment on resource-constrained devices, yet achieving high sparsity often leads to significant robustness degradation against adversarial perturbations and corruptions. Recent works typically rely on single-model fine-tuning along a fixed optimization trajectory, which renders the network susceptible to local optima and noise while failing to restore the multiple robustness properties compromised during compression. In this paper, we propose Mutual Heterogeneous Learning (MHL), a framework enabling robust pruning via single-model inference. MHL instantiates heterogeneity through two complementary mechanisms: layer-wise Lipschitz regularization for intermediate feature smoothness and adaptive margin objective for difficulty-aware boundary separation. To guide these diverse experts to converge, we employ entropy-based mutual distillation with a strategic schedule that shifts the optimization trajectory from exploring diverse feature subspaces to consolidating a unified robust model. Extensive experiments on 4 clean and corruption benchmarks and adversarial attacks demonstrate that MHL significantly outperforms single-model baselines in both adversarial robustness (+5%) and corruption robustness (+2.6%) while maintaining competitive clean accuracy.

IJCAI 2026

Information Entropy for LLM-generated Text Detection

Xiaoquan Yi, Haozhao Wang, Jingcai Guo

With the explosive growth of text generated by large language models (LLMs) on the internet, technologies for detecting LLM-generated text are increasingly important. However, existing technologies often require frequent access to LLMs during detection, significantly restricting their application in scenarios where only the text is accessible. To tackle this challenge, we identify that human-written texts exhibit higher entropy than LLM-generated texts. Motivated by this, we propose a novel method named IED, which leverages the Information Entropy for generative text Detection. Specifically, IED first transforms the given text into a vector of which each dimension represents the information entropy of each word, and then adopts a classifier to conduct the detection. Further, we propose IEGD which adopts the information gain to construct the vector by enhancing the differentiation between human-written and LLM-generated texts. To evaluate the effective of the proposed method, we construct a new large-scale dataset comprised of generated texts using various LLMs (LLaMA-7B, GPT-NeoX, etc.). Extensive experiments show that the proposed methods achieve improvement over state-of-the-art methods by up to 10.81%.

Keep browsing

More papers from top AI conferences

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