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

On Transportability for Structural Causal Bandits

Min Woo Park, Sanghack Lee

The structural causal bandit (SCB) framework offers a graphical approach to identifying suboptimal actions by leveraging prior knowledge of the underlying causal structure. While theoretically appealing, there has been limited guidance on how to systematically transfer information across heterogeneous datasets from multiple environments. In this paper, we study the structural causal bandit under transportability, where prior knowledge from source environments is integrated to accelerate learning in a target deployment environment. We show that exploiting causal invariances across environments improves sample efficiency in identifying the optimal action.

UAI 2026

The Convergence Behavior of Adam under Heavy-Tailed Noise

Yijiang Pang

We establish the first convergence guarantees for the plain vector-form Adam optimizer under heavy-tailed stochastic noise. While several Adam variants are known to achieve optimal iteration complexity in bounded-variance nonconvex optimization, little is understood about their behavior when stochastic gradients admit only a bounded p-th central moment for some p ∈ (1,2], a setting increasingly observed in modern deep learning. To address this gap, we generalize the recent online-to-nonconvex conversion framework to accommodate heavy-tailed martingale-difference noise. Building on this generalized framework, we develop a discounted regret analysis for Adam, without restrictive parameter coupling. Our results show that Adam converges to (ρ,ϵ)-stationary points under heavy-tailed noise. However, it exhibits a suboptimal iteration complexity and p-dependent convergence, a suboptimality that persists even in the bounded-variance case (p=2). When the domain radius is known and used to control the online-learner output, a standard setup in related literature, the convergence rate improves to match the optimal complexity. These findings provide new theoretical insight into the robustness and limitations of Adam in heavy-tailed regimes.

UAI 2026

Explore, Refine, then Commit: Nearly Optimal Multi-Group Mean Estimation with Active Learning

Shourya Pandey, Syamantak Kumar

We present nearly optimal algorithms for simultaneously estimating the means of multiple distributions given a fixed total sample budget while ensuring uniform confidence intervals for the distributions. Our algorithms are based on the well-known _explore-then-commit_ policy from the bandit literature along with an additional refinement phase between the exploration phase and the commit phase. Our algorithms achieve regret Õ( (logσ_min^-1)^0.5 T^-1.5) when the rewards are subgaussian and Õ(σ_min^-1T^-1.5) regret when the rewards have bounded fourth moment, where T is the horizon and σ_min^2 is the minimum among the variances of the distributions of the G arms. We also provide lower bounds on the regret that nearly match the upper bounds for a constant G in both these cases. IImportantly, we show that the dependence on σ_min in both cases is necessary, resolving a long-standing open problem of [Carpentier et al]. We also study the setting where the distributions are hypercontractive. This distribution class includes the family of Gaussian distributions but also includes several families of heavy-tailed distributions. We propose an algorithm for hypercontractive reward distributions that achieves a Õ(T^-1.5) regret, independent of σ_min, and show a nearly matching lower bound for Gaussians.

UAI 2026

Sample-Efficient Learning of Probabilistic Causes for Reachability in Markov Decision Processes with Probabilistic Guarantees

Ryohei Oura, Georgios Fainekos, Hideki Okamoto, Bardh Hoxha

Probabilistic model checking for Markov decision processes (MDPs) provides quantitative guarantees, but often offers limited insight into why undesired outcomes occur. Probability-raising (PR) causality addresses this by identifying states whose visitation increases the probability of reaching designated states. Existing PR-cause identification methods, however, use MDP modifications ill-suited for learning: the gap between conditional and unconditional reachability probabilities can be hard to detect from samples, and construction requires reachability probabilities of the original MDP, which are unavailable when transition probabilities are unknown. We study unknown MDPs and propose a learning approach with probabilistic guarantees for PR-cause identification. Our key ingredient is a restart-based MDP modification that reduces PR-cause checking to two conditional reachability queries without using reachability values of the original MDP. We prove correctness, establish sample-complexity bounds, and develop an anytime learning-and-checking algorithm based on two-sided value iteration that progressively classifies states as causal, non-causal, or undecided. Experiments on two benchmarks demonstrate reliable and fast identification of PR causes.

UAI 2026

Coarsening Bias from Variable Discretization in Causal Functionals

Xiaxian Ou, Razieh Nabi

