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 the Granularity of Causal Effect Identifiability

Yizuo Chen, Adnan Darwiche

The classical notion of causal effect identifiability is defined in terms of treatment and outcome variables. In this paper, we consider the identifiability of state-based causal effects: how an intervention on a particular _state_ of treatment variables affects a particular _state_ of outcome variables. We demonstrate that state-based causal effects may be identifiable even when variable-based causal effects may not. Moreover, we show that this separation occurs only when additional knowledge — such as context-specific independencies — is available. We further examine knowledge that constrains the states of variables, and show that such knowledge can improve both variable-based and state-based identifiability when combined with other knowledge such as context-specific independencies. We finally propose an approach for identifying causal effects under these additional constraints, and conduct empirical studies to further illustrate the separations between the two levels of identifiability.

UAI 2026

Finite-Sample Regret Analysis of Nash Q-Learning with Random-Feature Approximation

Yongshan Chen, Yuchen Hou, Zhuowen Zou, Calvin Yeung, Mohsen Imani, Tian Lan, Mahdi Imani

We study finite-sample equilibrium learning in episodic two-player zero-sum Markov games, where Nash equilibria coincide with minimax saddle points and Nash-Q style value iteration provides a natural algorithmic template. Existing analyses of Nash-Q style learning provide regret guarantees in tabular settings and under fixed linear realizability, but do not explicitly account for representation error arising from scalable nonlinear approximation. We propose an optimistic Nash Q-learning framework that replaces tabular/linear value representations with a hyperdimensional random-feature embedding—instantiated via random Fourier features to approximate a shift-invariant kernel—while retaining tractable ridge-style updates and per-state minimax stage-game computation. Our main results establish high-probability regret guarantees that decompose into a statistical uncertainty term governed by an effective-dimension complexity measure and an explicit additive approximation term induced by random-feature kernel approximation. The approximation term decreases with the embedding dimension, yielding a principled approximation–estimation tradeoff and recovering linear-style finite-sample behavior in the realizable regime. Empirically, we evaluate on a suite of episodic zero-sum benchmarks spanning tabular and continuous-state settings and observe stable learning behavior and performance trends consistent with the predicted dependence on representation dimension.

UAI 2026

Interactive Multi-Objective Probabilistic Preference Learning with Soft and Hard Bounds

Edward Chen, Sang T. Truong, Natalie Dullerud, Sanmi Koyejo, Carlos Guestrin

