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

Planning with Formal Reachability Guarantees in Goal-Oriented MDPs with Dead-Ends

Matisse Roche, Caroline P.C. Chanel, Yoko Watanabe

Goal-oriented Markov Decision Processes with unavoidable dead-ends pose a significant challenge to standard planning algorithms, as the goal cannot always be reached with probability 1. In certain applications, it can be desirable to optimize efficiency only over successful trajectories while enforcing a lower bound on goal reachability, yet no existing method directly addresses this conditional formulation, whose non-linear structure makes direct optimization difficult. To overcome this, we introduce a tractable approximation. Working within an unconstrained utility-maximization framework, we derive an analytical formula that determines a value for the goal-reward parameter sufficient to guarantee that the optimal policy respects the requested reachability threshold. The proposed approach is evaluated on two common benchmark domains, Aircraft Routing and Exploding Blocksworld, and compared against state-of-the-art constrained optimization methods, specifically i-dual and Chance-Constrained. Results show that our method offers a compelling trade-off: it significantly reduces the expected cost compared to conservative lexicographic approaches (i.e. i-dual), while avoiding the failure-seeking bias inherent to methods modelling artificial zero-cost give-up action (i.e. Chance-Constrained).

UAI 2026

Imprecise Probabilities for Privacy–Accuracy Trade-offs in Bayesian Networks

Niccolò Rocchi, Fabio Stella, Cassio de Campos

Bayesian networks are well-known probabilistic graphical models that enable explainable reasoning under uncertainty. In many domains, data are scarce and fragmented across institutions, motivating collaboration and the sharing of learned models rather than individual-level records to increase the available evidence and reduce bias. Releasing a model, however, can still reveal sensitive information: adversaries may mount membership inference attacks to determine whether a specific individual contributed to the training. A common mitigation strategy is to inject noise into the learned model before its release. This perturbation may compromise the quality and interpretability of subsequent inferences. We investigate how a Bayesian network can be effectively masked rather than perturbed to protect it against attacks by leveraging credal networks, the imprecise version of Bayesian networks, allowing us to employ sets of parameters instead of exact point estimates. We formalize and compare various masking and attack strategies and investigate how privacy leakage depends on these strategies. Finally, we analyze how privacy and utility can be traded off in credal naive Bayes models, comparing them with the common noise-injection baseline. Results indicate that credal masking provides principled protection, substantially reducing attack success while yielding fine-tuned privacy-accuracy trade-offs.

UAI 2026

Expert Advice with Costly Observations

Lev Reyzin, Aadirupa Saha, Shuo Wu

Querying expert predictions or human feedback incurs explicit, often heterogeneous costs—a challenge central to crowdsourcing and LLM training. We study online learning with expert advice under observation costs, where the learner must adaptively select which experts to query (p_i is expert-dependent) to minimize cumulative cost (losses plus query costs). While classical bandits and recent paid observation models have advanced the field, they fail to capture the rich cost-adaptive selection landscape and do not provide tight, problem-dependent performance guarantees for heterogeneous costs. This paper provides the first comprehensive characterization. For adversarial losses, we prove tight minimax regret Θ(m∈{1,…,K}min{√(K/m Tlog K) + (m-1)p̅T}), interpolating between bandit and full-information regimes and revealing the optimal observation budget, where p̅ is a tight upper bound of p_is. For stochastic losses, our novel m-ELIM algorithm achieves instance-dependent regret of O(log T/m∑_i ≠ i^*1/Δ_i + (m-1)p̅T), Δ_i being the suboptimality gap of the i-th arm, showing how gap structure and costs interact. Matching lower bounds (adversarial and stochastic) establishes minimax optimality. These results provide the first rigorous framework for optimally allocating annotation budgets across heterogeneous workers in crowdsourcing systems, directly informing cost-effective strategies for collecting human feedback in adaptive learning applications.

UAI 2026

Beyond Mixtures and Products for Ensemble Aggregation: A Likelihood Perspective on Generalized Means

Raphaël Razafindralambo, Remy Sun, Damien Garreau, Frederic Precioso, Pierre-Alexandre Mattei

