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.

UAI 2026

Label-Wise uncertainty decomposition for Multi-label Classification by Maximizing Type II Likelihood

Minghao Li, Junjie Qiu, Weishi Shi

Currently, the way deep learning models recognize uncertainty remains inconsistent with human perception. In multi-label classification, quantifying uncertainty at the label level presents challenges, as each label may exhibit distinct model confidence levels. Understanding and decomposing label-specific uncertainty is essential for interpreting model behavior and ensuring reliable predictions. We build a hierarchical Bayesian methodology for multi-label classification that leverages a Type II likelihood and Empirical Bayes. Then we estimate and decompose label-wise uncertainties by the bias-variance decomposition. Our approaches offer four main contributions: (1) Type II likelihood maximization is data likelihood centric; (2) it can decompose label-wise uncertainty into the model variance, the model bias and data noise; (3) our uncertainty represented by model bias is intuitively interpretable when combined with observational data; and (4) when applied to out-of-distribution (OOD) detection task, it achieves a 6.88

UAI 2026

CAIC: Congestion-Aware Intent Communication for Multi-Agent Reinforcement Learning

Pei Li, Yongkang Zhang, Zhonglin Lv, Jinmin Zhu, Jiangjin Yin

In multi-agent reinforcement learning, communication is essential for effective cooperation. Most existing methods assume instantaneous message delivery, and the few delay-aware studies consider only external fixed or stochastic delays, neglecting queueing delays caused by competition for a shared channel. We formulate the shared channel as a queueing system with state-dependent service rates, and propose Congestion-Aware Intent Communication (CAIC). To ensure message validity under delay, CAIC employs a temporal masked autoencoder to predict each agent’s future trajectory and encode it into a delay-robust intent message, with attention-based fusion integrating asynchronous messages at the receiver. To maintain timeliness, CAIC dynamically adjusts communication frequency based on intent message changes and delay estimates, proactively mitigating congestion. Experiments on Hallway, MPE, and SMAC demonstrate that CAIC outperforms existing baselines on most evaluated scenarios in both no-delay and queueing-delay settings, and ablation studies reveal that stale messages under delay can be even more harmful than no communication.

UAI 2026

A Sequence-Graph Fusion Framework via BiMamba and Fourier-KAN for Interpretable Drug-Target Affinity Prediction

Xibo Li, Lian Chen, Dingyuan Chen, Yichuan Zhao, Li Zhou, Dongxi Li

Accurate prediction of drug-target affinity (DTA) is crucial for accelerating drug discovery. Existing methods struggle to model global long-range dependencies of sequences at linear complexity, and multi-layer perceptrons relying on fixed activation functions in graph neural networks face limitations in fitting complex non-linear topologies. We propose SGFF-DTA, a sequence-graph fusion framework based on bidirectional Mamba (BiMamba) and Fourier-Kolmogorov-Arnold Networks (Fourier-KAN). The framework employs BiMamba to capture global contextual semantics of sequences at linear complexity through bidirectional selective state space scanning. It integrates Fourier-KAN into graph neural networks to model high-order topological interactions using learnable non-linear transformations in the spectral space. To achieve cross-modal semantic alignment, we introduce pre-trained feature transfer and a cross-gated fusion module. On three benchmark datasets, SGFF-DTA significantly outperforms state-of-the-art methods in terms of mean squared error, demonstrating robust generalization capabilities under cold-start settings. Visual analysis further confirms model interpretability in accurately locating key binding sites and pharmacophores.

UAI 2026

Online Fair Allocation with Demand-Side Time-Dependent Weight

Minming Li, Youzhi Zhang, Shangkun Zheng

We study the problem of allocating indivisible items to a group of agents as these items arrive over time. Our focus is on scenarios where the utility of the items is weighted based on the waiting time since the last item was received, which is a demand-side time-dependent utility model. To ensure fairness, we concentrate on two criteria: temporal envy-freeness (TEF) and temporal proportionality (TProp). These criteria require that the allocation remains fair after each item is allocated. When there are two agents, we demonstrate the sufficient and necessary conditions of the weight function that ensure the existence of a TEF1 or TProp1 allocation. Additionally, we provide two polynomial-time algorithms that output a TEF2 or TProp2 allocation, with some restrictions on the weight function. When there are more than two agents, we show the hardness of determining the existence of TEF1 allocations. We also provide polynomial algorithms returning TEF1/TProp1 allocations with some specific valuation profiles. When there are multiple items per round, we also provide a polynomial algorithm returning TEF1/TProp1 allocations.

