paperlist.ai

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

D2ACE: Multi-Label Batch Selection Guided by Dual Dynamics and Adaptive Correlation Enhancement

Bin Liu, Haoyu Peng, Zhijia Wei, Jiajing Zhang, Grigorios Tsoumakas

Batch selection is crucial for improving both training efficiency and predictive performance in deep multi-label classification (MLC). Existing batch selection methods typically rely on a single metric to assess instance importance and use static label weights to distinguish label significance, neglecting the dynamic evolution of metric utility and label significance during training. In addition, the method that explicitly exploits label correlations is largely affected by abundant irrelevant labels and insensitive to local label distributions. To address these issues, we propose D2ACE, a novel multi-label batch selection method guided by Dual Dynamics and Adaptive Correlation Enhancement. D2ACE explicitly captures metric and label-level training dynamics by combining stage-wise Bernoulli mixture sampling, which balances uncertainty and noise-resistant hardness, with dynamic label weighting to recalibrate label priorities at each epoch based on current metric statistics. Furthermore, D2ACE introduces a local context-aware correlation enhancement to focus on relevant labels with instance-adaptive dependencies. Extensive experiments on tabular and image benchmarks demonstrate that D2ACE outperforms existing batch selection approaches across various deep MLC models, achieving stronger predictive performance and more efficient correlation modeling.

IJCAI 2026

Parameterized and Streaming Algorithms for Euclidean Fair k-Center Clustering

Zeyu Lin, Chaoqi Jia, Longkun Guo, Chao Chen

Motivated by the growing importance of fairness in machine learning, fair k-center clustering has attracted considerable research attention as a fundamental problem. In this problem, a dataset is partitioned into m disjoint groups, and the objective is to select k data points as centers, subject to upper bounds on the number of centers chosen from each group, aiming to minimize the maximum distance between any data point and its assigned center. Focusing on Euclidean spaces, which are ubiquitous in machine learning applications, we first develop a parameterized approximation algorithm for Euclidean fair k-center with an approximation ratio of 2.732. By incorporating this algorithm as a post-processing stage into a one-pass streaming framework for large-scale data, we obtain an approximation ratio of 4.464. These ratios can be further respectively improved to 2.414 and 3.828 with a runtime exponential on k. To ensure polynomial-time complexity, we further design a one-pass streaming algorithm with an approximation ratio of 4.732, which can be further improved to 4.42, outperforming the state-of-the-art ratio. Finally, extensive experiments show that our methods significantly outperform state-of-the-art approaches in terms of clustering accuracy.

IJCAI 2026

ConDyGNet: Constraint-Guided Dynamic Graph Networks for Multivariate Time Series Forecasting

Zhenzhou Li, Xiang Li, Zhibin Niu

Modeling inter-channel dependencies is important for multivariate time series forecasting (MTSF). However, in many cases, inter-channel dependencies are time-varying and subject to noise interference, making it difficult for models to find a balance between structural stability and temporal adaptivity. Existing methods either use a single global static structure, resulting in insufficient sensitivity to temporal changes, or use local statistical correlations to construct dependencies, but local correlations are prone to introducing noise, which may further amplify the impact of noise during propagation. To address these issues, we propose a Constraint-Guided Dynamic Graph Network (ConDyGNet), whose core idea is "global basis, dynamic weights". Specifically, ConDyGNet learns a low-rank global basis as a shared structural constraint and generates patch-wise basis mixing weights to construct dynamic propagation graphs. This maintains topological consistency while allowing local adaptation and reducing the influence of local noise. We conducted extensive experiments on eight public benchmark datasets and multiple forecasting horizons, demonstrating that ConDyGNet can learn more robust time-varying inter-channel dependencies and achieve state-of-the-art forecasting accuracy. The code is available at https://github.com/constli67/ConDyGNet.

IJCAI 2026

SMLDR: Spectral Memory Learner with Dual-Retrieval for Time Series Forecasting

Zhenxin Li, Longquan Liao, Wenchang Zhang, Jiaying Zhang, Kaiwen Wei, Jiang Zhong, Linjiang Zheng