Density aggregation is a central problem in machine learning, for instance when combining predictions from a Deep Ensemble. The choice of aggregation remains an open question with two commonly proposed approaches being linear pooling (probability averaging) and geometric pooling (logit averaging). In this work, we address this question by studying the normalized generalized mean of order r ∈ℝ∪{-∞,+∞} through the lens of log-likelihood, the standard evaluation criterion in machine learning. This provides a unifying aggregation formalism and shows different optimal configurations for different situations. We show that the regime r ∈ [0,1] is the only range ensuring systematic improvements relative to individual distributions, thereby providing a principled justification for the reliability and widespread practical use of linear (r=1) and geometric (r=0) pooling. In contrast, we show that aggregation rules with r ∉ [0,1] may fail to provide consistent gains with explicit counterexamples. Finally, we corroborate our theoretical findings with empirical evaluations using Deep Ensembles on image and text classification benchmarks.

UAI 2026

Structure Learning for Unfaithful Distributions: The Minimal Dependence Faithfulness

Pouria Ramazi, Hamid Kalantari

Causal discovery algorithms such as PC often rely on faithfulness; yet XOR-type relations expose violations that PC and its weakened-faithfulness variants can miss. In such cases, a target variable X may be independent of each variable Y_i individually, while becoming dependent on Y_i once the remaining variables are conditioned on. We call a minimal set with this property a minimal dependence (MD) set: no proper subset has the same dependence pattern. MD sets of size at least two violate faithfulness. We introduce minimal-dependence faithfulness and a corresponding orientation condition, characterize the resulting DAG structure by showing that dependent members of an MD set connect to X directly or through colliders, and define the associated MD-equivalence representation. We then present MD-PC, a PC-style algorithm that detects such faithfulness violations and, under the proposed assumptions, returns the corresponding candidate class of DAGs.

UAI 2026

Variance Estimation and Selecting Good Estimands for Causal Effect Queries

Anna K Raichev, Rina Dechter, Jin Tian, Alexander Ihler

This paper investigates the statistical efficiency of algebraic expressions ("estimands") used to answer causal queries. We first examine structural rules, developing a partial dominance relationship for front-door estimands that extends recent results on back-door estimands. In many models, however, structural rules alone may be insufficient to select an estimand. For such cases, we propose empirical techniques for estimating and comparing the variance of different estimands using both the graph and observational data: 1) a bootstrap-based method, and 2) a computationally simpler yet practically effective method for discrete models which estimates the Fisher information matrices. We illustrate both methods’ effectiveness on a variety of causal diagrams and estimand forms.

UAI 2026

Metacognitive Arbitration as Uncertainty Compression in Multi-Agent Language Models

Mafizur Rahman, Lijun Qian

Multi-agent reasoning and metacognitive strategies are widely used to improve large language model (LLM) performance, yet the functional role of metacognition remains unclear. Prior methods often treat metacognition as a mechanism for generating better or more diverse reasoning. In this work, we argue that metacognition primarily functions as an information routing and compression mechanism rather than a generator of new reasoning content. We introduce MC-MAS, an inference-time framework that separates problem solving from metacognitive arbitration, where independent solvers propose candidate answers and an arbiter critiques and consolidates their outputs. Using routing-centric metrics: semantic novelty, entropy reduction, and overconfident errors across four reasoning benchmarks and multiple model settings, we show that MC-MAS introduces limited novelty but consistently reduces uncertainty and overconfidence, with accuracy gains that are modest and dataset-dependent. These results indicate that reliable improvements arise from structured arbitration rather than reflection or increased sampling alone.

UAI 2026

Beyond Mean-Field: Tree-Copula Variational Autoencoders for Structured Latent Dependencies

Yarden Rachamim, Shai Fine

Variational Autoencoders (VAEs) typically assume a factorized Gaussian posterior and isotropic normal prior, implicitly imposing mean-field independence in the latent space. Rewriting the ELBO in copula form, we isolate a dependence-mismatch term that contributes to approximation and amortization gaps. We propose a Tree-Copula VAE that replaces the mean-field posterior with a tree-structured copula while retaining flexible learned marginals. The tree is inferred per datapoint via a Chow–Liu maximum-weight spanning tree, exploiting the monotonic relationship between mutual information and copula parameters. We further study an Average-of-Trees (AoT) copula prior for prior–posterior alignment and a rank-1 Gaussian-copula likelihood for low-rank observation correlations. Experiments on correlated dSprites and Fashion-MNIST show tighter importance-weighted bounds than mean-field VAEs when latent dependence is present, and highlight the role of prior alignment and likelihood modeling beyond mean-field inference.

