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

EpiRDN: A Learnable Anisotropic Reaction-Diffusion Network for Epidemic Time Series Prediction

Asela Hevapathige

Epidemic spread on graphs involves local infection dynamics and directional propagation through population movement. Current epidemic graph neural networks combine these aspects using a single symmetric aggregation operator, which limits the learning of their distinct timescales and fails to capture the asymmetry of real epidemic spread. This leads to node representations collapsing to a common state, losing diversity necessary for distinguishing infection stages. To address these issues, we propose EpiRDN, which discretizes the reaction-diffusion equation on graphs and learns its components end-to-end. EpiRDN features a local reaction network for region-level transitions and an anisotropic diffusion operator that utilizes asymmetric attention for directional infection flow. A feature-conditioned damping coefficient balances preserving local identity and neighborhood aggregation. We demonstrate that feature diversity in EpiRDN decays at most geometrically with depth, providing a significant advantage over existing methods. Experiments on four real-world datasets related to influenza and COVID-19 show consistent improvements, especially at longer forecasting horizons.

UAI 2026

Identifying Labeling Mechanism in Positive–Unlabeled Learning under Unknown Class Prior

Siying He, Weijuan Liang, Jiatong Liu

Positive–Unlabeled (PU) learning critically depends on assumptions about how positive instances are labeled, yet the labeling mechanism is typically unknown in practice. Misspecification of the labeling mechanism can therefore lead to systematic bias and unstable learning. We formulate labeling mechanism identification as a statistical inference problem under an unknown class prior using only positive and unlabeled data. We propose a two-stage testing framework that first constructs a family of empirical positive sets through false discovery rate (FDR)-controlled multiple testing at multiple FDR levels, and then performs bootstrap-based selected completely at random (SCAR) consistency tests on each empirical positive set, whose evidence is aggregated via a Bonferroni correction to produce a global decision.We establish that each empirical positive set admits provably controlled contamination, and further show that the Bonferroni-aggregated bootstrap test provides valid inference. Experiments on synthetic and real-world datasets demonstrate that the proposed framework reliably distinguishes SCAR from selected at random (SAR) mechanisms and improves the robustness of downstream PU learning.

UAI 2026

Identification and Bounding of Central Moments of Causal Effects Using Marginal Moments Information

Naoya Hashimoto, Yuta Kawakami, Jin Tian

Evaluating the causal effect of a treatment on an outcome is a central objective in causal inference. While the average causal effect summarizes the mean impact of treatment, the central moments of the individual causal effect (ICE) characterize the shape of the ICE distribution, thereby revealing the extent and structure of treatment effect heterogeneity across individuals. This paper investigates the identification and bounding of the central moments of the ICE using only the marginal central moments of each potential outcome (PO). Compared with existing approaches that require knowledge of the full marginal distributions of the POs, marginal moment information is often substantially easier to obtain in empirical applications. Finally, we illustrate the practical relevance of our results through two empirical case studies.

UAI 2026

Learning Max-Stable Representations that Extrapolate

Ali Hasan, Patrick Kendal Kuiper, Yuting Ng, Jose Blanchet, Vahid Tarokh

High-dimensional images and measurements may indicate extreme and rare behavior, such as advanced stages of cancer or material failure, and understanding these distributions is important for many disciplines. Classically, extreme value theory (EVT) provides a theoretical framework for extrapolating based on extremeness of magnitude of measurements and is used to model the tail of a distribution from limited observations. We propose a framework for learning representations from high dimensional observations that are amenable to analysis using classical EVT. Specifically, we propose extending the max-stability property of EVT to φ-stability, which generalizes the max operator to a more general operator φ that has practical applications in high dimensional cases. We base φ-stability on representation learning techniques such that the resulting representations lend themselves to analysis by EVT and can model high-dimensional observations of extreme characteristics. This enables our method to extrapolate to observations of extreme behavior in the observation domain. We then extend our method to infinite dimensional observations such as time series. Empirical results indicate the utility of using max-stability for representations to extrapolate beyond the training data.

UAI 2026

Learning Bayesian and Markov Networks with an Unreliable Oracle

Juha Harviainen, Pekka Parviainen, Vidya Sagar Sharma