Time series forecasting aims to predict future values using historical observations, which is crucial for many practical applications with complex temporal dynamics. Recent frequency-domain forecasting methods have utilized spectral representations to model periodicity, but they usually rely on an implicit assumption: periodic components and aperiodic residuals are orthogonal in the frequency domain. However, in practice, this assumption often does not hold due to issues such as spectral leakage, superposition of multiple periods, and the gradual periodic changes. This paper re-examines frequency-domain modeling from the perspective of spectral non-identifiability and proposes a Spectral Memory Learner with Dual Retrieval (SMLDR) for time series forecasting. Instead of modeling periodicity in the frequency dimension, SMLDR represents periodic components as reusable spectral prototypes stored in learnable memory. The dual retrieval mechanism extracts historical periodic components and predicts them in the frequency domain, while a lightweight time-domain branch is used to model aperiodic dynamics to predict future residuals.Extensive experiments on multiple time series forecasting benchmarks show that SMLDR consistently achieves excellent performance, and the learnable memory can capture complex periodicity.

IJCAI 2026

Beyond Uniform Updates: Drift Pattern Aware Online Time Series Forecasting Under Delayed Feedback

Xingwang Li, Fei Teng, Cong Zhou, Qiang Duan

Online time series forecasting relies on continual updates to cope with concept drift. In multi-step forecasting, however, the ground truth for an H-step prediction arrives only after H steps, so a delayed residual entangles persistent drifts with transient shocks and seasonal fluctuations. Existing methods typically apply a uniform update rule to all delayed errors, which can overreact to noise and under-adapt to real drift. We view delayed residuals as compressed observations of latent drift over the horizon, and propose PADRE, a drift evidence driven framework that converts each delayed feedback event into a context-sensitive adaptation decision. PADRE builds a Tri-View drift representation from (i) the current input context, (ii) recent delayed-residual trajectories, and (iii) retrieved typical types of drift, and quantifies their agreement via a geometric consistency measure. To exploit recurring drift structure, PADRE mines an offline Pattern Bank of regime-conditioned residual prototypes and retrieves a soft pattern prompt online. A lightweight prompt guided policy outputs a continuous update gate that scales the backbone’s gradient step, enabling decisive updates under coherent evidence and conservative updates otherwise. Experiments on five real-world benchmarks and three backbones demonstrate consistent gains under delayed feedback, reducing MSE by 6%–15% relative to recent baselines and improving update stability across horizons.

IJCAI 2026

M-LoRA: Efficient Serving for Concurrent LoRA Adapters with Memory-Aware Speculative Scheduler on Single GPU

Shaolong Li, Xiang Yang, Qi Qi, Haifeng Sun, Zirui Zhuang, Bo He, Wanyi Ning, Jingyu Wang

Low-Rank Adaptation (LoRA) is a popular approach that enables large language models (LLMs) to quickly adapt to domain-specific tasks by adding lightweight trainable adapters. Existing multi-LoRA serving systems typically exploit parameter sharing to serve hundreds of LoRA models with a single base model. However, most systems rely on first-come-first-serve (FCFS) scheduling, which can incur severe queuing delay and lead to excessive adapter memory usage, squeezing KV cache space and reducing concurrency and throughput. To address these challenges, we propose M-LoRA, a memory-aware multi-LoRA serving system that reduces queuing delay and improves throughput through efficient request scheduling guided by fine-grained memory modeling. M-LoRA consists of three components: (1) Multi-LoRA Length Predictor, which estimates the output length and KV-cache demand of each request; (2) Memory-aware Speculative Scheduler, which dispatches requests based on predicted KV-cache and adapter memory requirements to maximize throughput under a fixed GPU memory budget; and (3) Recovery Mechanism, which corrects mispredictions while preserving generation quality. Compared to state-of-the-art LoRA serving systems, M-LoRA reduces average per-token latency by 87% and improves throughput by up to 1.7x.

IJCAI 2026

Environment-Aware Multiscale Geometric Interaction for Equivariant Molecular Spectral Prediction

Haoran Li, Weiran Cui, Minghui Li