UAI 2026

Multi-Agent RL with Invisible Collaborators: Marginal Advantage Estimation for Indirect Cooperation

Jianglin Qiao, Zehong Cao, Siyi Hu, Mingjun Fan, Mahardhika Pratama, Ryszard Kowalczyk

Cooperative Multi-Agent Reinforcement Learning (MARL) has primarily focused on direct cooperation among agents. However, many real-world systems exhibit structurally asymmetric cooperation, where agents are physically constrained and cannot directly coordinate with those on whom they depend. In such settings, accurately estimating individual contributions under high uncertainty is challenging. We propose Marginal Advantage Estimation (MAE), a representation-level contribution estimation method for cooperative MARL under this structural isolation. MAE employs a synchronised feature-masking mechanism to evaluate marginal contributions without action-level counterfactual perturbations, thereby reducing variance and providing more informative learning signals. We provide a theoretical analysis of its bias–variance properties and demonstrate consistent performance improvements across 18 tasks in Partitioned MPE and Basilisk benchmarks over strong cooperative MARL baselines.

UAI 2026

Reading As Humans: Unified Negation Detection via Cascade Linear Attention Network with Model-Agnostic Meta-Learning

Zhong Qian, Peifeng Li, Qiaoming Zhu, Guodong Zhou

Negation Detection (ND) aims to extract negative statements with non-factual semantics, including negative scopes, xscopes, focuses, where (x)scopes are continuous spans governed by negative cues, and focuses are the most principal negated texts in scopes. Previous studies are confined to task-specific models, and failed to develop a unified solution for (x)scopes and focuses based on the correlations of their definitions, nor implemented the mutual promotion for each task. Moreover, existing work did not design fine-grained encoders, resulting in reliance on external features, such as syntactic parse trees. To address these issues, we construct a unified negation detection paradigm with Model-Agnostic Meta-Learning (MAML) to facilitate those ND sub-tasks. Besides, inspired by reading mechanism of humans, we synthesize Cascade Linear Attention Network (CLAN) by heterogeneous linear attentions with cascade coefficients as fine-grained encoder. Experimental results on several corpora demonstrate that CLAN can outperform the state-of-the-arts.

UAI 2026

Transformer Based Bayesian Network Structure Learning from an Information Theory Perspective

Zhiwei Qi, Kun Yue, Zhu Yang, Jiahui Wang

The pivotal challenge of handling uncertainty in artificial intelligence has prompted a growing focus on learning Bayesian network (BN) structures from data in recent years. Nevertheless, most of the existing methods such as hill-climbing, variational auto-encoder and graph neural network-based algorithms continue to encounter the issues like local optimum and exponential computational complexity, etc. In response to these challenges, we propose a Transformer-based approach for learning the BN structure (T-BNSL) from an information theory perspective. Specifically, we first establish the graph skeleton of a BN by employing conditional independence tests grounded in mutual information. Subsequently, we propose a hill-climbing method with decomposable BIC scoring function to generate potential directed acyclic graphs (DAGs) and evaluate the BIC scores of a subset of these DAGs. Lastly, we use the Transformer framework with a refined attention module to predict the BIC scores of the remaining DAGs, enabling the efficient identification of the DAG with the highest score. Experimental findings demonstrate that our approach significantly surpasses state-of-the-art competitors in terms of accuracy and efficiency by several orders of magnitude when learning the BN structure.

UAI 2026

Distributional Deep Gaussian Processes

Sebastian Popescu

Deep Gaussian processes (DGPs) offer a principled Bayesian framework with hierarchical uncertainty propagation, but their reliable propagation of uncertainty and out-of-distribution (OOD) detection performance remains underexplored and often unreliable in safety-critical settings. In this work, we propose a novel kernel operating in both Euclidean and Wasserstein-2 space to better account for the geometry of representation learning spaces, thus circumventing a common pathology called feature collapse, whereby inliers and outliers get mapped to similar spaces. Empirically, our approach consistently improves OOD detection in convolutional image tasks and shows improved performance on tabular datasets.

UAI 2026

UnGuide: Learning to Forget with LoRA-Guided Diffusion Models

