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

IDCR: Information-Directed Conformal Retrieval

Manas Nanivadekar, Jatin Khanijoan, Swayam Kothekar, Mohd Amaan Khan

Retrieval-augmented prediction systems select documents by semantic similarity, ignoring their effect on downstream predictive uncertainty. In high-stakes domains such as clinical diagnosis, this can yield overconfident or needlessly imprecise predictions. We propose Information-Directed Conformal Retrieval, a framework that selects documents to minimize the volume of conformal prediction sets while preserving distribution-free coverage. Modeling each document as a Bayesian precision update, we show that minimizing conformal volume is exactly equivalent to maximizing a log-determinant objective, and prove this objective monotone submodular, so greedy selection inherits the constant-factor (1-1/e) guarantee. A Document Interaction Tensor characterizes corpus-level interaction structure, and a lightweight marginal-gain-separation gate routes uncertain retrieval steps to lookahead search. On MIMIC-IV clinical diagnosis (275 admissions from 100 patients, 9273 PubMed abstracts), greedy retrieval attains a mean greedy-to-optimal ratio of 0.9999, produces conformal ellipsoids 4.8 times smaller than random retrieval and 5.8 times smaller than cosine retrieval while retaining the distribution-free coverage guarantee, and two-step lookahead closes 77 percent of the remaining gap. Gains generalize to the SciQ and GoEmotions benchmarks, and on GoEmotions and LexGLUE the method yields tighter posterior uncertainty than learned and uncertainty-aware retrieval baselines. Complex multi-morbid patients benefit most, with twice the synergy-gap rate, precisely where prediction is hardest.

UAI 2026

Online Bootstrap Inference for the Trend of Nonstationary Time Series

Thomas Nagler, Tobias Brock, Nicolai Palm

This article proposes an online bootstrap scheme for nonparametric level estimation in nonstationary time series. Our approach applies to a broad class of level estimators expressible as weighted sample averages over time windows, including exponential smoothing methods and moving averages. The bootstrap procedure is motivated by asymptotic arguments and provides well-calibrated uniform-in-time coverage, enabling scalable uncertainty quantification in streaming or large-scale time-series settings. This makes the method suitable for tasks such as adaptive anomaly detection, online monitoring, or streaming A/B testing. Simulation studies demonstrate good finite-sample performance of our method across a range of nonstationary scenarios. In summary, this offers a practical resampling framework that complements online trend estimation with reliable statistical inference.

UAI 2026

Model Agnostic Graph Prompt Learning for Crystal Property Prediction

Shrimon Mukherjee, KISHALAY DAS, Partha Basuchowdhuri, Pawan Goyal, Niloy Ganguly