UAI 2026

Leveraging Large Language Models for Causal Discovery: a Constraint-based, Argumentation-driven Approach

Zihao Li, Fabrizio Russo

Causal discovery seeks to uncover causal relations from data, typically represented as causal graphs, and is essential for predicting the effects of interventions. While expert knowledge is required to construct principled causal graphs, many statistical methods have been proposed to leverage observational data with varying formal guarantees. Causal Assumption-based Argumentation (ABA) is a framework that uses symbolic reasoning to ensure correspondence between input constraints and output graphs, while offering a principled way to combine data and expertise. We explore the use of large language models (LLMs) as imperfect experts, eliciting semantic structural constraints from variable names and descriptions and integrating them with statistical evidence through Causal ABA. We propose ABAPC-LLM as a principled and conservative approach to hybrid data- and LLM-driven causal discovery. Additionally, we introduce an evaluation protocol to mitigate memorisation bias when assessing LLMs for causal discovery and show competitive performance on novel semantically grounded random benchmarks, as well as on standard small- and medium-sized benchmarks.

UAI 2026

Matched-Pair Experimental Design with Active Learning

Weizhi Li, Gautam Dasarathy, Visar Berisha

Matched-pair experimental designs aim to detect treatment effects by pairing participants and comparing within-pair outcome differences. In many situations, the overall effect size across the entire population is small. Then, the focus naturally shifts to identifying and targeting high treatment-effect regions where the intervention is most effective. This paper proposes a matched-pair experimental design that sequentially and actively enrolls patients in high treatment-effect regions. Importantly, we frame the identification of the target region as a classification problem and propose an active learning framework tailored to matched-pair designs. Our design not only reduces the experimental cost of detecting treatment efficacy, but also ensures that the identified regions enclose the entire high-treatment-effect regions. Our theoretical analysis of the framework’s label complexity and experiments in practical scenarios demonstrate the efficiency and advantages of the approach.

UAI 2026

Nonlinear Axiomatic Attribution for Cooperative Games

Weida Li, Zhuanghua Liu, Yaoliang Yu, Bryan Kian Hsiang Low

The Shapley value is a widely used concept in attribution problems, as it uniquely satisfies the axioms of linearity, consistency, equal treatment, and efficiency. Often, the inclusion AUC metric is used to evaluate the quality of player rankings, in order to identify positively participating players. However, it can be established that the Shapley value is not always reliable for this purpose. The core issue lies in its linearity: the Shapley value acts as a linear operator with an excessively large null space, which is likely to contain non-negligible perturbations that remain indistinguishable to the operator. To address this limitation, we explore the design of nonlinear axiomatic attribution methods. Inspired by the least core, which is a popular nonlinear substitute for the Shapley value, we introduce a class of nonlinear attribution methods that retain the remaining necessary axioms. Each method yields a contribution vector that is the unique optimal solution to a minimization problem, which aims to approximate utility functions as faithfully as possible. In terms of the inclusion AUC metric, our experiments demonstrate the potential effectiveness of these methods compared to Shapley value variants that relax only the efficiency axiom.

UAI 2026

Differentially Private Approval-Based Committee Voting

Zhechen Li, Zimai Guo, Lirong Xia, Yongzhi Cao, Hanpin Wang

In this paper, we investigate tradeoffs among differential privacy (DP) and several representative axioms for approval-based committee voting, including justified representation, proportional justified representation, extended justified representation, Pareto efficiency, and Condorcet criterion. Without surprise, we demonstrate that all of these axioms are incompatible with DP, and thus establish both upper and lower bounds for their two-way tradeoffs with DP. Furthermore, we provide upper and lower bounds for three-way tradeoffs among DP and every pairwise combination of such axioms, revealing that although these axioms are compatible without DP, their optimal levels under DP cannot be simultaneously achieved. Our results quantify the effect of DP on the satisfaction and compatibility of the axioms in approval-based committee voting, which can provide insights for designing voting rules that possess both privacy and axiomatic properties.