Causal identification functionals often require integration over conditional densities of continuous variables, such as those arising in nonparametric identification theory of total and mediated causal effects in DAGs with hidden variables. Estimating these densities and evaluating the resulting integrals can be statistically and computationally demanding. A common workaround is to discretize the continuous variable and replace integrals with finite sums. Although convenient, discretization alters the population-level functional and can induce non-negligible approximation bias, even when identification is correct. Under smoothness conditions, we show that the resulting coarsening error is first order in the bin width and arises at the level of the target functional, distinct from statistical estimation error. We propose a simple debiased coarsened functional that evaluates the outcome regression at within-bin conditional means, eliminating the leading coarsening error term and yielding a second-order approximation error. We derive plug-in and one-step estimators for this debiased coarsened functional. Simulations demonstrate substantial bias reduction and near-nominal confidence interval coverage, even under coarse binning. Our results provide a simple framework for controlling the impact of variable discretization on both parameter approximation and statistical estimation.

UAI 2026

Partially Observed Structural Causal Models

Turan Orujlu, Jordan Kyle Matelsky, Martin V. Butz, Charley M Wu, Konrad Kording

Here we introduce Partially Observed Structural Causal Models (POSCMs) as an extension of structural causal models (SCMs) to settings where upstream contexts co-determine both the interaction structure and downstream mechanisms on observed variables. POSCMs thus provide a self-contained causal modeling framework for endogenous graphs, allowing for an intervention hierarchy spanning node- and edge-level contexts and endogenous variable interventions. To define edge interventions, we separate node mechanisms into edge-local transmission channels that can be modified without changing the source node or the rest of the target mechanism. We provide an identifiability theory that clarifies which intervention families would suffice to disentangle structure formation from mechanisms. We then empirically validate these theoretical results in two external simulators: a biophysically detailed virtual human retina and a gene-regulatory analogue. The experiments reproduce non-identifiability under latent context, expose structure-mechanism confounding under latent edges, and recover pathway-level input-output relationships under targeted interventions, consistent with our positive Markov kernel identifiability results. Together, POSCMs provide an intervention-oriented framework for causal systems in which contexts, graph structure, mechanisms, and measurements are jointly generated and only partially observed.

UAI 2026

Falsifying Causal Graphs With Outlier Events

William Roy Orchard, Philipp Michael Faller, Dominik Janzing

True causal relationships are rarely known, and inferring causal graphs from data is hard. A fundamental challenge is how to assess whether a given causal graph is good in the absence of a ground truth. We propose falsifying candidate causal graphs based on whether they can explain the propagation of an outlier event. Our approach leverages a key principle: weak outliers rarely cause strong ones. While this principle has previously been used in root cause analysis to identify root causes without prior knowledge of the graph, we turn it on its head and use it to falsify candidate causal graphs whose implied outlier propagation is inconsistent with the data. To this end, we present the first statistical tests for the hypothesis that a candidate graph is the true causal graph, and show they have false positive control, power guarantees against incorrect causal graphs, and can operate with a single outlier sample.

UAI 2026

MetaCaDI: A Meta-Learning Framework for Causal Discovery from Multiple Environments with Unknown Interventions

Hans Jarett Ong, Yoichi Chikahara, Tomoharu Iwata

Uncovering the causal mechanisms of complex real-world systems remains a significant challenge, as these systems often entail high data collection costs and involve unknown interventions. We introduce MetaCaDI, the first framework to cast the identification of unknown interventions as a meta-learning problem, explicitly leveraging a jointly learned causal graph. MetaCaDI is a Bayesian framework that learns a shared causal structure across multiple environments and is optimized to rapidly adapt to new, few-shot intervention target identification tasks. A key innovation is our model’s analytical adaptation, which uses a closed-form solution to bypass expensive and potentially unstable gradient-based bilevel optimization. Extensive experiments on synthetic and complex gene expression data demonstrate that MetaCaDI significantly outperforms state-of-the-art methods. It excels at identifying intervention targets from as few as 3 samples—where existing methods collapse to random chance—while robustly recovering the shared causal graph, proving its effectiveness in data-scarce scenarios.

UAI 2026

Prior-Fitted Functional Flows: In-Context Generative Models for Pharmacokinetics

Cesar Ojeda, Niklas Hartung, Purity Kamene Kavwele, Tim Jahn, Piyush Kumar, Marian Klose, Wilhelm Huisinga, Ramses J Sanchez, Darius A Faroughy