Alicja Polowczyk, Agnieszka Polowczyk, Dawid Malarz, Artur Kasymov, Jacek Tabor, Marcin Mazur, Przemysław Spurek

Large-scale text-to-image diffusion models pose safety and compliance risks due to their ability to generate harmful or undesirable content. Machine unlearning seeks to remove specific concepts from pretrained models while preserving overall generative quality. Low-Rank Adaptation (LoRA) enables parameter-efficient targeted forgetting, but naive LoRA-based unlearning often induces distributional shift, degrading fidelity and destabilizing sampling. In this paper, we propose UnGuide, a LoRA-based unlearning framework with stability-aware adaptive guidance. Our method dynamically modulates classifier-free guidance (CFG) based on early denoising trajectory variance. By estimating discrepancies between base and LoRA-adapted noise predictions during initial diffusion steps, UnGuide interpolates per prompt between the frozen and adapted models. High-variance trajectories receive stronger adapted-model guidance to enforce forgetting, while low-variance trajectories rely on the base model to preserve fidelity. This mechanism enables controlled concept suppression without prompt embedding modification or external segmentation. Experiments on object erasure and explicit content removal demonstrate improved forgetting efficacy and superior fidelity retention compared to existing LoRA-based approaches.

UAI 2026

A Characterization of the Orthocomplement of the Tangent Space of Semiparametric Markov Models

Trung Q. Phung, Ilya Shpitser

Graphical models are ubiquitous in social and empirical science as they are intuitive and easy to use. These models belong to the broader class of Markov models, defined using solely conditional independence (CI) restrictions. In order to estimate a finite-dimensional target parameter in such models efficiently, semi-parametric theory provides a principled framework for constructing regular and asymptotically linear estimators via influence functions (IFs). These estimators are asymptotically normal and root-n consistent. Characterizing the class of all influence functions for a target parameter is crucial for statistically efficient inference in these models. For models that are Markov relative to directed acyclic graphs (DAGs), the orthogonal complement of the tangent space is known, implying that for any target the class of all influence functions can be derived once an influence function is obtained. On the other hand, for Markov models not equivalent to a DAG model—such as ordinary Markov models associated with undirected graphs, chain graphs, or acyclic directed mixed graphs—the orthogonal complement has not been characterized, impeding semi-parametric inference in these models. We derive closed form expressions for the orthogonal complement of the tangent space for general Markov models and illustrate our results by characterizing the class of influence functions for the conditional mean parameter in several graphical models.

UAI 2026

Semantic Self-Distillation for Language Model Uncertainty

Edward Phillips, Sean Wu, Fredrik K. Gustafsson, Boyan Gao, David A Clifton

Large language models present challenges for principled uncertainty quantification, in part due to their complexity and the diversity of their outputs. Semantic dispersion, or the variance in the meaning of sampled answers, has been proposed as a useful proxy for model uncertainty, but the associated computational cost prohibits its use in latency-critical applications. We show that sampled semantic distributions can be distilled into lightweight student models which estimate a prompt-conditioned density before the language model generates an answer token. The student model predicts a semantic distribution over possible answers; the entropy of this distribution provides a prompt-level uncertainty signal, and the probability density allows answer-level reliability evaluation. Across experiments on TriviaQA and MMLU, we find our student models perform competitively relative to the teacher’s sampled semantic dispersion on a hallucination prediction task, whilst offering additional uncertainty primitives for out-of-domain detection and multiple-choice answer selection. We term this technique Semantic Self-Distillation (SSD), which can serve as a general framework for distilling predictive uncertainty in complex output spaces beyond language.

UAI 2026

Bayesian Experimental Design via Score Matching

Angus Phillips, Gavin Kerrigan, Tom Rainforth

Policy-based approaches to Bayesian experimental design (BED) allow the learning of deep policy networks that adaptively make intelligent design decisions based on previously collected data. However, the training of such policies is often held back by a fundamental challenge: the double intractability of the expected information gain (EIG). This necessitates expensive or complex approximations that restrict the effort one can invest in optimising the policy itself. To address this, we show that the double intractability of the EIG can be isolated from the policy learning by first solving a score matching problem that is independent of the policy used, then using the learned score approximation to train the policy in a singly intractable manner. This turns the key multiplicative cost into an additive one and reduces the computational burden on the policy training itself, making it far cheaper to train the policy multiple times when needed, e.g. for architecture search, hyperparameter tuning, or avoiding local optima. In our experiments we train multiple competitive policies without inducing a multiplicative cost in likelihood evaluations, which can increase performance by allowing us to select the best policy even without performing hyperparameter or architecture searches.