Predicting molecular spectra requires modeling 3D conformation and solvent modulation. However, E(3)-equivariant networks based on local message passing exhibit limited sensitivity to long-range geometric dependencies, affecting the discrimination of globally distinct conformers. We introduce the Multiscale Geometric Interaction Layer (MGIL), which integrates global context by augmenting local features with centroid-referenced anchors, geometric moments, and virtual nodes. This design explicitly encodes global anisotropy while maintaining equivariance. Furthermore, we propose a Solvent Field Modulator (SFM) to encode solvent topology for conditional feature adaptation. Experiments demonstrate that MGIL enhances the capture of global structural variations, yielding consistent performance gains across spectral prediction benchmarks while maintaining linear computational efficiency.

IJCAI 2026

Reducing Bias and Variance: Generative Semantic Guidance and Bi-Layer Ensemble for Image Clustering

Feijiang Li, Zhenxiong Li, Jieting Wang, Zizheng Jiu, Saixiong Liu, Liang Du

Image clustering aims to partition unlabeled image datasets into distinct groups. A core aspect of this task is constructing and leveraging prior knowledge to guide the clustering process. Recent approaches introduce semantic descriptions as prior information, most of which typically relying on matching-based techniques with predefined vocabularies. However, the limited matching space restricts their adaptability to downstream clustering tasks. Moreover, these methods primarily focus on reducing bias to improve performance, frequently overlooking the importance of variance reduction. To address these limitations, we propose GSEC (Image Clustering based on Generative Semantic Guidance and Bi-Layer Ensemble), a framework designed to reduce bias through generative semantic guidance and mitigate variance via ensemble learning. Our method employs Multimodal Large Language Models to generate semantic descriptions and derive image embeddings via weighted averaging. Additionally, a bi-layer ensemble strategy integrates cross-modal information through BatchEnsemble in the inner layer and aligns outputs via an alignment mechanism in the outer layer. Comparative experiments demonstrate that GSEC outperforms 20 state-of-the-art methods across six benchmark datasets, while further analysis confirms its effectiveness in simultaneously reducing both bias and variance.

IJCAI 2026

DASFL: Dynamic Adaptive Split Federated Learning for Heterogeneous Clients

Aijing Li, Yawen Li, Guanhua Ye, DanDan Liu, Tong Zhao, Zeli Guan

Split Federated Learning (SFL) has emerged as a pivotal paradigm for privacy-preserving distributed training on resource-constrained edge devices by partitioning neural networks between clients and a server. A critical design choice in SFL is the split layer, which determines the computation distribution and the semantic level of smashed data, directly impacting communication overhead, training latency, and model accuracy. Existing SFL methods largely ignore the time-varying nature of edge resources, relying on static resource profiles that lead to suboptimal efficiency and compromise model convergence. In this paper, we propose Dynamic Adaptive Split Federated Learning (DASFL), a unified framework that jointly addresses dynamic resource heterogeneity and non-IID data distributions. We employ a resource-aware dynamic split layer selection strategy that enables each client to minimize per-round latency by adapting to instantaneous local conditions. We also design an adaptive masked aggregation that robustly synchronizes client updates under split-induced structural heterogeneity. Extensive experiments on multiple benchmark models and datasets, conducted under heterogeneous, time-varying resource conditions and non-IID data distributions, demonstrate that DASFL achieves a superior accuracy-efficiency trade-off and faster convergence compared to state-of-the-art SFL baselines.

IJCAI 2026

Action-Gradient Monte Carlo Tree Search for Non-Parametric Continuous (PO)MDPs

Idan Lev-Yehudi, Michael Novitsky, Moran Barenboim, Ron Benchetrit, Vadim Indelman

Online planning in continuous state, action, and observation spaces remains challenging for autonomous systems. While Monte Carlo Tree Search (MCTS) scales effectively via sampling, most continuous (PO)MDP solvers do not exploit gradient-based action optimization. We propose Action-Gradient MCTS (AGMCTS), a framework that combines global tree search with local gradient-based action refinement, while maintaining consistent value estimates. We provide three key theoretical contributions: (1) an action score gradient theorem for particle belief states; (2) the Multiple Importance Sampling (MIS) Tree that supports frequent action-branch updates by reusing prior samples without introducing estimator drift; and (3) tractable action score gradients for smooth generative models using the Area Formula. Empirical results demonstrate that AGMCTS outperforms state-of-the-art sample-based solvers in multiple challenging continuous MDP and POMDP benchmarks.

IJCAI 2026