UAI 2026

Computational Complexity of Repair Problems on Simple Temporal Networks with Uncertainty

Junkang Li, Frédéric Maris, Ajdin Sumic, Thierry Vidal, Bruno Zanuttini

Simple Temporal Networks with Uncertainty (STNUs) are a well-established formalism for reasoning about temporal plans involving uncontrollable durations, known as contingent links. This model enables checking the controllability of plans under different assumptions about when uncertainties are revealed (Weak, Dynamic, and Strong Controllability). Recent work has also introduced methods to repair uncontrollable STNUs by adjusting contingent bounds, which is relevant e.g., in multi-agent systems, or resource-aware settings where some external flexibility can be negotiated. Nevertheless, there remains a lack of formal understanding regarding the computational complexity of such repair problems. This paper fills that gap by formally defining the problems and assessing the complexity of a number of them. In particular, we show that for a number of settings, repair is no harder than controllability.

UAI 2026

Gaussian Approximation and Multiplier Bootstrap for Federated Linear Stochastic Approximation

Ilya Levin, Maksim Shuklin, Eric Moulines, Paul Mangold, Sergey Samsonov

In this paper, we establish Berry-Esseen-type bounds for federated linear stochastic approximation (LSA). Our results provide the first federated Gaussian approximations for LSA that explicitly capture communication-computation trade-offs and heterogeneity-aware error terms, quantifying the effects of local step size, number of local updates, and heterogeneity on convergence rates. We present results for both (i) constant step size regime and (ii) decreasing step size with an increasing number of local iterations, recovering the recent rates of Bonnerjee et al. [2026] as a special case. As a primary application of our results, we develop an online multiplier bootstrap procedure for inference on the last iterate, which avoids explicit estimation of the asymptotic covariance matrix, and obtain non-asymptotic validity guarantees for this procedure.

UAI 2026

Counting and Sampling Subsets Using Block Covers

Elias Lehtinen, Mikko Koivisto

We present a new data structure, *block cover*, for approximate weighted counting and sampling of subsets of a given query set. Such queries are the main computational bottleneck, e.g., in advanced Markov chain Monte Carlo algorithms for Bayesian learning of Bayesian networks. Given a collection of weighted subsets of a ground set N, our key idea is to select a few moderate-size subsets B of N, called blocks, so as to cover all or most of the input collection by the power sets 2^B. An approximate sum over the subsets of a query set Q is obtained by adding up the contributions within each block, which contibutions we precompute. We also give a similar, efficient algorithm for generating a subset of Q with probability proportional to its weight. Our empirical results suggest that block covers are superior to previous approaches, which consider the subsets of interest one by one.

UAI 2026

Diagnosing Conformal Prediction Failures Under Distribution Shift: A COVID-19 Case Study

Chorok Lee

Conformal prediction provides distribution-free coverage guarantees, but these degrade under distribution shift—and practitioners lack tools to anticipate which deployed models will fail before observing test data. We propose SHapley Additive exPlanations (SHAP) concentration—the fraction of feature importance concentrated in the top feature—as a pre-deployment diagnostic for conformal prediction vulnerability in gradient-boosted classifiers. Using COVID-19 as a naturalistic case study, eight supply chain tasks experience identical temporal shift yet coverage drops ranging from negligible to catastrophic. Feature-importance concentration is strongly associated with failure severity across 16 multiclass tasks in 9 domains, while standard distributional shift detectors detect shift uniformly across tasks but cannot distinguish catastrophic from robust outcomes. External validation across 9 non-supply-chain datasets shows partial transfer. We prove a formal theorem showing that Adaptive Prediction Sets conformity-score bounds worsen monotonically with concentration under explicit assumptions, verified empirically. The diagnostic identifies concentrated-dependence failures characteristic of gradient-boosted models but does not detect global-sensitivity failures observed in neural networks. A decision framework operationalizes the diagnostic as an exploratory pre-deployment rule with an uncertainty band around a concentration threshold.

UAI 2026

Preserving Compositionality for Robust Multi-Subject Personalization in Text-to-Image Generation

Sangho Lee, Eugene Baek, Suho Ryu, Dongsoo Shin, Joonseok Lee

