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

Likelihood hacking in probabilistic program synthesis

Jacek Karwowski, Younesse Kaddar, Zihuiwen Ye, Esmeralda S. Whitammer, Sam Staton

When language models are trained by reinforcement learning (RL) to write probabilistic programs, they can artificially inflate their marginal-likelihood reward by producing programs whose data distribution fails to normalise instead of fitting the data better. We call this failure likelihood hacking (LH). We formalise LH in a core probabilistic programming language (PPL) and give sufficient syntactic conditions for its prevention, proving that a safe language fragment L_safe satisfying these conditions cannot produce likelihood-hacking programs. Empirically, we show that GRPO-trained models generating PyMC code discover LH exploits within the first few training steps, driving violation rates well above the untrained-model baseline. We implement L_safe’s conditions as SafeStan, a LH-resistant modification of Stan, and show empirically that it suppresses LH under optimisation pressure. These results show that language-level safety constraints are both theoretically grounded and effective in practice for automated Bayesian model discovery.

UAI 2026

COBALT: Censored Optimization and Bayesian Active Learning Techniques

Andrea Karlova, Rishabh Kabra, Daniel Augusto de Souza, Brooks Paige

We target Bayesian Active Learning (AL) and Optimization (BO) for censored data regimes. While the Tobit likelihood accurately models such clipped observations, its mixed continuous-discrete nature impedes the analytical evaluation of information-theoretic acquisition functions. To address this, we investigate Censored Optimization via Bayesian Active Learning Techniques (COBALT). We establish rigorous theoretical guarantees for this framework, proving posterior consistency and the asymptotic normality of the MAP estimator under greedy maximization. Central to our framework is the derivation of a closed-form entropy for the Censored Normal distribution, enabling an analytical BALD (Bayesian Active Learning by Disagreement) score compatible with any Gaussian posterior approximations. We further underpin this method by deriving a numerically stable Evidence Lower Bound (ELBO) for censored atoms, utilizing robust approximations of the log-normal cumulative density. Empirical evaluations using our open-source implementation demonstrate COBALT’s best accuracy–compute trade-off among censored-likelihood methods in learning GP posteriors and effectiveness on a variety of benchmarks.

UAI 2026

Conditional Diffusion Models for Imbalanced Tabular Regression

Nathaniel Kang

Imbalanced regression, where certain continuous target ranges are severely underrepresented, poses a fundamental challenge for predictive modeling under uncertainty. Existing oversampling methods rely on local interpolation, which fails to capture complex conditional distributions in rare target regions. We propose TabOversample, a conditional diffusion framework that generates high-fidelity synthetic tabular samples for underrepresented targets via a relevance-weighted denoising objective. We establish four theoretical results: equivalence of relevance weighting to maximum likelihood under a reweighted measure, targeted probability mass amplification in rare regions, quality guarantees for generate-then-filter sampling through order statistics, and a formal connection to distributionally robust optimization over a chi-squared uncertainty set. Across nine benchmark imbalanced regression datasets—four numerical-dominant and five categorical-rich—and against thirteen oversampling and reweighting baselines evaluated over ten seeds, TabOversample attains the best relevance-weighted error (SERA) on eight of nine datasets and the best rare-region RMSE on all nine, substantially improving prediction accuracy in rare target regions while maintaining overall performance.

UAI 2026

Information-Theoretic Bayesian Optimization for Bilevel Optimization Problems

Takuya Kanayama, Yuki Ito, Tomoyuki Tamura, Masayuki Karasuyama

A bilevel optimization problem consists of two optimization problems nested as an upper- and a lower-level problem, in which the optimality of the lower-level problem defines a constraint for the upper-level problem. This paper considers Bayesian optimization (BO) for the case that both the upper- and lower-levels involve expensive black-box functions. Because of its nested structure, bilevel optimization has a complex problem definition, by which bilevel BO has not been widely studied compared with other standard extensions of BO such as multi-objective or constraint problems. We propose an information-theoretic approach that considers the information gain of both the upper- and lower-optimal solutions and values. This enables us to define a unified criterion that measures the benefit for both level problems, simultaneously. Further, we also show a practical lower bound based approach to evaluating the information gain. We empirically demonstrate the effectiveness of our proposed method through several benchmark datasets.

UAI 2026

Who Guards the Guardians? The Challenges of Evaluating Identifiability of Learned Representations