Graph Neural Networks have emerged as a powerful tool for the fast and accurate prediction of various crystal properties. These models often encode domain-specific knowledge into their graph encoding modules, which increases their parameter size and makes their performance heavily dependent on domain expertise. Added to this, explicitly incorporating all chemical and structural features, that might influence a specific crystal property into the GNN encoder, is a challenging task. In this work, we propose a soft prompt learning framework that captures latent features essential for property prediction, which are not explicitly provided to the GNN. We introduce a novel multilevel graph prompt learning framework comprising both node-level and graph-level soft prompts. At the node level, we capture the local chemical semantics of different atom types, while at the graph level, we encode the global structural symmetry of the crystal graph. Our proposed prompt learning framework is lightweight and seamlessly integrates with any existing GNN encoder. Extensive experiments on popular benchmark datasets show that incorporating prompt learning significantly improves (3

UAI 2026

Learning to Infer Fast by Attending to Sparse Temporal Observations

Mehrnaz Motamed, Harry Bendekgey, Debora Sujono, Erik B Sudderth

Many scientific datasets contain sparse, irregular observations of dynamic processes. Fast inference techniques are required to infer the unseen evolution of physical systems underlying growing datasets, and estimate the parameters that govern them. We first accelerate the convergence of Gauss-Markov Variational Inference via efficient natural gradient computation and automatic step-size adaptation. We then propose two general-purpose schemes for initialization from sparse data, one using junction tree representations of Gauss-Markov distributions, and another attention-based neural network architecture that learns to predict correlated temporal posteriors. We show that these initializers dramatically improve performance for ecological models of soil decomposition and predator-prey dynamics. We further extend our methods to a semiparametric epidemiological model of SARS-CoV-2 RNA wastewater measurements, which uses Gaussian processes to model uncertainty in latent reproduction numbers. Our methods allow for quick inference of both local states and global dynamical parameters, and unlike prior work, can be applied even when measurements are sparse and the generative process is not fully known.

UAI 2026

Causal Reasoning with Bipartite Graphical Causal Models

Joris M. Mooij

Causal Bayesian networks (CBNs) and structural causal models (SCMs) are the dominant frameworks for graphical causal reasoning, but they cannot adequately represent all real-world causal systems. In particular, systems at equilibrium—where feedback mechanisms create cyclic causal dependencies—can exhibit causal semantics that are fundamentally incompatible with these frameworks: different interventions that enforce the same variable value may have different effects, rendering the standard “perfect intervention” do(X=x) ambiguous. We propose _bipartite graphical causal models_ (BGCMs), in which the structure of a system of equations is encoded by a bipartite graph with variable and equation nodes. In this framework, a hard intervention do(f_j : X_v=ξ_v) specifies which equation is replaced, which variable is targeted, and at what value—resolving the ambiguity of the standard notion. We demonstrate, through a detailed case study of a physical system, that this representation naturally corresponds to distinct real-world interventions. We formulate a Markov property in terms of a new graphical separation criterion (B-separation) that exploits the functional determinism inherent in the equations, and we extend it to settings with non-random inputs. We show how this gives rise to a do-calculus for reasoning about domain invariances. BGCMs strictly generalize CBNs and SCMs while retaining the ability to perform graphical causal reasoning.

UAI 2026

Wasserstein Gradient Flows for Scalable and Regularized Barycenter Computation

Eduardo Fernandes Montesuma, Yassir Bendou, Mike Gartrell

Wasserstein barycenters provide a principled approach for aggregating probability measures, while preserving the geometry of their ambient space. Existing discrete methods are not because as they assume access to the complete set of samples from the input measures. Meanwhile, neural network approaches do scale well, but rely on complex optimization problems and cannot easily incorporate label information. We address these limitations through gradient flows in the space of probability measures. Through time discretization, we achieve a scalable algorithm that i) relies on mini-batch optimal transport, ii) accepts modular regularization through task-aware functions, and iii) seamlessly integrates supervised information into the ground-cost. We empirically validate our approach on domain adaptation benchmarks that span computer vision, neuroscience, and chemical engineering. Our method establishes a new state-of-the-art Wasserstein barycenter solver, with labeled barycenters consistently outperforming unlabeled ones. Our code at https://github.com/SigmaNova/barycentric-gradient-flows

UAI 2026

Learning Stable Digraphs from Sparse-Input Linear Structural Causal Models

Panagiotis Misiakos, Markus Püschel

We propose StableSpIn, a continuous optimization framework for learning potentially cyclic causal directed graphs (digraphs) in linear structural equation models via a spectral-radius constraint on the absolute adjacency matrix. Our motivation is twofold: first, stability is a natural requirement for linear structural models; second, the contractive cycles that stability induces facilitate the identifiability of digraphs. We formulate causal discovery as a likelihood-based optimization problem under a sparse-input assumption, yielding a scalable algorithm applicable to both cross-sectional and time-series data. Unlike prior continuous acyclicity constraints, our stability regularizer is cheaper to evaluate while accommodating general digraphs, yielding faster optimization in practice. Experiments on synthetic benchmarks show improved graph recovery over state-of-the-art baselines, and empirical studies on U.S., European, and Swiss equity markets reveal interpretable cyclic dependencies that persist across time windows. Our implementation is available at https://github.com/pmisiakos/StableSpIn.

UAI 2026

Long term sequential decision making under risk

Mohammad Mirzanejad, Nadjet Bourdache, Abdel-Illah Mouaddib

We study finite-horizon MDP planning under root-based (resolute) risk objectives that apply a rank-dependent functional to the distribution of total returns. Such objectives are non-linear in the return distribution and generally break Bellman optimality, so direct optimization by scenario-tree enumeration is intractable. We propose ERQDP, an enumeration-free and sampling-free method that solves a rank–quantile surrogate via exact DP (Dynamic Programming), evaluates candidate policies exactly by DP over return Probability Mass Functions (PMFs) on a discretized return grid (with an explicit rounding bound), and refines the surrogate in an anytime loop that reports an explicit upper–lower gap (certificate) for the target objective up to discretization budgets. Across tested benchmarks, ERQDP returns certified solutions or explicit residual gaps, enables fast risk-parameter sweeps with substantial runtime gains, and supports both risk-averse and risk-seeking behaviors.