On the Privacy-Preserving Capabilities of PAVE Specifications in Learnware

Hao-Yi Lei, Jin-Hui Wu, Zhi-Hao Tan, Zhi-Hua Zhou

The learnware paradigm supports model reuse by pairing each submitted model with a specification, a lightweight representation used by the learnware dock system to identify, match, and reuse models without accessing raw data. While specifications are essential for learnware identification, they are also data-dependent public artifacts and it is not clear whether they reveal private information. Recently, the Parameter Vector (PAVE) specification has been proposed and shown to be effective for learnwares, yet its privacy properties remain largely unexplored. In this paper, we provide the first theoretical privacy analysis for PAVE. Specifically, we first formalize two specification-induced risks in the learnware paradigm: the disclosure risk of the released specification and the amplification risk that the specification may strengthen attacks against the released model. Second, we characterize when compact PAVE releases admit intrinsic differential privacy (DP): under natural structural conditions of learnware docks, the compact PAVE specification satisfies an (ε, δ)-DP guarantee without explicit additive noise through a Gaussian-sketch view of stable parameter variations, and for regimes outside these conditions, we further provide DP-Stabilized-PAVE as a certified differentially private variant. Third, we show that the resulting DP guarantees control both disclosure risk and amplification risk, and we analyze the induced privacy--utility trade-off to guide effective learnware identification while preserving privacy.

IJCAI 2026

INSHAPE: Instance-Level Shapelets for Interpretable Time-Series Classification

Seongjun Lee, Seokhyun Lee, Changhee Lee

Discovering shapelets -- i.e., discriminative temporal patterns within time series -- has been widely studied to address the inherent complexity of time-series classification (TSC) and to make model decision-making processes more transparent. However, existing methods primarily focus on population-level shapelets optimized across the entire dataset, which leads to two fundamental limitations: (i) population-level patterns often misalign with instance-specific features, resulting in suboptimal performance and potentially misleading interpretations, and (ii) most methods treat shapelets as independent entities, overlooking important temporal dependencies and interactions among multiple patterns. To address these limitations, we propose INSHAPE, an interpretable TSC framework that discovers variable-length, discriminative temporal patterns specific to each time series. INSHAPE identifies these patterns as non-overlapping segments and models their temporal dependencies, thereby providing clear instance-level interpretations while achieving strong predictive performance. Furthermore, INSHAPE bridges local and global interpretability through a bottom-up approach, aggregating instance-level shapelets into prototypical (population-level) shapelets. Extensive experiments on 128 UCR and 30 UEA benchmark datasets show that INSHAPE consistently outperforms state-of-the-art shapelet-based methods while providing more intuitive and interpretable insights.

IJCAI 2026

Cost of Structural Learning Under Censored Feedback: A Threshold-Bandit Approach

Michael Ledford, William Regli

In many multi-agent applications, tasks yield rewards only when executed by a coalition meeting an unknown size threshold; otherwise, feedback is fully censored. This censorship creates an identifiability problem: agents cannot distinguish stochastic failure from insufficient coordination. We formalize this setting as the Threshold-Activated Cooperative Multi-Armed Bandit (TAC-MAB) and analyze it under both centralized and decentralized coordination. We show that a centralized algorithm (C-TAC) achieves cumulative regret O(log T), decomposed into a structural-search term that captures the cost of resolving feasibility under censored feedback and a statistical-monitoring term for value estimation. We then introduce D-TAC, a decentralized event-triggered protocol in which agents synchronize only when their structural beliefs change. Empirically, D-TAC achieves a 23x reduction in communication relative to the centralized baseline while preserving feasibility alignment under conservative belief fusion. These results characterize the coordination cost of learning under censored feedback and show that near-centralized communication efficiency is achievable without continuous synchronization.

IJCAI 2026

Proactive Federated Unlearning: Sensitivity-Guided Sparse Adaptation on Key Layers

Jinshan Lai, Fengchun Zhang, Yunyuan Wang, Dongfen Li, Yang Zhang, Xiong Li, Ruijin Wang