We study constraint-based structure learning of Markov networks and Bayesian networks in the presence of an unreliable conditional independence oracle that makes at most a bounded number of errors. For Markov networks, we observe that a low maximum number of vertex-wise disjoint paths implies that the structure is uniquely identifiable even if the number of errors is (moderately) exponential in the number of vertices. For Bayesian networks, however, we prove that one cannot tolerate any errors to always identify the structure even when many commonly used graph parameters like treewidth are bounded. Finally, we give algorithms for structure learning when the structure is uniquely identifiable.

UAI 2026

Should You Use Your Large Language Model to Explore or Exploit?

Keegan Harris, Aleksandrs Slivkins

We evaluate the ability of the current generation of large language models (LLMs) to help a decision-making agent facing an exploration-exploitation tradeoff. While previous work has largely study the ability of LLMs to solve combined exploration-exploitation tasks, we take a more systematic approach and use LLMs to explore and exploit in silos in various (contextual) bandit tasks. We find that reasoning models show the most promise for solving exploitation tasks, although they are still too expensive or too slow to be used in many practical settings. Motivated by this, we study tool use and in-context summarization using non-reasoning models. We find that these mitigations may be used to substantially improve performance on medium-difficulty tasks, however even then, all LLMs we study perform worse than a simple linear regression, even in non-linear settings. On the other hand, we find that LLMs do help at exploring large action spaces with inherent semantics, by suggesting suitable candidates to explore.

UAI 2026

Robust Bayesian Decision Making under Adversarial Uncertainty

HARIPRIYA HARIKUMAR, Sammie Katt, Yasir Zubayr Barlas, Samuel Kaski

Scientific experiments are often designed to maximize information gain, yet in many applications the primary objective is to support reliable downstream decision-making. Existing decision-aware experimental design and active learning methods typically assume well-specified outcome models and implicitly rely on the stability of the optimal decision under real-world perturbations. In practice, however, experimental outcomes are frequently influenced by hidden or weakly modeled effects, which can substantially alter decision optimality and lead to misleading conclusions. We study sequential adversarially robust decision-aware experimental design, where data acquisition has to take into account information gain against plausible worst-case unexpected effects, modeled here as variation in adversarial variables. Building on Bayesian decision theory, we formalize an adversarially robust optimal decision under this setting and derive a principled Bayesian experimental design criterion. The criterion explicitly targets decision stability rather than nominal optimality. Experiments on synthetic and real-world scientific datasets show that conventional decision-aware design can converge rapidly to high confidence yet fragile decisions, while our robustness-aware approach yields decisions that are significantly more stable and reliable under adversarial variation.

UAI 2026

Provable Subspace Identification of Nonlinear Multi-view CCA

Zhiwei Han, Stefan Matthes, Hao Shen

We investigate the identifiability of nonlinear canonical correlation analysis (CCA) in a multi-view setup, in which each view is generated by applying an unknown nonlinear map to a linear mixture of shared latent variables plus view-private noise. Rather than pursuing exact unmixing, which is known to be ill-posed under general nonlinear mixing, we instead reframe multi-view CCA as a basis-invariant subspace identification problem. Under suitable latent priors and spectral separation conditions, we prove that the pairwise population CCA objective recovers correlated signal subspaces up to view-wise orthogonal ambiguity. For N ≥ 3 views, their multi-view aggregation provably isolates the jointly correlated subspaces shared across all views while eliminating view-private variation. We further establish finite-sample statistical consistency guarantees by translating the concentration of empirical cross-covariances into explicit subspace error bounds via spectral perturbation theory. Experiments on synthetic and rendered image datasets support our theoretical findings and illustrate the necessity of the assumed conditions.

UAI 2026

Scalable Model-Assisted Multi-Target Estimation in Large Image Collections

Max Hamilton, Jinlin Lai, Daniel Sheldon, Subhransu Maji

Computer vision models are increasingly used as measurement tools to estimate population-level quantities from large image collections, but prediction errors introduce bias and the resulting estimates lack statistical guarantees required in scientific applications. Prior work uses a Monte Carlo framework to combine model predictions with ground-truth annotations by sampling some images for humans to label and is able to provide unbiased estimates with controllable accuracy, but primarily addresses single-scalar estimation. We study the more general problem of multi-target estimation, where many quantities (e.g., class counts or proportions) must be estimated simultaneously, and adapt sampling and estimation strategies from survey sampling to this setting. Evaluations on five detection and segmentation datasets with 7–80 classes show that importance sampling excels with moderate annotation budgets or fewer targets, whereas uniform sampling with control variates is superior when estimating many targets or operating with minimal labels. Additionally, a subset-based ratio estimator remains highly competitive across all regimes. Ultimately, our framework effectively combines biased model predictions and limited human labels into rigorous scientific measurements.