Shruti Joshi, Théo Saulus, Wieland Brendel, Philippe Brouillard, Dhanya Sridhar, Patrik Reizinger

Identifiability in representation learning is commonly evaluated using standard metrics (e.g., *MCC, R^2, DCI*) on synthetic benchmarks with known ground-truth factors. These metrics are assumed to reflect recovery up to the equivalence class guaranteed by identifiability theory. We show that this assumption holds only under specific structural conditions: each metric implicitly encodes assumptions about both the data-generating process (DGP) and the encoder. When these assumptions are violated, metrics become misspecified and can produce systematic false positives and false negatives. Such failures occur both within classical identifiability regimes and in post-hoc settings where identifiability is most needed. We introduce a taxonomy separating DGP assumptions from encoder geometry, use it to characterise the validity domains of existing metrics, and release an evaluation suite for reproducible stress testing and comparison.

UAI 2026

PRISM: Calibrated Bayesian Fusion and Auditable Attribution for Reliable LLM Event Prediction from Text

Chengyuan Jin, Daojian Zeng, Kang Liu, Jun Zhao, Yubo Chen

We study event prediction from news text when intermediate drivers are not expert-annotated. Directly prompting large language models (LLMs) for forecast probabilities can yield miscalibrated outputs and explanations that are hard to audit. We propose the Probabilistic Reliability and Interpretability System, PRISM, which separates semantic extraction from probabilistic decision making. PRISM uses LLMs only to extract interpretable factors, treats repeated extractions as noisy measurements of latent states, and performs Bayesian inference to produce posterior predictive probabilities that propagate extraction and measurement uncertainty. For empirical reliability under temporal dependence, we add low-capacity post-hoc calibration and time-adaptive conformal prediction and report calibration and coverage diagnostics. PRISM also reports factor-contrast association summaries with uncertainty and explicit interpretation boundaries. On a UCDP–GDELT conflict benchmark, PRISM achieves AUROC 0.821 and ECE 0.058 on the test set; at 90

UAI 2026

Improving the Convergence of Private Shuffled Gradient Methods with Public Data

Shuli Jiang, Pranay Sharma, Zhiwei Steven Wu, Gauri Joshi

We consider the problem of differentially private (DP) convex empirical risk minimization (ERM). While the standard DP-SGD algorithm is theoretically well-established, practical implementations often rely on shuffled gradient methods that traverse the training data sequentially rather than sampling with replacement in each iteration. Despite their widespread use, the theoretical privacy-accuracy trade-offs of private shuffled gradient methods (DP-ShuffleG) remain poorly understood, leading to a gap between theory and practice. In this work, we leverage privacy amplification by iteration (PABI) and a novel application of Stein’s lemma to provide the first empirical excess risk bound of DP-ShuffleG. Our result shows that data shuffling results in worse empirical excess risk for DP-ShuffleG compared to DP-SGD. To address this limitation, we propose Interleaved-ShuffleG, a hybrid approach that integrates public data samples in private optimization. By alternating optimization steps that use private and public samples, Interleaved-ShuffleG effectively reduces empirical excess risk. Our analysis introduces a new optimization framework with surrogate objectives, varying levels of noise injection, and a dissimilarity metric, which can be of independent interest. Our experiments on diverse datasets and tasks demonstrate the superiority of Interleaved-ShuffleG over several baselines.

UAI 2026

Score-Based Diffusion Priors for Adaptive Conformal Inference under Distribution Shift

Xiangyu Jiang

Conformal prediction provides a distribution-free coverage guarantee for predictive inference, yet its validity degrades under distribution shift, a common challenge in real-world deployment. We introduce DiffConf, a framework that uses score-based diffusion models as expressive priors over the data-generating process to enable adaptive conformal inference under temporal and covariate distribution shifts. The main idea is that the score function learned by a diffusion model encodes rich geometric information about the data manifold, which can be repurposed to construct nonconformity scores that are sensitive to distributional changes. We derive a diffusion-guided conformity score that integrates the learned score field with a lightweight online recalibration mechanism, providing finite-sample marginal coverage guarantees even when the data distribution evolves over time. Theoretically, we establish that DiffConf achieves asymptotic conditional coverage under mild regularity conditions on the drift rate, and we prove a regret bound that scales gracefully with the complexity of the distribution shift. Experiments on synthetic benchmarks, real-world tabular regression tasks, and high-dimensional image datasets demonstrate that DiffConf produces prediction sets that are simultaneously valid and more efficient than existing adaptive conformal methods, reducing average set size by 6–39