Driven by privacy regulations, federated unlearning (FU) aims to remove the influence of specific clients or samples from a trained federated model, approximating the behavior of retraining from scratch without the target data. However, existing FU methods are largely reactive: retraining-based solutions are accurate but prohibitively expensive, while parameter-based approaches are more efficient yet may cause irreversible knowledge damage and catastrophic forgetting. We introduce PFU-SKLA, a proactive FU framework that endows models with built-in forgettability. During pretraining, we perform Orthogonality-guided Representation Disentanglement (ORD) to learn a robust, disentangled feature space that reduces cross-client/class interference. Additionally, we use Dynamic Sensitivity-based Key Layer Identification (DS-KLI) to identify sensitive layers that hold target knowledge. During unlearning, we propose a sparse, lightweight adaptation strategy that precisely erases target knowledge by inserting sparse adapters into the identified critical layers while preserving non-target knowledge by freezing the backbone. Extensive experiments across multiple datasets and three standard unlearning settings show that PFU-SKLA consistently approaches retraining-from-scratch performance, while substantially reducing communication and computation costs compared to state-of-the-art (SOTA) FU methods.

IJCAI 2026

Self-Improving Autonomous Vehicles via Real-World Reinforcement Learning

Daehyeok Kwon, Seung-Woo Seo, Sang-Hyun Lee

End-to-end autonomous driving systems have demonstrated advantages over traditional modular systems. Despite this progress, these end-to-end systems still struggle to be deployed in real-world driving environments, as they inevitably encounter undertrained scenarios in which autonomous vehicles may take unsafe actions. Reinforcement Learning (RL) provides a theoretical framework for addressing this challenge by enabling autonomous vehicles to self-improve: continuously collecting additional scenarios and learning from them. However, training autonomous vehicles with RL is not straightforward in the real world. Collecting real-world driving data involves costly interactions with the environment, and significant human intervention is required both to prevent autonomous vehicles from entering unsafe states and to reset them for subsequent episodes. In this paper, we introduce a novel real-world RL algorithm that allows autonomous vehicles to collect informative scenarios and learn from them with minimal human intervention. Our algorithm considers the learning progress of autonomous vehicles to identify informative scenarios and abort episodes before they enter unsafe states. To evaluate our algorithm, we introduce challenging urban driving tasks that require autonomous vehicles to reset themselves to initial states. The experimental results show that our real-world RL algorithm outperforms baselines with much less human intervention.

IJCAI 2026

Vector-Quantized Discrete Latent Factors Meet Financial Priors: Dynamic Cross-Sectional Stock Ranking Prediction for Portfolio Construction

Namhyoung Kim, Jae Wook Song

Predicting cross-sectional stock returns is challenging due to low signal-to-noise ratios and evolving market regimes. Classical factor models offer interpretability but limited flexibility, while deep learning models achieve strong performance yet often underutilize financial priors. We address this gap with PRISM-VQ (PRior-Informed Stock Model with Vector Quantization), a dynamic factor framework that integrates expert prior factors, vector-quantized discrete latent factors learned from cross-sectional structure, and a structure-conditioned Mixture-of-Experts to generate time-varying factor loadings. Vector quantization acts as an information bottleneck that suppresses noise while capturing robust market structure, with discrete codes serving both as latent factors and as routing signals for temporal expert specialization. Experiments on CSI 300 and S&P 500 show consistent improvements in cross-sectional return prediction and portfolio performance over strong baselines while preserving interpretability. Our code is available at https://github.com/finxlab/PRISM-VQ.

IJCAI 2026

Label Enhancement via Cross-View Fusion and Mixed Graph Propagation

Mengjiao Kai, Chao Tan, Yanda Wang, Juanna Zhai, Kang Wu, Ningkang Peng, Yanhui Gu

Label Distribution Learning (LDL) effectively addresses label ambiguity by modeling the degree to which each label describes an instance. A key challenge in LDL is Label Enhancement (LE): recovering label distributions from logical labels. Existing LE methods typically treat logical labels as supervisory signals and learn a direct mapping from features to label distributions. However, they fail to fully exploit the rich information encoded in logical labels, limiting their performance. We propose CVMG (Cross-View Fusion and Mixed Graph-based Label Enhancement), a novel approach that addresses this limitation through two key innovations. First, we employ a cross-attention mechanism to integrate logical labels and features, leveraging their complementary information to generate enriched feature representations. Second, we construct a mixed dependency graph that captures both instance-level relationships from enhanced features and category-level dependencies from logical labels. Label distributions are then recovered through propagation over this graph. Extensive experiments on 13 real-world datasets demonstrate that CVMG significantly outperforms state-of-the-art methods, validating the effectiveness of our approach.