High-stakes decision-making involves navigating multiple competing objectives with expensive evaluations. For instance, in brachytherapy, clinicians must balance maximizing tumor coverage (e.g., an aspirational target or soft bound of >95

UAI 2026

SteinGate: Tail-Sensitive Safe Reinforcement Learning via Stein Discrepancy

Yassine Chemingui, Chenhua Fan, Honghao Wei, Janardhan Rao Doppa

Safe reinforcement learning typically enforces safety by bounding expected cumulative costs, a criterion that often fails to detect rare but catastrophic tail events. To overcome these limitations, this paper introduces SteinGate, a boundary-aware distributional safety certificate that replaces fragile tail fitting with a robust consistency check using Kernelized Stein Discrepancy while accounting for boundary atoms induced by clipped costs. SteinGate evaluates whether observed policy rollout costs remain consistent with a safe reference distribution, providing a non-parametric safety certificate. This certificate is used to dynamically adapt the learning regime: favoring reward-improving policy updates when rollouts remain consistent with the safe reference and switching to recovery behavior when the cost tail deviates. Experiments on continuous-control benchmarks demonstrate that SteinGate significantly reduces both the frequency and severity of constraint violations during training while maintaining competitive returns relative to state-of-the-art baselines.

UAI 2026

Linear Regression with Heteroskedastic Errors

Siddhant Chaudhary, Aditya Bhaskara

We study the classic linear regression problem under the challenging setting of heteroskedastic noise. We study a model in which we have n sources that each observe linear measurements of an unknown d-dimensional vector β. Each source has an unknown and distinct variance for the error, and the goal is to estimate the parameter vector β, under the assumption that there exist sufficiently many sources with small error (specifically, m sources have variance at most 1). Our results show that β can be estimated to sub-constant error, as long as the number of small-error sources, i.e., m, is large enough. We prove two main results. First, we show that even with just one observation per source, under minimal assumptions on the linear measurements, β can be estimated to sub-constant error when m ≥ n^1- 1/4d. Second, we show that if we have access to two observations per source, under similar assumptions on the linear measurements, β can be estimated to sub-constant error when m ≥ n^5/6. Our results are related to the recent line of work on mean estimation with heteroskedastic variances, and more specifically, the subset of signals model used in this literature. To the best of our knowledge, our results provide the first sub-constant recovery guarantees for regression in this model.

UAI 2026

Inference for quantile-parametrized families via CDF confidence bands

Srijan Chattopadhyay, Siddhaarth Sarkar, Arun K Kuchibhotla

Quantile-based distribution families are an important subclass of parametric families, capable of exhibiting a wide range of behaviors using very few parameters. These parametric models present significant challenges for classical methods, since the CDF and density do not have a closed-form expression. Furthermore, approximate maximum likelihood estimation and related procedures may yield non-√(n) and non-normal asymptotics over regions of the parameter space, making bootstrap and resampling techniques unreliable. We develop a novel inference framework that constructs confidence sets by inverting distribution-free confidence bands for the empirical CDF through the known quantile function. Our proposed inference procedure provides a principled and assumption-lean alternative in this setting, requiring no distributional assumptions beyond the parametric model specification and avoiding the computational and theoretical difficulties associated with likelihood-based methods for these complex parametric families. We demonstrate our framework on Tukey Lambda and generalized Lambda distributions, evaluate performance through simulation studies, and illustrate practical utility with applications to a small-sample dataset (Twin Study) and a large-sample dataset (Spanish household incomes).

UAI 2026

Robust Constrained Markov Games: Multi-Agent Decision-Making under Model Uncertainty and Constraints

Ningkang Chang, Chenyu Xu, Ziying Jia, Yue Wang, Sihong He

Multi-agent decision-making under both uncertainty and constraints is a central challenge in safety-critical domains such as autonomous driving, where agents must coordinate in uncertain environments while ensuring feasibility with respect to safety and resource limits. However, there is limited theoretical and practical work that addresses this challenge. Therefore, we introduce a Robust Constrained Markov Game (RCMG), the first multi-agent framework that simultaneously captures adversarial transition uncertainty and cost constraints. We further propose a solution concept, the Robust and Feasible Nash Equilibrium (RFNE), and a principled relaxation that yields a tractable surrogate upper bound to the intractable problem of computing an exact RFNE. This surrogate enables both a fixed-point existence proof via Kakutani’s theorem and a decentralized algorithm that alternates robust dynamic programming with Lagrangian dual updates. In settings where the relaxation is tight, the method provably recovers an exact RFNE. A grid-world experiment illustrates consistency with the theoretical results and highlights the viability of RCMGs as a foundation for reliable multi-agent decision-making under uncertainty and constraints.

UAI 2026

Group-Fair Allocations of Contiguous Blocks of Indivisible Items

Hau Chan, Minming Li, Yingchao Zhao, Shangkun Zheng

We study the problem of allocating contiguous blocks of indivisible items positioned on a line to a set of agents where agents are partitioned into different groups. In the problem, agents must be located on a line, and items allocated to each agent must be contiguous and form a connected block. We study the settings, considered by Suksompong [2019] and Wang et al. [2021], without and with the requirement that items are assigned to their closest agents, respectively. For both settings, we focus on allocations that satisfy intra-group envy fairness (IEF) and inter-group fair share (GFS). In both settings, we show that determining the existence of IEF or GFS allocations is NP-complete. When the number of agents or items is constant, we provide polynomial algorithms to determine the existence of IEF or GFS allocations for both settings. For both settings, we provide upper and lower bounds on the existence of IEF or GFS allocations as well as allocations that satisfy both IEF and GFS simultaneously.

UAI 2026

Neural Routed Boosting: Robust Learning against Heteroscedastic Noise

Puspak Chakraborty, Arun Rajkumar

Boosting algorithms such as AdaBoost have achieved widespread success by iteratively focusing on hard-to-classify instances. However, this aggressive re-weighting mechanism makes them susceptible to label noise and overfitting. While robust variants like Conditional Boosting handle this by estimating conditional risk, they rely on global statistical approximations. We propose Neural Routed Boosting, a novel ensemble framework that addresses heteroscedastic noise through a structural approach. Neural Routed Boosting utilizes a lightweight neural network to partition the input space into geometrically coherent regions, training specialized weak learners for each. This isolates noisy subspaces, preventing them from corrupting the decision boundaries of clean regions. We prove that the composite model of a neural router and region-specific experts constitutes a valid weak learner under the boosting framework, guaranteeing training error convergence. Experimental results on synthetic and real-world datasets demonstrate that Neural Routed Boosting outperforms traditional and robust boosting baselines, including Conditional Boosting, in high-noise environments.

UAI 2026

Robust Predictive Uncertainty and Double Descent in Contaminated Bayesian Random Features

Michele Caprio, Katerina Papagiannouli, Siu Lun Chau, Sayan Mukherjee

We propose a robust Bayesian formulation of random feature (RF) regression that accounts explicitly for prior and likelihood misspecification via Huber-style contamination sets. Starting from the classical equivalence between ridge-regularized RF training and Bayesian inference with Gaussian priors and likelihoods, we replace the single prior and likelihood with ϵ- and η-contaminated credal sets, respectively, and perform inference using pessimistic generalized Bayesian updating. We derive explicit and tractable bounds for the resulting lower and upper posterior predictive densities. These bounds show that, when contamination is moderate, prior and likelihood ambiguity effectively acts as a direct contamination of the posterior predictive distribution, yielding uncertainty envelopes around the classical Gaussian predictive. We introduce an Imprecise Highest Density Region (IHDR) for robust predictive uncertainty quantification and show that it admits an efficient outer approximation via an adjusted Gaussian credible interval. We further obtain predictive variance bounds (under a mild truncation approximation for the upper bound) and prove that they preserve the leading-order proportional-growth asymptotics known for RF models. Together, these results establish a robustness theory for Bayesian random features: predictive uncertainty remains computationally tractable, inherits the classical double-descent phase structure, and is improved by explicit worst-case guarantees under bounded prior and likelihood misspecification.

UAI 2026

Provably Efficient Personalized Multi-Objective Bandits with Proactive Conversational Queries

Linfeng Cao, Ming Shi, Ness Shroff

Personalized decision-making in multi-objective bandits requires learning user-specific trade-offs among competing objectives. Since arm utility depends on both unknown rewards and unknown preferences, existing methods infer preferences only from utility feedback, entangling preference learning with reward exploration. In practice, however, users often reveal their priorities through proactive conversational queries (e.g., “cheap and clean hotel”), yet this structured signal is not leveraged. We formalize a proactive query-based framework in which user queries provide structured preference signals. Modeling these signals via a Plackett–Luce subset choice model, we show that query-only learning is insufficient due to a fundamental shift-invariance barrier. To resolve this, we introduce MO-PQUCB, a hybrid algorithm that integrates query-based preference anchoring with bandit feedback through shift-invariant regularization and dual-exploration UCB. We prove that proactive queries accelerate preference estimation and yield improved regret scaling over prior preference-aware MO-MAB methods. Under corrupted queries, we further characterize statistical limits and design a robust estimator achieving near-optimal performance when corruption is sparse. Experiments validate both theoretical and practical gains.

UAI 2026

An Axiomatic Assessment of Entropy- and Variance-based Uncertainty Quantification in Regression

Christopher Bülte, Yusuf Sale, Timo Löhr, Paul Hofman, Gitta Kutyniok, Eyke Hullermeier

Uncertainty quantification is crucial in machine learning, yet most (axiomatic) studies of uncertainty measures focus on classification, leaving a gap in regression settings with limited formal justification and evaluations. In this work, we provide a formal way of representing uncertainty in continuous space, using a general parametric formulation, allowing for tractable analysis and evaluation of uncertainty measures. Within this framework, we propose a set of axioms that enable rigorous assessment of total, aleatoric, and epistemic uncertainty measures. Together, this allows for a theoretical examination of uncertainty measures and their corresponding properties. As a specific example, we compare the widely used entropy- and variance-based measures with respect to established predictive models and analyze their limitations and challenges in uncertainty quantification. Our work provides a principled way to understand and develop uncertainty measures in supervised regression, offering theoretical insights and practical guidelines for reliable uncertainty assessment.

UAI 2026

Uncertainty Quantification for Regression: A Unified Framework based on kernel scores

Christopher Bülte, Yusuf Sale, Gitta Kutyniok, Eyke Hullermeier

Regression tasks, notably in safety-critical domains, require reliable uncertainty quantification, yet the literature remains largely classification-focused. To address this, we introduce a family of measures for total, aleatoric, and epistemic uncertainty in multivariate regression based on strictly proper kernel scores. The framework provides a principled recipe for designing new uncertainty measures whose behavior, such as tail sensitivity or out-of-distribution responsiveness, is governed by the choice of the underlying kernel, while also encompassing existing measures under a joint analysis. We prove explicit correspondences between properties of the kernel and behavior of resulting uncertainty measures, yielding concrete design guidelines for practitioners. Extensive experiments across structured regression tasks, including spatial and functional domains, demonstrate effectiveness on downstream tasks such as out-of-distribution detection and active learning, and reveal that different kernel choices lead to distinct trade-offs, offering practitioners guidance for task-specific selection.

UAI 2026

Model Merging as Probabilistic Inference in Fine-Tuning Parameter Space

Long Minh Bui, Tuan Anh Le Van, Tung Phi Duc, Phi Le Nguyen, Jana Doppa, Trong Nghia Hoang

Model merging aims to combine existing single-task solutions into a multi-task solution without additional data-driven fine-tuning. Most existing approaches achieve this using geometric properties of local solution spaces. However, such geometric views provide limited guidance for scoring how statistically useful each task-specific update direction is across tasks during merging. To address this, we formulate model merging from a new perspective of probabilistic inference under a product-of-experts (PoE) scenario where each single-task solution defines an energy-based expert model (EBM) over the merged parameters. We show that several existing model merging methods arise as special cases of our framework under energy designs that impose implicit Gaussian assumptions on directional residuals between merged and task-specific models. Empirically, we find that these residuals are often heavy-tailed which exposes a mismatch with the imposed light-tailed Gaussian structures. We address this with a heavy-tailed PoE design based on Cauchy experts, which better captures the observed residual behavior while admitting a provably convergent inference procedure. Experiments across multiple tasks and architectures show significant improvements over state-of-the-arts baselines. Our code is available at https://github.com/MinhLong210/PoE-EBM-Merging.git.

UAI 2026

Causal Discovery with Metadata-Informed Latent Types

Philippe Brouillard, Alexandre Drouin, Dhanya Sridhar

Causal discovery seeks to recover causal structure from data but the underlying graph is typically identifiable only up to its Markov equivalence class. Yet real-world systems often exhibit redundancy, where groups of variables share similar causal roles. We introduce a Bayesian causal discovery framework that leverages variable-level metadata to infer latent types and constrain causal interactions across variables. We model causal graphs as type-consistent DAGs and propose t-DiBS, a fully differentiable method that jointly learns variable types, graph structure, and metadata representations. Our approach enables principled uncertainty quantification and integrates expressive neural models for metadata. We provide theoretical results showing that, under structured assumptions, metadata combined with typing can improve identifiability beyond classical limits. Empirically, we demonstrate improved performance over standard causal discovery methods on synthetic and pseudo-real datasets, with detailed analysis demonstrating the benefit of joint type and structure learning. These results establish metadata-driven typing as a principled approach to identifiable causal discovery.

UAI 2026

Task Expansion and Cross Refinement for Open-World Conditional Modeling

Shreyas Bhat Brahmavar, Qiyang Liu, Yang Li, Junier Oliva

Open-world conditional modeling (OCM), requires a single model to answer arbitrary conditional queries across heterogeneous datasets, where observed variables and targets vary and arise from a vast open-ended task universe. Because any finite collection of real-world datasets covers only a small fraction of this space, we propose Task Expansion and Cross Refinement (TEXR), a semi-supervised framework that enlarges effective task coverage through structured synthesis and refinement of semantic data contexts. TEXR first generates diverse uninstantiated dataset schemas and weakly instantiates them via structured probabilistic generators guided by large language models. It then performs cross-model refinement by training on disjoint data partitions and revising synthetic values across splits to reduce confirmation bias and improve pseudo-value quality. The refined synthetic datasets are aggregated with real data to train a unified conditional model. Across heterogeneous tabular benchmarks, TEXR consistently improves zero-, few-, and many-shot performance for multiple OCM backbones, demonstrating that structured task expansion and cross refinement enhance open-world conditional modeling.

UAI 2026

Bayesian Symbolic Regression with Entropic Reinforcement Learning

Oussama Boussif, Mohammed Mahfoud, Younesse Kaddar, Moksh Jain, Sida Li, Damiano Fornasiere, Xiaoyin Chen, Yoshua Bengio, Esmeralda S. Whitammer

Symbolic regression is the problem of finding an algebraic expression describing a stochastic dependence of a target variable on a set of inputs. Unlike forms of regression that fit parameters assuming a fixed model structure, symbolic regression is a search problem over the space of expressions, represented, for example, as abstract syntax trees using a library of operators. Symbolic regression is typically used in settings with limited, noisy data in the natural sciences. However, searching for a single best-fitting expression fails to capture the epistemic uncertainty about the expression, which motivates a Bayesian perspective that enables uncertainty quantification and specification of natural priors to constrain the search space. In this work, we propose ERRLESS (Entropy-Regularized Reinforcement Learning for Expression Structure Sampling), a scalable approach for sampling from the posterior distribution over expressions given data using maximum-entropy reinforcement learning. ERRLESS learns a neural policy that constructs expressions sequentially by building up their abstract syntax trees. At convergence, the policy samples expressions from the posterior. At test time, expressions can be sampled by rollouts of this policy. We demonstrate that ERRLESS achieves competitive results on the Feynman benchmark while producing short and interpretable expressions. Additionally, we demonstrate that the mean of the posterior predictive approximated by ERRLESS achieves a high coefficient of determination (R^2) compared to an SMC baseline, highlighting the benefits of the Bayesian perspective in symbolic regression.

UAI 2026

Fundamental Limits and Optimal Methods for Sharp Analytical Causal Bounds in Instrumental Variable Models

Arefe Boushehrian, Mohammad Reza Badri, Sina Akbari, Negar Kiyavash

Bounding causal effects analytically, rather than numerically, is appealing for its interpretability and conceptual clarity. Existing sharp methods rely on optimization-based approaches such as the Balke–{Pearl} framework, whose computational complexity grows rapidly. An alternative line of work derives bounds heuristically using probability laws and generic inequalities, and some recent papers have claimed or conjectured that this approach can yield sharp analytical bounds with substantially lower complexity. In this paper, we show that this perceived advantage is illusory. In particular, in a discrete instrumental variable setting, we show that any sharp analytical bound for the average treatment effect must be expressible as a maximum (minimum) over a collection of linear terms whose cardinality grows exponentially in the number of values taken by the outcome. In parallel, we show that the number of instrumental variable inequalities itself also grows exponentially. Consequently, bounds and inequalities expressed using only polynomially many such terms cannot be sharp. As a constructive complement, the paper is accompanied by codes implemented in python and R to derive sharp analytical bounds and sharp inequalities with optimal computational complexity, matching the lower bounds proven in this paper. These codes are available \href{https://github.com/ArefeBoushehrian/Analytical-Causal-Bounds-in-Instrumental-Variable-Models}{online}.

UAI 2026

Pareto-Optimal Probabilistic Explanations: Balancing Cognitive Constraints and User Preferences

Louènas Bounia

Machine learning classifiers deployed in critical domains require comprehensible explanations. Abductive explanations identify minimal feature sets guaranteeing a decision but suffer from two limitations: exceeding human cognitive limits and ignoring user preferences (actionability, fairness, cost). Probabilistic explanations reduce size via controlled error, while preferred explanations integrate preferences; however, these approaches remain disjoint. We introduce the first framework unifying these paradigms: preferred probabilistic explanations balancing cognitive constraints, probabilistic accuracy, and user preferences. We formulate the problem via weighted scalarization **WPPE** and Pareto optimization PPPE, prove **NP**-hardness for decision trees, and exploit supermodularity to establish approximation guarantees. We propose three complementary algorithms: weighted greedy descent **WGD** with ratio (e^p_w-1)/p_w, Pareto frontier enumeration **PFE** for interactive exploration of non-dominated trade-offs, and lexicographic stratified algorithm **LSA** for strict ordinal preferences. Our framework enables rigorous navigation of the Pareto-optimal trade-off space between cognitive limits and user preferences.

UAI 2026

Proximal Policy Optimization Suffices for On-Policy Reinforcement Learning

Rayane Bouftini, Mohammed Benzaouia

Proximal Policy Optimization (PPO) has been applied to a wide range of applications, from robotics to large language models (LLMs). Yet, despite its success, it still suffers from unstable updates, performance collapse, and extreme sensitivity to hyperparameters. Many alternatives have been proposed to alleviate these issues, often demonstrating empirically stronger performance on standard reinforcement learning (RL) benchmarks. In this work, we observe that PPO’s training instability fundamentally stems from the brittle inter-coupling between its surrogate optimization hyperparameters which jointly dictate the effective size of policy updates. This complex coupling makes tuning quite difficult and, in practice, often leaves PPO under-performing. To mitigate this, we introduce a criterion on trajectories generated by behavior and target policies which can be used as an early stopping rule. This formulation effectively decouples the optimization dynamics, allowing the algorithm to adaptively scale its updates using a single threshold parameter. We additionally find a scaling law between this threshold parameter and the number of trajectory batches collected, further reducing the tuning burden. Using this simple criterion, we evaluate PPO on continuous control tasks from the DM Control Suite, outperforming prior policy gradient methods and revealing that many reported improvements were largely artifacts of under-performing PPO baselines.

Keep browsing

More papers from top AI conferences

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