We introduce Prior-Fitted Functional Flows, a generative foundation model for pharmacokinetics that enables zero-shot population synthesis and individual forecasting without manual parameter tuning. We learn functional vector fields, explicitly conditioned on the sparse, irregular data of an entire study population. This enables the generation of coherent virtual cohorts as well as forecasting of partially observed patient trajectories with calibrated uncertainty. We construct a new open-access literature corpus to validate our priors, and demonstrate state-of-the-art predictive accuracy on extensive real-world datasets. Our code repository a, pretrained model, data and examples are available online.

UAI 2026

What Type of Inference is Active Inference?

Wouter W. L. Nuijten, Mykola Lukashchuk, Thijs van de Laar, Bert de Vries

Active inference casts decision-making as inference, with the Expected Free Energy (EFE) providing an objective that unifies goal-seeking and information-gathering behavior. Recent work showed that EFE minimization can be reformulated as Variational Free Energy (VFE) minimization on a generative model augmented with epistemic priors, but left open how this formulation relates to other inference-based planning methods and whether it admits efficient message-passing implementations. Here we address both questions. First, we show that active inference is variational inference with specific entropy corrections to the VFE. Different planning-as-inference methods correspond to different corrections, each yielding a distinct objective; active inference is the variant whose corrections yield the Expected Free Energy. Second, we derive a message-passing scheme by introducing a channel reparameterization that re-localizes the entropy corrections into a standard Bethe free energy. Experiments on three grid-world environments with distinct uncertainty profiles show that the dynamics channel drives spatial information gathering when observations are decisive, the observation channel is critical when observations are merely suggestive, and only the full active inference objective performs robustly across all regimes.

UAI 2026

Conformal Risk Minimization with Variance Reduction

Sima Noorani, Orlando Romero, Nicolò Dal Fabbro, Hamed Hassani, George J. Pappas

Conformal prediction **(CP)** is a distribution-free framework for achieving probabilistic guarantees on black-box models. **CP** is generally applied to a model post-training. Recent research efforts, on the other hand, have focused on optimizing CP efficiency **during training**. We formalize this concept as the problem of **conformal risk minimization** (CRM). In this direction, **conformal training** **(ConfTr**) by (Stutz et. al (2022)) is a CRM technique that seeks to minimize the expected prediction set size of a model by simulating **CP** in-between training updates. In this paper, we provide a novel analysis for the **ConfTr** gradient estimation method, revealing a strong source of sample inefficiency that introduces training instability and limits its practical use. To address this challenge, we propose **variance-reduced conformal training** **(VR-ConfTr)**, a CRM method that carefully incorporates a novel variance reduction technique in the gradient estimation of the **ConfTr** objective function. Through extensive experiments on various benchmark datasets, we demonstrate that **VR-ConfTr** consistently achieves faster convergence and smaller prediction sets compared to baselines.

UAI 2026

Scaling Up Bayesian DAG Sampling

Daniele Nikzad, Alexander Zhilkin, Juha Harviainen, Jack Kuipers, Giusi Moffa, Mikko Koivisto

Bayesian inference of Bayesian network structures is often performed by sampling directed acyclic graphs along an appropriately constructed Markov chain. We present two techniques to improve sampling. First, we give an efficient implementation of basic moves, which add, delete, or reverse a single arc. Second, we expedite summing over parent sets, an expensive task required for more sophisticated moves: we devise a preprocessing method to prune possible parent sets so as to approximately preserve the sums. Our empirical study shows that our techniques can yield substantial efficiency gains compared to previous methods.

UAI 2026

Mixture-Greedy for Online Generative Model Selection: Is UCB Necessary in Diversity-Aware Multi-Armed Bandits?

Bahar Dibaei Nia, Farzan Farnia

Efficient selection among multiple generative models is increasingly important in modern generative AI, where sampling from suboptimal models is costly. This problem can be viewed as a *multi-armed bandit (MAB)* task. Under diversity-aware evaluation scores, a non-degenerate mixture of generators can outperform any individual model, distinguishing this MAB setting from classical best-arm identification. Prior approaches incorporate an Upper Confidence Bound (UCB) exploration bonus into the mixture objective. However, across multiple datasets and evaluation metrics, we observe that the UCB term consistently slows convergence and reduces sample efficiency. In contrast, a simple *Mixture-Greedy* strategy without explicit UCB-type optimism converges faster and achieves even better performance, particularly for widely used metrics such as FID and Vendi where tight confidence bounds are difficult to construct. We provide theoretical insight explaining this behavior: under structural conditions, diversity-aware objectives induce *implicit exploration* by favoring interior mixtures, leading to sampling of all arms and sublinear regret guarantees for diversity-based objectives. These results suggest that in diversity-aware multi-armed bandits, e.g., for generative model selection, exploration can arise intrinsically from the objective’s geometry. The project code is available at https://github.com/bhrdbn/Mixture-Greedy.