UAI 2026

Calibration-Aware Online Adaptation under Label Shift

Jiun Jeong, Byeongwoo An, Gi-Soo Kim, Kyubo Shin

We study online adaptation of a pre-trained base classifier to streaming unlabeled data under label shift, where the marginal label proportions in the stream differ from those in the offline training data. We consider the case where the base classifier’s model class may be misspecified, motivating a separate, calibrated auxiliary classifier used solely to estimate the target label proportions. While many works have studied this setting, it is less understood how calibration quality affects the performance of the adapted base classifier in an online setting. In this paper, we thoroughly analyze the estimation error of the adapted base classifier after the deployment of a novel algorithm that estimates the target label proportions in an online fashion and dynamically adapts the base classifier using the estimated proportions. We decompose the error into a term that vanishes over time and a term determined by calibration quality. Moreover, we characterize an explicit trade-off between calibration granularity and finite-sample calibration error, and propose a novel calibration strategy which effectively balances this trade-off.

UAI 2026

Optimal Conformal Prediction under Epistemic Uncertainty

Alireza Javanmardi, Soroush H. Zargarbashi, Santo M. A. R. Thies, Willem Waegeman, Aleksandar Bojchevski, Eyke Hullermeier

Conformal prediction (CP) is a widely used frequentist framework to quantify uncertainty by constructing prediction sets with user-specified marginal coverage guarantees. In practice, CP is typically applied on top of probabilistic classifiers, which are able to express aleatoric but not epistemic uncertainty. In this paper, we consider the question of how to optimally employ CP on top of a more expressive formalism, namely credal sets, which can express both aleatoric and epistemic uncertainty. More specifically, we propose probabilistic Bernoulli prediction sets and derive a variant that achieves conditional coverage for valid credal sets while remaining minimal in expected size. We then address the more realistic scenario in which the validity of the credal sets is not guaranteed. Assuming access to calibration data with ground-truth distributions over labels, we apply conformal risk control to BPS and derive a PAC-style guarantee: with high probability over the data, the achieved conditional coverage is at least the desired level. We validate our theoretical findings empirically over various datasets.

UAI 2026

Graph-Dependent Regret Bounds in Multi-Armed Bandits with Interference

Fateme Jamshidi, Mohammad Shahverdikondori, Negar Kiyavash

We study multi-armed bandits under network interference, where each unit’s reward depends on its own treatment and those of its neighbors in a given graph. This induces an exponentially large action space, making standard approaches computationally impractical. We propose a novel algorithm that uses the local graph structure to minimize regret. We derive a graph-dependent upper bound on cumulative regret that improves over prior work. Additionally, we provide the first lower bounds for bandits with arbitrary network interference, where each bound involves a distinct structural property of the graph. These bounds show that for both dense and sparse graphs, our algorithm is nearly optimal, with matching upper and lower bounds up to logarithmic factors. When the interference graph is unknown, a variant of our algorithm is Pareto optimal: no algorithm can uniformly outperform it across all instances. We complement our theoretical results with numerical experiments, showing that our approach outperforms the baseline methods.

UAI 2026

Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions

Rustem Islamov, Grigory Malinovsky, Alexander Gaponov, Aurelien Lucchi, Peter Richtarik, Eduard Gorbunov

Federated Learning (FL) enables heterogeneous clients to collaboratively train a shared model without centralizing their raw data, offering an inherent level of privacy. However, gradients and model updates can still leak sensitive information, while malicious servers may mount adversarial attacks such as Byzantine manipulation. These vulnerabilities highlight the need to address differential privacy (DP) and Byzantine robustness within a unified framework. Existing approaches, however, often rely on unrealistic assumptions such as bounded gradients, require auxiliary server-side datasets, or fail to provide convergence guarantees. We address these limitations by proposing Byz-Clip21-SGD2M, a new algorithm that integrates robust aggregation with double momentum and carefully designed clipping. We prove high-probability convergence guarantees under standard L-smoothness and σ-sub-Gaussian gradient noise assumptions, thereby relaxing conditions that dominate prior work. Our analysis recovers state-of-the-art convergence rates in the absence of adversaries and improves utility guarantees under Byzantine and DP settings. Empirical evaluations on CNN and MLP models trained on MNIST further validate the effectiveness of our approach.