UAI 2026

Robust estimation of graphical models with measurement error: False discovery control and sensitivity analysis

Shira Mingelgrin, Y. Samuel Wang

This paper addresses the problem of learning Gaussian graphical models from data contaminated by additive measurement error. Applying traditional procedures to the noisy data may result in many false discoveries. On the other hand, existing procedures that explicitly account for measurement error assume that the measurement error covariance is known or can be estimated precisely. We provide two practical alternatives for the common setting where this side information is not available. The first proposed method follows a partial identification approach and estimates a graph with controlled false discovery rate when given an upper bound on the measurement error variances. In many settings, the precise variance of the errors is unknown, but the scientist may still confidently specify an upper bound. The second framework is a sensitivity analysis that assesses the minimum amount of measurement error required to explain away an estimated edge. This yields an interpretable measure for practitioners to assess which estimated edges are robust and which may be simply due to measurement error. We derive theoretical guarantees and show good empirical performance in simulations. We further illustrate the practical utility of our procedures on a single-cell mRNA sequencing dataset.

UAI 2026

Globally Optimal Multi-Object Tracking with Splitting and Merging

Mihaela Mihaylova, Jelle Piepenbrock, Johannes Textor

In multi-object tracking (MOT), the trajectories of moving objects – e.g., molecules, cells, or people – must be recovered from detected positions. MOT is often solved using network flow approaches to find globally optimal solutions. Here, we consider a version of MOT where objects can split or merge – such as cells that are moving but also dividing while being tracked. We show that this problem is NP-hard, phrase it as a Max-SAT problem, and ask: (1) To what extent can modern optimized satisfiability solvers be applied to realistic MOT problems? (2) Are the globally optimal solutions better than those generated by existing methods? Using both simulated data and real-world cell tracking data, we show that Max-SAT is a computationally costly but feasible approach that can lead to substantially improved solutions for problems of realistic size. We hope that the Max-SAT instances generated by the MOT problem can serve as practically relevant benchmarking cases for the future improvement of Max-SAT solvers.

UAI 2026

Exact Uncertainty Propagation via Gaussian Process Neurons

Qiuxian Meng, Yongyou Zhang

Exact marginalization in deep Gaussian processes (DGPs) is analytically intractable, typically requiring computationally costly sampling-based approximations. We introduce the Gaussian process neuron, a computational unit built on a novel Wasserstein exponential kernel. By defining a composable map between factorized Gaussian measures, this unit enables analytical uncertainty propagation; concurrently, optimizing deterministic inducing variables via maximum a posteriori estimation ensures strict probabilistic rigor. By eliminating sampling variance and the depth-scaling computational bottlenecks of Monte Carlo methods, our approach enables exact probabilistic variants of diverse architectures, including DGPs, multilayer perceptrons, and Kolmogorov-Arnold Networks. Empirically, these networks demonstrate superior uncertainty calibration relative to state-of-the-art approximate DGP frameworks, alongside high-dimensional scalability and robust compositional expressiveness.

UAI 2026

Conformal Graph Prediction with Z-Gromov Wasserstein Distances

Gabriel Melo, Thibaut de Saivre, Anna Calissano, Florence d’Alché-Buc

Supervised graph prediction addresses regression problems where the outputs are structured graphs. Although several approaches exist for graph-valued prediction, principled uncertainty quantification remains limited. We propose a conformal prediction framework for graph-valued outputs, providing distribution-free coverage guarantees in structured output spaces. Our method defines nonconformity via the Z-Gromov–Wasserstein distance, instantiated in practice through Fused Gromov–Wasserstein (FGW), enabling permutation-invariant comparison between predicted and candidate graphs. To obtain adaptive prediction sets, we introduce Score Conformalized Quantile Regression (SCQR), an extension of Conformalized Quantile Regression (CQR) to handle complex output spaces such as graph-valued outputs. We evaluate the proposed approach on a synthetic task and a real problem of molecule identification.

UAI 2026

Causal Discovery in Mixtures of Populations