UAI 2026

A Probabilistic Circuit Framework for Interpretable Graph PU Learning

Sagad Hamid, Dooho Lee, Myeong Kong, Tanya Braun, Jaemin Yoo

How can we make graph positive-unlabeled (PU) learning interpretable? Existing methods jointly process node features and edge information, which obscures their interaction and makes predictions difficult to interpret. In this paper, we propose a novel interpretable graph PU learning framework that explicitly decouples feature and edge processing, enabling multi-level interpretability. Our framework first produces a core prediction from node features using probabilistic circuits (PCs) and then refines it using edge information, providing graph-level interpretability by exposing how graph structure affects predictions. For feature-based prediction, we construct two PCs through a careful split of the training nodes, yielding node-level interpretability by highlighting which nodes support the separation of positive and negative instances. Finally, by leveraging the tractability of PCs, we obtain feature-level interpretability via feature attribute marginalization, which quantifies attribute impact and importance while revealing interactions and dependencies. Experiments on 10 datasets show that our framework achieves strong performance while substantially improving interpretability. The code is available at https://github.com/hagad1/graphpu-cpu.

UAI 2026

Reliable Conformal Prediction for Ordinal Classification Using the Ranked Probability Score

Stefan Haas, Luca Killmaier, Alireza Javanmardi, Eyke Hullermeier

Ordinal classification (OC) arises in high-stakes domains such as medicine and finance, where uncertainty quantification must account for the severity of ordinal errors. Conformal prediction (CP) provides distribution-free prediction sets with marginal coverage guarantees; however, its practical effectiveness depends critically on the choice of nonconformity function. We introduce a CP method for ordinal classification based on the ranked probability score (RPS), a proper scoring rule defined over cumulative predictive distributions. Although it reflects ordinal risk quite naturally, it has largely been neglected in conformal ordinal prediction (COP). When used as a measure of nonconformity, RPS yields median-centered contiguous prediction sets by construction. The method is model-agnostic, supports both assessed and grouped ordered categorical outcomes, and permits efficient implementation compared to greedy interval selection procedures. Across multiple ordinal image and tabular datasets, RPS-based CP produces contiguous prediction sets and strikes a favorable balance between prediction set width and the magnitude of ordinal miscoverage relative to existing CP methods.

UAI 2026

Proximal Identification and Estimation in Front-Door Causal Structures with Unobserved Confounding of the Mediator

Helen Guo, Beatrix Yaxin Wen, Ilya Shpitser

Unobserved confounding is a fundamental obstacle in causal inference problems. In the graphical modeling literature, a general theory has been developed that allows identification in the presence of hidden variables, with some limitations. In particular, Pearl’s celebrated front-door criterion allows nonparametric identification in the presence of unobserved common causes of the treatment and the outcome, however it requires the presence of an unconfounded variable that mediates all causal influence from the treatment to the outcome. This stringent requirement limits the applicability of the front-door criterion. We propose proximal generalizations of the front-door criterion, allowing both arbitrary treatment/outcome confounding, and unobserved confounders of the mediator, provided informative proxies for the latter type of confounders are observed. In addition to deriving three new identification strategies in this setting, we provide plug-in and influence function-based estimation strategies for the resulting functionals, and evaluate their performance through simulations.

UAI 2026

Provably Efficient Reinforcement Learning in Continuous-Time Episodic MDPs with Poisson Decision Epochs

Kenny Guo, Valentio Iverson, Sahan Wijetunga, William Chang