Personalized text-to-image generation faces a fundamental trade-off between learning new concepts and preserving existing knowledge, and balancing these two goals gets particularly more challenging with multiple subjects to be personalized. Existing methods have relieved this by providing additional layout constraints, but it substantially undermines flexibility of the generation process. To address this issue, we propose a teacher–student architecture equipped with explicit regularizers to mitigate this trade-off. Specifically, we regulate the internal representations and cross-attention maps not to significantly deviate from the original foundation model, balanced with the reconstruction objective to internalize new concepts. Through extensive experiments, we demonstrate that our method enables reliable layout-free multi-subject generation, achieving the state-of-the-art performance on both single- and multi-concept personalization.

UAI 2026

FraudGNAM: Inherently Interpretable Spectral GNN for Graph Fraud Detection

Suan Lee, Jinho Kim

Graph neural networks for fraud detection face a fundamental tension: spectral methods that capture heterophilic patterns sacrifice interpretability, while interpretable models lack the spectral capacity to detect sophisticated fraud. We introduce FraudGNAM (Fraud Graph Neural Additive Model), the first inherently interpretable spectral GNN with learnable multi-scale filters that resolves this tension. FraudGNAM decomposes the fraud score into individually auditable components—per-feature contributions via neural additive models, pairwise feature interactions, multi-scale spectral band responses via learnable polynomial filters, and explicit feature-spectrum interactions—all combined through a transparent scalar-sum architecture. Each component’s contribution to the final prediction is independently quantifiable, unlike post-hoc explanation methods that approximate black-box decisions. On seven GADBench datasets spanning homophily ratios from 0.60 to 0.98, FraudGNAM achieves state-of-the-art AUROC on five of seven datasets against SEC-GFD, the strongest black-box baseline, while winning 14 of 21 metric-dataset comparisons overall. An adaptive configuration mechanism selects spectral order, high-pass filter count, and contrastive regularization based on measurable graph properties, eliminating per-dataset hyperparameter search.

UAI 2026

Interpretable Spatial-Temporal Forecasting via Additive Neural Decomposition and Knowledge Distillation

Suan Lee, Jinho Kim

We challenge the prevailing assumption that interpretability requires sacrificing accuracy in spatial-temporal forecasting. We propose STGNAM (Spatial-Temporal Graph Neural Additive Model), which enforces a strict additive decomposition: 𝐲̂ = f_node + f_temporal + f_spatial + f_interact + bias, where each component is independently evaluable and visualizable. Our central finding is that the additive inductive bias acts as an implicit regularizer: on PEMS-BAY, STGNAM *sets a new state of the art* (MAE 1.62), surpassing all black-box models including TITAN (1.69) and its own D2STGNN teacher (1.87)—even without knowledge distillation (KD). When combined with KD from a black-box teacher, STGNAM achieves 91–104

UAI 2026

Nonlocal Bayesian Modeling of Continuous Spatio-Temporal Dynamics

Jaeyeong Lee, Heeyoung Kim

Real-world spatio-temporal forecasting must handle irregular time points, spatially sparse observations, and the need for uncertainty quantification. This setting is often further compounded by nonlocal interactions (long-range spatial coupling). Modeling continuous-space, continuous-time nonlocal dynamics naturally leads to infinite-dimensional integro-differential equations (IDEs), making principled Bayesian inference intractable. We propose the NonLocal Bayesian Spatio-Temporal model (NLBST), a hierarchical Bayesian framework for continuous spatio-temporal fields that learns explicit nonlocal coupling while retaining tractable inference. NLBST represents the latent field via a coordinate-based spatial basis expansion and models the coefficient process with a continuous-time ODE whose learnable linear operator corresponds to a Galerkin reduction of a nonlocal IDE; a Neural ODE residual captures additional nonlinear dynamics. A linear-Gaussian observation model enables Kalman-style sequential updates under missing and irregular observations, while the spatial basis representation enables inductive prediction at unmeasured locations without retraining. Global parameters are learned via variational inference, and uncertainty is handled through a Bayesian hierarchy. Experiments on synthetic and real-world datasets demonstrate strong forecasting and spatial generalization with well-calibrated uncertainty, yielding substantial gains over baselines in strongly nonlocal and partially observed regimes.