UAI 2026

How Predicted Links Influence Network Evolution: Disentangling Choice and Algorithmic Feedback in Dynamic Graphs

Mathilde Perez, Raphael Romero, Jefrey Lijffijt, Charlotte Laclau

Link prediction models are increasingly used to recommend interactions in evolving networks, yet their impact on network structure is typically assessed from static snapshots. In particular, observed homophily conflates intrinsic interaction tendencies with amplification effects induced by network dynamics and algorithmic feedback. We propose a temporal framework based on multivariate Hawkes processes that disentangles these two sources and introduce an instantaneous bias measure derived from interaction intensities, capturing current reinforcement dynamics beyond cumulative metrics. We provide a theoretical characterization of the stability and convergence of the induced dynamics, and experiments show that the proposed measure reliably reflects algorithmic feedback effects across different link prediction strategies.

UAI 2026

Information Theoretic Bayesian Optimization over the Probability Simplex

Federico Pavesi, Antonio Candelieri, Noémie Jaquier

Bayesian optimization is a data-efficient technique that has been shown to be extremely powerful to optimize expensive, black-box, and possibly noisy objective functions. Many applications involve optimizing probabilities and mixtures which naturally belong to the probability simplex, a constrained non-Euclidean domain defined by non-negative entries summing to one. This paper introduces α-GaBO, a novel family of Bayesian optimization algorithms over the probability simplex. Our approach is grounded in information geometry, a branch of Riemannian geometry which endows the simplex with a Riemannian metric and a class of connections. Based on information geometry theory, we construct Matérn kernels that reflect the geometry of the probability simplex, as well as a one-parameter family of geometric optimizers for the acquisition function. We validate our method on benchmark functions and on a variety of real-world applications including mixtures of components, mixtures of classifiers, and a robotic control task, showing its increased performance compared to constrained Euclidean approaches.

UAI 2026

Higher-Order Hit- -Run Samplers for Linearly Constrained Densities

Richard D. Paul, Anton Stratmann, Johann F. Jadebeck, Martin Beyß, Hanno Scharr, David Rügamer, Katharina Nöh

Markov chain Monte Carlo (MCMC) sampling of densities restricted to linearly constrained domains is an important task arising in Bayesian treatment of inverse problems in the natural sciences. While efficient algorithms for uniform polytope sampling exist, much less work has dealt with more complex constrained densities. In particular, gradient information as used in unconstrained MCMC is not necessarily helpful in the constrained case, where the gradient may push the proposal’s density out of the polytope. In this work, we propose a novel constrained sampling algorithm, which combines strengths of higher-order information, like the target’s log-density’s gradients and curvature, with the Hit- -Run proposal, a simple mechanism which guarantees the generation of feasible proposals, fulfilling the linear constraints. Our extensive experiments demonstrate improved sampling efficiency on complex constrained densities over various constrained and unconstrained samplers.

UAI 2026

Breaking Bad: Component-Wise Parent Deletion for Score-Based Causal Discovery

Min Woo Park, Taehui Yun, YoungIn Jang, Yoonseok Yeom, Jonghwan Kim, Jiyeon Kang, Songseong Kim, Hyemin Jung, Sangmin Lee, Jongseong Jang, Sanghack Lee

Directed acyclic graphs (DAGs) are widely used to represent complex causal relationships in real-world systems. The goal of causal discovery is to learn the underlying DAG from data generated by these systems. While *Greedy Equivalence Search* (GES) is a well-established score-based algorithm for causal discovery, the GES family often suffers from scalability and sample complexity issues due to its large search space and susceptibility to local optima. In this paper, we introduce *parent deletion*, a novel, simple, yet powerful operator for score-based causal discovery. This operator is theoretically sound and effectively alleviates these limitations. Moreover, its simplicity enables seamless compatibility with existing score-based methods, and extensive experiments demonstrate consistent improvements across a wide range of settings. The source code used in this study is available at https://github.com/LGAI-Research/breaking-bad.

Keep browsing

More papers from top AI conferences

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