UAI 2026

MUSS: Multilevel Subset Selection for Relevance and Diversity

Vu Nguyen, Andrey Kan

The problem of relevant and diverse subset selection has a wide range of applications, including recommender systems and retrieval-augmented generation (RAG). For example, in recommender systems, one is interested in selecting relevant items, while providing a diversified recommendation. Constrained subset selection problem is NP-hard, and popular approaches such as Maximum Marginal Relevance (MMR ) are based on greedy selection. Many real-world applications involve large data, but the original MMR work did not consider distributed selection. This limitation was later addressed by a method called DGDS which allows for a distributed setting using random data partitioning. Here, we exploit structure in the data to further improve both scalability and performance on the target application. We propose MUSS, an efficient method that uses a multilevel approach to relevant and diverse selection. In a recommender system application, our method can not only improve the performance up to 4 percent points in precision, but is also 20 to 80 times faster. Our method is also capable of outperforming baselines on RAG-based question answering accuracy. We present a novel theoretical approach for analyzing this type of problems, and show that our method achieves a constant factor approximation of the optimal objective. Moreover, our analysis also results in a x2 tighter bound for DGDS compared to previously known bound. Our code is publicly available at https://github.com/amazon-science/muss.

UAI 2026

When Does Model Multiplicity Affect Prediction Intervals? A Sharp Phase Transition

Hai Nguyen, Khanh Nguyen, Hung Mai, Luong Doan, Nhung Duong, Phong Ho, Tuan Do

The Rashomon effect, the fact that many different models can achieve nearly identical predictive accuracy, has been extensively studied across various domains of machine learning. While modern conformal prediction provides valid intervals for a single model, it remains blind to the inherent arbitrariness of having to select from multiple candidates. This paper bridges this gap by investigating when model multiplicity, or the existence of many near-optimal models, materially widens prediction intervals. We prove a sharp phase transition for ridge regression under Gaussian design and introduce *Rashomon Prediction Intervals* (RPIs), which bound the range of predictions across the Rashomon set and establish a Rashomon-Conformal Bridge that provides distribution-free coverage guarantees. A critical tolerance ε^⋆ = Θ(σ^2/p) separates two distinct regimes: below it, Rashomon-conformal intervals match standard conformal width; above it, model multiplicity dominates, and this scaling is provably minimax optimal. Computationally, exact RPIs are polynomial for convex classes but NP-hard for tree ensembles, with a thin-cap volumetric barrier ruling out sampling-based approximation. Experiments on six UCI benchmarks confirm the phase transition, with all datasets falling in the sub-critical regime at standard tolerances, indicating that model multiplicity is invisible in prediction intervals for typical tabular regression.

UAI 2026

Tight rates of approximation of mixed Nash equilibria by entropy regularization in continuous games

Khang Nguyen, Valentio Iverson, Sahan Wijetunga, William Chang, Guillaume Wang

We study how well the quantal response equilibrium (QRE) approximates the mixed Nash equilibrium (MNE) in two-player zero-sum games, as a function of the inverse temperature β. We introduce a reduction framework that decomposes the worst-case Nikaido–Isoda error of the QRE into a sum of two independent single-player Gibbs concentration problems, enabling tight matching bounds across a range of payoff classes. For finite games with M × N payoff matrices, we establish a tight rate of Θ(β^-1(log M + log N)). For games with α-Hölder-continuous payoffs on the torus, we prove a lower bound of Ω((d_x+d_y)/(αβ)) and an upper bound of O((d_x+d_y)log(Lβ)/(αβ)); whether the logarithmic gap is tight is left as an open problem. For smooth payoffs with sparse non-degenerate MNE, we prove that every individual game achieves a rate of (d_x + d_y)/(2β) + O(1/β^2) via Laplace concentration, and that this rate is tight.

UAI 2026