UAI 2026

High-Order Markov Blanket Discovery via a k-Order Relaxation of the Faithfulness Assumption

Loong Kuan Lee, Ragavi Krishnamoorthy, Nico Piatkowski

The problem of learning the graphical Markov blanket (MB) of a variable from data has applications in many areas such as structure learning for Bayesian networks and Markov random fields, causal discovery, and feature selection. However, a common assumption most methods make is that the conditional independencies in the distribution imply the same separation in the graphical structure—also known as the faithfulness assumption. Unfortunately, this assumption can be violated by higher-order dependencies such as XOR and parity-type relations, and—on finite samples—by empirical violations that, in extreme cases, even induce spurious dependencies absent from the true distribution. Therefore, in this paper we propose a “k-order” relaxation of the faithfulness assumption that captures parity type relationships between k+2 variables. We then propose a proof of concept algorithm called k-order Markov blanket (kOMB) that uses this relaxation for MB discovery. Finally, we empirically show how kOMB can recover the MB of a variable under both true and empirical violations of faithfulness. Code available at: https://github.com/lklee9/k-order-Markov-blanket.

UAI 2026

Provably Correct k-Means Clustering of Persistence Diagrams

Hajin Lee, Kwangho Kim

We study k-means clustering of persistence diagrams through their Hilbert-space embeddings, focusing primarily on persistence landscapes. Although persistence landscapes are widely used in practice, it remains unclear when clustering them faithfully reflects clustering in the diagram space. We give simple, verifiable geometric conditions under which (i) nearest-center labels in the landscape space exactly agree with those in the diagram space, and (ii) the landscape k-means objective provably calibrates the diagram-space objective, leveraging tools from modern statistical learning theory. Combined with known fast rates for k-means in Hilbert spaces, our results show that landscape-based k-means provides a statistically and computationally efficient surrogate for diagram-space k-means with explicit performance guarantees and a controllable geometric distortion.

UAI 2026

Efficient Confidence Set Enumeration for Multi-label Conformal Classification

Arthur Ledaguenel, Florent Capelli, Jean-Marie Lagniez

Conformal prediction is a distribution-free and model agnostic framework that can provide statistical guarantees to machine learning algorithms: a point-wise predictor is transformed into a conformal predictor that outputs sets of predictions which include the ground truth with a user defined confidence rate. In multi-label conformal classification however, the exponential growth of the output space makes confidence sets prohibitively complex to compute in the general case. In this paper, we analyze this challenge under the prism of enumeration complexity. We detail a general approach for confidence set enumeration based on the flashlight method, prove a sufficient condition for efficient enumeration and apply this method on three types of problems. First, we give an enumeration algorithm with linear delay for modular non-conformity losses. Then, we discuss informed conformal classification where a boolean circuit specifies a set of valid label combinations and prove a sufficient condition for efficient enumeration based on standard properties of the circuit. Moreover, we leverage our results on informed conformal classification to tackle label interactions in the loss. Finally, we illustrate the benefits of our approach with a few experiments.

UAI 2026

Task-Free Continual Learning via Order-Invariant Linearized Adaptation and Density-Guided Adapter Routing

Hang Thi-Thuy Le, Nam-Quan Nguyen, Lam-Huy Nguyen, Dien Dinh, Minh Hoang, Trong Nghia Hoang

Task-free continual learning (TFCL) aims to adapt models to non-stationary data streams without knowing task boundaries. In TFCL, catastrophic forgetting arises from both the evolving data distributions and the order-sensitive nature of batch-streaming optimization. To address these challenges, we propose a new TFCL framework that mitigates optimization-induced forgetting via order-invariant linearized adaptation during learning and accommodates evolving data distributions via density-guided adapter routing for more accurate and effective adapter retrieval during inference. We also provide a theoretical characterization of retrieval error in terms of density estimation quality and cross-adapter embedding separability. Experiments across multiple benchmarks demonstrate that our proposed method consistently achieves higher accuracy and lower forgetting than strong TFCL baselines under both standard and realistic streaming settings. For reproducibility, our experimental code is available at: https://github.com/Alisia0303/HESTIA.git .

Keep browsing

More papers from top AI conferences

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