UAI 2026

Achieving Alignment Through Adaptive Play: Helping Optimize Objectives Without Observing Them

Jason T. Isa, Samuel Burden, Lillian J. Ratliff

We study problems where two agents seek to minimize an objective that is known only to one of the agents. This setting arises in human-machine and AI-AI interactions where one agent’s objective is private knowledge inaccessible to the other, referred to as the "helper". We propose a game-theoretic learning algorithm that provably converges to optimal policies through repeated interaction without solving an inverse problem to recover the unknown objective. Importantly, the helper agent has no access to the cost function, its values, or its gradients, and operates under action-only feedback. Despite the information limitation, we establish convergence guarantees under Polyak-Lojasiewicz and Lipschitz-gradient assumptions. We validate the approach through two sets of experiments: human-machine interaction and a cart-pole environment with a reinforcement learning agent. In each of these experiments, the helper uses our proposed algorithm. Across scalar and multidimensional action spaces, we demonstrate consistent convergence under action-only feedback.

UAI 2026

Probabilistic Edge Modulation for High-Dimensional Causal Discovery

Seyong Hwang, Kyoungjae Lee, Sunmin Oh, Gunwoong Park

Causal discovery in high-dimensional linear Bayesian networks is challenging, even with partial structural knowledge. Such information is often edge-specific and noisy, and naively enforcing uniform shrinkage or hard constraints can induce incorrect or unstable edge selection. We propose Probabilistic Edge Modulation (PEM), a principled probabilistic framework that replaces hard structural constraints with soft, edge-specific modulation via a spike-and-slab formulation. PEM integrates heterogeneous priors into ordering recovery and parent selection through a unified MAP formulation that remains computationally tractable in polynomial time. We establish high-dimensional consistency under both sub-Gaussian and heavy-tailed errors with bounded moments, and demonstrate robustness to prior misspecification. Experiments on synthetic and real retail data demonstrate improved structural stability and graph recovery in sparse and data-limited regimes; in a real e-commerce dataset, probabilistic transfer from a data-rich group stabilizes smaller groups and yields nontrivial graphs that do not collapse to near-empty graphs.

UAI 2026

Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization

Yuqi Huang, Vincent Y. F. Tan, Sharu Theresa Jose

We investigate Gaussian Process (GP) bandit optimization utilizing quantum kernels. While quantum kernels enable embedding data into high-dimensional Hilbert spaces—potentially offering enhanced expressivity or a "quantum advantage"—this property can pose challenges in bandit learning. Specifically, employing full quantum kernels naïvely may lead to increased model complexity and, consequently, higher cumulative regret impacting the learnability. To address this, we explore the use of projected quantum kernels and classical kernel approximation techniques, which effectively reduce feature dimensionality while preserving essential quantum properties. We demonstrate that these approaches can yield improved regret bounds by strategically balancing approximation error and information gain. Empirical results show that they significantly outperform models based on full quantum kernels in bandit optimization tasks. Additionally, we analyze how to select the optimal model complexity to achieve a favorable trade-off between expressivity and learnability. Our methods also substantially reduce computational costs by simplifying kernel-based inference to linear models, since only a finite set of reduced features is required.

UAI 2026

Model-Agnostic Online Certificate-Driven Calibration for Time Series Forecasting Under Distribution Shift

Chenfeng Huang, Zixuan Ma, George Michailidis

Time series out-of-distribution generalization requires forecasters to remain reliable when deployment dynamics differ from training conditions due to covariate shift, concept shift, and temporal dependence. Probably Approximately Correct Bayesian domain adaptation provides computable certificates by decomposing target risk into a source risk term, a source-to-target mismatch term, and a complexity term, but standard analyses rely on independent sampling and distributional stability, assumptions that are violated in time series by serial dependence and nonstationary shift. We propose a model-agnostic online martingale Probably Approximately Correct Bayesian framework that yields finite-sample certificates under temporal dependence and distribution shift. The certificate replaces independent-sample concentration with martingale concentration that adapts to loss scale and predictable variation. We use the certificate as a surrogate regularizer for online calibration by training a gated residual Bayesian head on top of a fixed forecasting backbone, producing a corrective update that reverts to the backbone prediction when the gate is closed. Online calibration combines a source risk anchor, a posterior-shift penalty, and a time-adaptive mismatch term computed from target windows observed before forecasting. It follows a predict-then-update protocol in which outcomes become available only after forecasting and are used to update subsequent predictions. Experiments across convolutional, attention-based, and large language model-based forecasters show improved stability and accuracy under covariate and concept shift.