REALITrees: Rashomon Ensemble Active Learning for Interpretable Trees

Simon Dovan Nguyen, Hayden McTavish, Kentaro Hoffman, Tyler McCormick, Cynthia Rudin

Active learning reduces labeling costs by querying samples to maximize information gain. A dominant framework, Query-by-Committee, typically relies on *perturbation-based diversity* by inducing model disagreement through random feature subsetting or data blinding. While this approximates one notion of epistemic uncertainty, it sacrifices direct characterization of the plausible hypothesis space. We propose the complementary approach: *Rashomon Ensembled Active Learning (REAL)* which constructs a committee by exhaustively enumerating the Rashomon Set of all near-optimal models. To address functional redundancy within this set, we adopt a Probably Approximately Correct-Bayesian framework using a Gibbs posterior to weigh committee members by their empirical risk. Leveraging recent algorithmic advances, we exactly enumerate this set for the class of sparse decision trees. Across synthetic and established active learning baselines, REAL outperforms randomized ensembles, particularly in moderately noisy environments where it leverages expanded model multiplicity to achieve faster convergence.

UAI 2026

Adaptive and Robust Watermark for Generative Tabular Data

Dung Daniel Ngo, Archan Ray, Akshay Seshadri, Daniel Scott, Saheed Obitayo, Niraj Kumar, Vamsi K. Potluru, Marco Pistoia, Manuela Veloso

In recent years, watermarking generative tabular data has become a prominent framework to protect against the misuse of synthetic data. However, while most prior work in watermarking methods for tabular data demonstrate a wide variety of desirable properties (e.g., high fidelity, detectability, robustness), the findings often emphasize empirical guarantees against common oblivious and adversarial attacks. In this paper, we study a flexible and robust watermarking algorithm for generative tabular data. Specifically, we demonstrate theoretical guarantees on the performance of the algorithm on metrics like fidelity, detectability, robustness, and hardness of decoding. The proof techniques introduced in this work may be of independent interest and may find applicability in other areas of machine learning. Finally, we validate our theoretical findings on synthetic and real-world tabular datasets.

UAI 2026

What Capable Agents Must Know: Selection Theorems for Robust Decision-Making under Uncertainty

Aran Nayebi

As artificial agents become increasingly capable, what internal structure is *necessary* for an agent to act competently under uncertainty? Classical results show that optimal control can be *implemented* using belief states or world models, but not that such representations are required. We prove quantitative "selection theorems" showing that strong task performance (low *average-case regret*) forces world models, belief-like memory and—under task mixtures—persistent regime-tracking variables resembling functional primitives of emotion, along with informational modularity under block-structured tasks. Our results cover stochastic policies, partial observability, and evaluation under task distributions, without assuming optimality, determinism, or access to an explicit model. Technically, we reduce predictive modeling to binary "betting" decisions and show that regret bounds limit probability mass on suboptimal bets, enforcing the predictive distinctions needed to separate high-margin outcomes. In fully observed settings, this yields approximate recovery of the interventional transition kernel; under partial observability, it implies necessity of predictive state and belief-like memory, addressing an open question in prior world-model recovery work.

UAI 2026

Dynamics of Learning under User Choice: Overspecialization and Peer-Model Probing

Adhyyan Narang, Sarah Dean, Lillian J. Ratliff, Maryam Fazel

In many economically relevant contexts where machine learning is deployed, multiple platforms obtain data from the same pool of users, each of whom selects the platform that best serves them. Prior work in this setting focuses exclusively on the “local” losses of learners on the distribution of data that they observe. We find that there exist instances where learners who use existing algorithms almost surely converge to models with arbitrarily poor global performance, even when models with low full-population loss exist. This happens through a feedback-induced mechanism, which we call the overspecialization trap: as learners optimize for users who already prefer them, they become less attractive to users outside this base, which further restricts the data they observe. Inspired by the recent use of knowledge distillation in modern ML, we propose an algorithm that allows learners to "probe" the predictions of peer models, enabling them to learn about users who do not select them. Our analysis characterizes when probing succeeds: this procedure converges almost surely to a stationary point with bounded full-population risk when probing sources are sufficiently informative, e.g., a known market leader or a majority of peers with good global performance. We verify our findings with semi-synthetic experiments on the MovieLens, Census, and Amazon Sentiment datasets.

Keep browsing

More papers from top AI conferences

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