Bijan Mazaheri, Spencer L. Gordon, Yuval Rabani, Leonard Schulman

Causal discovery aims to learn causal structures up to certain symmetries. Diverse populations or changing environments give rise to heterogeneous data in the following sense: each population/environment is a “source” which idiosyncratically determines the forms of causal effects. From this perspective, the source is a latent common cause for every observed variable. While some methods for causal discovery can work around latent confounding in special cases, a global confounder poses a significant challenge. The only known ways to deal with latent global confounding involve making assumptions that limit structural equations and/or noise functions. We demonstrate that globally confounded causal structures can still be identified with arbitrary structural equations and noise functions, so long as the number of latent classes remains small relative to the size and sparsity of the underlying DAG. The approach relies on agglomerating variables into large-enough matrices of moments, whose ranks directly reveal graphical properties of the causal structure. We also provide a statistical test to test the rank of these matrices.

UAI 2026

Relaxing Faithfulness with Intervention-Only Causal Discovery

Bijan Mazaheri, Jiaqi Zhang, Caroline Uhler

Causal discovery algorithms learn a network that describes the causal dependencies among random variables. A common workflow involves first utilizing conditional independence properties on observational data to determine partially directed causal relationships, then applying interventions to orient the unknown causal directions. A critical assumption for the first step is faithfulness: a requirement that causally linked variables exhibit statistical dependence. Many natural systems include buffering and stabilizing pathways that cancel out to achieve systemic robustness. This cancellation of pathways violates faithfulness, leading causal discovery algorithms to incorrectly remove causal dependencies. In this paper, we argue that hard interventions contain information about the presence/absence of causal linkage that is overlooked in the first stage of structure discovery. We show that a mild assumption — called intervention-immediacy faithfulness — that allows cancellations, is sufficient to nonparametrically identify causal structures with hard interventions. These results position interventions as the primary carriers of information about causal structure, which should take precedence over conditional independence testing. To flip the paradigm, we also specify equivalence classes when the identification criteria are not met due to limitations in the scope of interventions.

UAI 2026

Meta-Dependence in Conditional Independence Testing

Bijan Mazaheri, Jiaqi Zhang, Caroline Uhler

Conditional independence testing is a critical component of feature screening, invariant statistical models, and causal discovery. Many of these algorithms rely on the sequential application of conditional independence tests, and their stability hinges on how their outcomes interact. We study this "meta-dependence" between conditional independence properties using the following geometric intuition: satisfying each conditional independence property constrains the space of possible joint distributions to a manifold. The "meta-dependence" of multiple conditional independences in a probability distribution is informed by its position relative to these manifolds. We provide a simple-to-compute measure of this meta-dependence using moment projections, with a closed-form expression for multivariate Gaussian distributions, and consolidate our findings empirically using both synthetic and real-world data. Our measure of meta-dependence does not rely on graphical properties of the distribution and can be computed directly from summary statistics such as a covariance matrix, allowing for various applications. We demonstrate one use case of meta-dependence, using a simple redundancy metric to tune significance thresholds and improve causal discovery.

UAI 2026

Provable Guarantees For Robust Feature Selection in Sparse Linear Models in High-Dimensions

Deepak Maurya, Adarsh Barik, Jean Honorio

We study feature selection (support recovery) in sparse linear models, including linear and logistic regression, under a strong adversarial contamination model where an adversary can arbitrarily corrupt a constant fraction of samples in the high-dimensional regime. Most of the existing methods target one or two aspects of this interesting problem: (1) achieving robustness against strong adversaries, (2) handling adversarial corruption in both features and labels, and (3) performing feature selection in high dimensions. Our approach tackles all three issues simultaneously. We propose a trimmed maximum likelihood estimator with ℓ_1-regularization, leading to a non-convex relaxation of an NP-hard combinatorial optimization problem. We prove that any locally optimal solution to this non-convex problem achieves near-minimax optimal statistical rates, up to logarithmic factors. Critically, our method recovers the true support in a computationally efficient manner despite the intractability of the exact formulation. The resulting sample complexity scales only logarithmically with the ambient dimension, making it well-suited for high-dimensional settings. Furthermore, our framework accommodates heavy-tailed noise distributions under mild moment assumptions, requiring only that the fourth moment be bounded. We also validate our theoretical findings empirically.

UAI 2026