UAI 2026

From Global to Factor-Wise Expert Composition in Discrete Diffusion Models

Haozhe Huang, Yudong Xu, Abhijoy Mandal, Alan Aspuru-Guzik

Discrete diffusion models offer a powerful framework for solving complex reasoning tasks, particularly through compositional generation, which combines multiple pre-trained experts to generalize beyond their individual training data. Recent theoretical corrections introduce time-dependent mixing weights to better align composed diffusion dynamics with the intended target. However, these methods are fundamentally limited by working on a per-sample basis, treating each generated state monolithically and ignoring the potential spatial or functional specializations of different experts. In this work, we address this limitation by proposing FactorDiff - a factor-wise composition framework for diffusion models. We posit that samples can be further decomposed into smaller factors, and propose a sampling process that dynamically routes each factor to the most relevant expert. We instantiate this framework with spatial/pixel-level compositions and validate it on the ARC-AGI benchmark, demonstrating that simple factor-specific routing consistently outperforms complex global scalar weighting schemes on tasks that require logical consistency and spatial disentanglement.

UAI 2026

Policy-Based Trajectory Clustering in Offline Reinforcement Learning

Xinqi Wang, Simon Shaolei Du, Hao Hu

We introduce the task of clustering trajectories in offline reinforcement learning (RL) datasets to address the multi-modal nature of offline data. Such datasets often contain trajectories from diverse policies, and treating them as a single distribution can obscure structure and increase distributional shift. We formalize trajectory clustering by linking the KL-divergence of offline trajectory distributions with mixtures of policy-induced distributions. To solve this, we propose Policy-Guided K-means (PG-Kmeans) and Centroid-Attracted Autoencoder (CAAE). PG-Kmeans iteratively trains behavior cloning policies and assigns trajectories based on generation probabilities, while CAAE learns continuous latent representations regularized by a learnable codebook to achieve end-to-end clustering. We prove finite-step convergence of PG-Kmeans and analyze the ambiguity of optimal solutions caused by policy-induced conflicts. Experiments on D4RL and GridWorld show that PG-Kmeans and CAAE partition trajectories into coherent clusters and offer a framework for structuring offline data, with applications in data selection, curriculum learning, and policy transfer.

UAI 2026

From Bayes’ Rule to Bayes Rules: Information Processing, Bayes’ Theorem, and Imprecise Probabilities

Jeremie Houssineau, Badr-Eddine Chérief-Abdellatif

This paper develops principled updating rules for possibilistic inference, where uncertainty about a fixed parameter is represented by a possibility function, the maxitive analogue of a probability distribution, and comparisons are made pointwise via a partial order. From two complementary foundations, an information-conservation viewpoint and an axiomatic viewpoint, we derive the same canonical update: the posterior is the prior-likelihood product followed by supremum normalisation. The two derivations agree for an arbitrary loss, differing only in where the learning-rate parameter enters. This parameter controls epistemic strength and is not identifiable from the normalising evidence alone, clarifying the role of analogous learning-rate parameters in generalised Bayesian updating.

UAI 2026

Generalized Distribution-Free Semi-Supervised Learning with Risk Rewrite

Yushi Hirose, Hiroo Irobe, Takafumi Kanamori

Typical semi-supervised learning (SSL) methods rely on distributional assumptions, and their performance degrades when these are violated. While PNU learning, a risk rewriting method, offers a distribution-free alternative, it is restricted to binary classification and its variance optimality remains unclear. In this paper, we propose a generalized framework that constructs unbiased risk estimators using linear combinations of component risks, subsuming PNU learning and extending to multiclass classification. We derive the minimum achievable variance, demonstrating our estimator can attain lower variance than PNU in asymmetric loss scenarios. Furthermore, we establish a generalization bound directly linking this variance reduction to improved learning performance. Based on these theoretical insights, we introduce two practical SSL methods that empirically match or outperform existing approaches on binary and multiclass benchmarks.

Keep browsing

More papers from top AI conferences

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