Many real-world reinforcement learning (RL) problems evolve in continuous time, where decisions occur at irregular, event-driven intervals rather than at fixed discrete steps. We study episodic continuous-time Markov Decision Processes (MDPs) in which decision epochs are governed by a homogeneous Poisson process and the reward and transition dynamics vary smoothly over time. We consider both a fixed number of jumps per episode and a fixed time budget with a random number of Poisson decision epochs. Under a Lipschitz continuity assumption in time, we exploit local smoothness through discretization and extend both UCRL <cit.> and Q-learning <cit.> to this setting, proving 𝒪̃(T^2/3) regret bounds for both model-based and model-free algorithms. Finally, we establish matching Ω̃(T^2/3) minimax lower bounds, showing that the rate is optimal up to logarithmic factors. These results provide the first tight regret guarantees for Lipschitz-smooth continuous-time episodic MDPs with Poisson decision epochs.

UAI 2026

The Price of Valid Inference After Causal Discovery

Dongxin Guo, Jikun Wu, Siu-Ming Yiu

Causal effects estimated by covariate adjustment on a discovered graph have invalid confidence intervals, because the graph-selection step is ignored. We develop a unified selective-inference framework. For constraint-based discovery with latent confounders (FCI) under Gaussianity, we prove that the selection event, given the execution trace and signs, is a polyhedron in Fisher-z space; along the inference direction it becomes polynomial/rational constraints solving to a union of intervals. Inverting the truncated-Gaussian approximate pivot gives exact finite-sample 1-α coverage, with known σ^2, of the adjustment functional γ_1(S^⋆) when {i}∪ S^⋆ contains the outcome’s Markov blanket, and approximate coverage otherwise, with a non-vanishing distortion governed by the variance-ratio excess ρ^2=σ^2_j|X/σ^2_j|-j-1 (small under sparsity); the σ̂^2 plug-in does not remove it. This is the first truncation-set characterization handling latent confounders. Coverage of the structural effect β_i→ j is asymptotically valid up to the same distortion when the adjustment set is valid (exact when ρ^2=0), via high-dimensional FCI consistency under d=o(√(n)). For unmodified GES, heuristic Taylor linearization indicates approximate coverage 1-α-O(d^2/√(n)) when n≫ d^4(log d)^2. In the nonparametric setting, Θ(n^3/4)-split discovery incurs width ratio 1+Θ(n^-1/4) versus a known-graph oracle.

UAI 2026

Detecting Out of Distribution Samples using Class Centered Residual Energy in the Discarded PCA Subspace with Weight Alignment

Shreen Gul, Mohamed Elmahallawy, Ardhendu Tripathy, Sanjay Madria

Principal component analysis (PCA) has recently been adopted for out-of-distribution (OOD) detection, yet most existing methods focus on dominant, high-variance directions of the feature space. This energy-retaining perspective overlooks a crucial fact: discriminative signals separating in distribution (ID) and OOD samples often lie in low variance residual components that are typically discarded. Furthermore, prior PCA-based scores rely solely on feature geometry, limiting robustness under distributional shift. In this work, we revisit PCA for OOD detection from an uncertainty aware perspective. Specifically, we propose a residual-aware OOD detection framework that explicitly models the discarded subspace of a shared within-class PCA basis. By constructing a residual variation score, we capture deviations that are ignored by the leading principal components. To further enhance reliability, we introduce a complementary classifier-weight alignment score that measures the consistency between the selected class-centered residual and the corresponding classifier weight vector. This dual-signal design enables reliable detection even when OOD samples exhibit high energy in the dominant subspaces. Extensive experiments across convolutional and transformer backbones show consistent improvements over strong baselines in AUROC and FPR at 95

UAI 2026

Eigenvalue Calibration for Semantic Embeddings of Large Language Models

Sebastian G. Gruber, Nassim Walha, Francis Bach, Florian Buettner

Uncertainty quantification is central to the reliable deployment of large language models (LLMs), and eigenvalues of semantic embeddings have recently emerged as a key tool in state-of-the-art methods. However, conventional calibration results developed for classification probabilities cannot be directly transferred to eigenvalues. We address this gap by proposing a novel framework for calibrating the eigenvalues of semantic embeddings. We interpret LLMs combined with semantic embeddings of their generated answers as density matrix predictors, and we propose a novel approach to calibrate density matrix predictors by applying temperature scaling to their eigenvalues. We establish entropy–risk equivalence under calibration, derive a central calibration inequality specific to eigenvalues, and prove that temperature-scaled eigenvalues optimize calibration when minimizing proper score risks. Experiments on a variety of real-world settings show that current LLMs are systematically overconfident, and validate our theoretical findings. Together, these results advance the foundations and practice of uncertainty quantification for semantic embeddings.