IJCAI 2026

Meta-Cognitive Resonance Label Correction for Instance-Dependent Noise

Gaoxia Jiang, Jie Su, Senyu Hou, Jia Zhang, Wenjian Wang

Training with instance-dependent label noise poses a critical challenge in deep learning, severely impeding model generalization. Existing methods often struggle to break the vicious cycle where corrupted labels degrade feature representations, which in turn impairs noise identification. To overcome this, we propose the Meta-Cognitive Resonance Label Correction (MecReC) framework. For feature representation, MecReC structurally decouples representation learning from label correction, leveraging a pre-trained model as a frozen anchor to ensure feature robustness. For label correction, we introduce a novel meta-cognitive resonance mechanism that aggregates multiple complementary signals to comprehensively assess label reliability. These collaborative signals are fed to a lightweight meta-weight network, which automatically learns whether and how to correct each label. Furthermore, our personalized confidence thresholding strategy guarantees a tighter error bound for label purification. Extensive experiments demonstrate that MecReC consistently outperforms SOTA methods, exhibiting superior robustness particularly under extreme noise conditions. Code and additional details are available at https://github.com/JieSu272/MecReC.

IJCAI 2026

Content-style Disentanglement Guided Representation Learning for Deep Incomplete Multi-view Clustering

Enze Ji, Meng Liu, Yuzhe Li, Zhikui Chen

Deep incomplete multi-view clustering methods can mine patterns of incomplete multi-view data without labels, gaining great attention in various domains. However, current methods are obsessed with aligning view-specific representations from available samples with complete views to learn view-invariant information for missing data recovery, ignoring fruitful view-complementary information beneficial to data imputations. Meanwhile, such the view-invariant learning often leads to the problem of dominant view dependency that models tend to over-rely on views with clear clustering structures and neglect weaker ones, causing a performance bottleneck. Therefore, a content-style disentanglement guided representation learning is proposed for the incomplete multi-view clustering (CSMVC). Specifically, CSMVC designs a view-specific dual-representation learning architecture that extracts view-invariant content representations and view-specific style representations from self-supervised reconstructions of each view with the guidance of the Hilbert schmidt independence criterion. Then, it performs a content-centered style-modulated representation imputation mechanism to infer missing data via fully utilizing inter-view complementary and consistent information. Meanwhile, it devises a cross-view consensus structure mining strategy to capture the clustering structure with intra-cluster compactness and inter-cluster separability from attention-based fusion representations that adaptively aggregate content representations and style representations of each view. Finally, comprehensive experiments show that CSMVC outperforms state-of-the-art methods.

IJCAI 2026

DAHGT-CCI: Dynamic Heterogeneous Graph Transformer for Spatial Transcriptomics Cell-Cell Interaction Inference

Weiliang Huo, Shuo Yu, Qingchen Zhang

Spatial transcriptomics has significantly advanced tissue biology and makes it possible to study the spatial interactions of cells in the microenvironment of complex tissues. However, accurately inferring intercellular communication from these data remains challenging due to the need to effectively integrate spatial topology with high-dimensional gene expression information. To address this challenge, we propose DAHGT-CCI, a novel method for inferring intercellular communication from spatial transcriptomics data. By fusing multimodal heterogeneous features to construct a unified node representation and introducing a meta-relation-aware dynamic attention mechanism, DAHGT-CCI can adaptively learn the weights of edges in the graph, thereby achieving superior precision and fine-grained inference of intercellular interactions. We evaluated the performance of DAHGT-CCI on six different spatial transcriptomics datasets. In these benchmarks, DAHGT-CCI outperformed existing graph-based learning methods and cell-cell communication inference models in terms of accuracy, AUROC, recall, and F1 score. These results demonstrate that DAHGT-CCI can more accurately reconstruct cell communication networks in complex tissue microenvironments, offering an indispensable computational tool for studying developmental processes, disease mechanisms, and potential therapeutic targets from a spatially resolved perspective.

Keep browsing

More papers from top AI conferences

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