AudiFair: Privacy-Preserving Framework for Auditing Fairness

Elisaweta Masserova, Kshitij Kulkarni, Antigoni Polychroniadou, Ron D. Rothblum, Akira Takahashi

Ensuring fairness in AI is challenging, especially when privacy concerns prevent access to proprietary models and training data. We propose a cryptographic framework for auditing fairness without requiring model disclosure. Unlike existing solutions – which either fail to capture attack vectors enabling dishonest model providers to pass audits unfairly, or require continuous auditing during deployment involving real-world users – our framework is the first to simultaneously achieve the following: (1) Model Privacy: Proprietary model details remain hidden from verifiers; (2) A dishonest model provider cannot cause a non-compliant model to pass the fairness audit without detection by the verifier; (3) Pre-deployment Certification: The certification can be conducted entirely prior to deployment, without requiring interaction with or data from real-world users; (4) Test Data Transparency: Test data for auditing is generated in a transparent and accountable way, preventing dishonest parties from manipulating it. We achieve these goals by carefully combining cryptographic commitments, coin tossing, and zero-knowledge proofs. We evaluate our protocol on decision trees, XGBoost, and neural networks. Our results confirm the practicality of our approach: for a dataset with 10,000 samples and 10 features, and an XGBoost model with 100 trees of depth 3, proof generation takes 42 seconds and verification takes 2 seconds.

UAI 2026

cc-Shapley: Measuring Multivariate Feature Importance Needs Causal Context

Jörg Martin, Stefan Haufe

Explainable artificial intelligence promises to yield insights into relevant features, thereby enabling humans to examine and scrutinize machine learning models or even facilitating scientific discovery. Considering the widespread technique of Shapley values, we find that purely data-driven operationalization of multivariate feature importance is unsuitable for such purposes. Even for simple problems with two features, spurious associations due to collider bias and suppression arise from considering one feature only in the observational context of the other, which can lead to misinterpretations. Causal knowledge about the data-generating process is required to identify and correct such misleading feature attributions. We propose cc-Shapley (causal context Shapley), an interventional modification of conventional observational Shapley values leveraging knowledge of the data’s causal structure, thereby analyzing the relevance of a feature in the causal context of the remaining features. We show theoretically that this eradicates spurious association induced by collider bias. We compare the behavior of Shapley and cc-Shapley values on various, synthetic, and real-world datasets. We observe nullification or reversal of associations when moving from observational to cc-Shapley.

UAI 2026

Learning Latent Energy-Based Models via Interacting Particle Langevin Dynamics

Joanna Marks, Tim Y. J. Wang, Omer Deniz Akyildiz

We develop interacting particle algorithms for learning latent variable models with energy-based priors. To do so, we leverage recent developments in particle-based methods for solving maximum marginal likelihood estimation (MMLE) problems. Specifically, we provide a continuous-time framework for learning latent energy-based models, by defining stochastic differential equations (SDEs) that provably solve the MMLE problem. We obtain a practical algorithm as a discretisation of these SDEs and provide theoretical guarantees for the convergence of the proposed algorithm. Finally, we demonstrate the empirical effectiveness of our method on synthetic and image datasets.

UAI 2026

Learning plug-in surrogate endpoints for randomized experiments

Alessandro-Umberto Margueritte, Ahmet Zahid Balcıoğlu, Jesse H. Krijthe, Dave Zachariah, Fredrik D Johansson

Surrogate endpoints are used in place of long-term outcomes in randomized experiments when observing the real outcome for a large enough cohort is prohibitively expensive or impractical. A short-term surrogate is good if the result of an experiment using the surrogate is predictive of the result of a hypothetical study using the real outcome. Much attention has been paid to formalizing this property in causal terms, but most criteria are unidentifiable and cannot be turned into practical algorithms for learning surrogate endpoints from data. To address this, we study plug-in composite surrogates, functions of post-treatment variables that may be substituted directly for the primary outcome in a randomized experiment. We propose two methods for learning plug-in surrogates that maximize effect predictiveness, and characterize the possibility of finding endpoints that yield unbiased effect estimates in representative scenarios. Finally, in both synthetic experiments with known effects and in data from a real-world experiment, we find that our method, based on directly modeling the surrogate effect, returns plug-in endpoints more predictive of the primary effect than established methods.

Keep browsing

More papers from top AI conferences

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