UAI 2026

Gaussian Graphical Learning via PSD Constraint for Blockwise Missing Multimodal Data

Joseph L. Graves, Yufeng Liu, Elio Zhang, Seong Tae Kim, for the Alzheimer's Disease Neuroimaging Initiative

Gaussian graphical models, estimated via precision matrices, are popular for uncovering underlying conditional dependencies among variables, yet the case of multimodal data with blockwise missing remains unaddressed. We propose a novel method, Direct Sparse Graphical Learning for Multimodal Data (DSGL), to handle this issue using only observed data. The DSGL consists of two stages: constructing a pilot estimator for the covariance matrix without imputation as an admissible input for GLASSO; and estimating the DSGL precision matrix via GLASSO with repeated cross-validation tuning. We further propose a thresholded variant to address false-positive edges, a common issue in high-dimensional data. We establish theoretical properties for DSGL with respect to element-wise deviation and its ability to recover the true graphical structure. In simulations and an Alzheimer’s Disease Neuroimaging Initiative (ADNI) application, DSGL outperforms imputation-based and other competing approaches, yielding more accurate graph estimation and lower Frobenius-norm error.

UAI 2026

Quantification of Credal Uncertainty: A Distance-Based Approach

Xabier Gonzalez-Garcia, Siu Lun Chau, Julian Rodemann, Michele Caprio, Krikamol Muandet, Humberto Bustince, Sebastien Destercke, Eyke Hullermeier, Yusuf Sale

Credal sets, i.e., closed convex sets of probability measures, provide a natural framework to represent aleatoric and epistemic uncertainty in machine learning. Yet how to quantify these two types of uncertainty for a given credal set, particularly in multiclass classification, remains underexplored. In this paper, we propose a distance-based approach to quantify total, aleatoric, and epistemic uncertainty for credal sets. Concretely, we introduce a family of such measures within the framework of Integral Probability Metrics (IPMs). The resulting quantities admit clear semantic interpretations, satisfy natural theoretical desiderata, and remain computationally tractable for common choices of IPMs. We instantiate the framework with the total variation distance and obtain simple, efficient uncertainty measures for multiclass classification. In the binary case, this choice recovers established uncertainty measures, for which a principled multiclass generalization has so far been missing. Empirical results confirm practical usefulness, with favorable performance at low computational cost.

UAI 2026

Fast Best-in-Class Regret for Contextual Bandits

Samuel Girard, Aurelien Bibaut, Jill-Jênn Vie, Arthur Gretton, Nathan Kallus, Houssam Zenati

We study the problem of stochastic contextual bandits in the agnostic setting, where the goal is to compete with the best policy in a given class without assuming realizability or imposing model restrictions on losses or rewards. In this work, we propose Online Pessimistic Policy Learning and establish the first fast rate for regret relative to the best-in-class policy. Our proposed algorithm updates the policy at every round by minimizing a pessimistic objective, defined as a clipped inverse-propensity estimate of the policy value plus a variance penalty. By leveraging entropy assumptions on the policy class and a Hölderian error-bound condition (a generalization of the margin condition), we achieve fast best-in-class regret rates, including polylogarithmic rates in the parametric case. Our analysis is driven by a novel sequential self-normalized maximal inequality for bounded martingale empirical processes, which yields uniform variance-adaptive confidence bounds and guarantees pessimism under adaptive data collection.

UAI 2026

Implicit Learning for Reasoning in First-Order Probabilistic Logic

Luise Ge, Brendan Juba, Kris Nilsson, Alison Shao

Reasoning under uncertainty is a fundamental challenge, particularly when inference involves complex computations over large relational domains. Existing probabilistic inference methods typically answer probabilistic queries by leveraging symmetries to perform efficient, lifted inference assuming access to a complete model. However, the upstream task of learning such a model from partial and noisy observations is generally intractable. We propose the first polynomial-time framework for “implicit learning to reason" in a first-order relational probability logic, even over infinite domains. Our approach combines statistical signals from data with semidefinite relaxations of the moment problem, jointly informed by new observations and prior knowledge from the knowledge base. This enables verifying or refuting first-order queries without ever constructing an explicit model. We establish soundness and completeness guarantees for our algorithm, as well as a tractability result.

Keep browsing

More papers from top AI conferences

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