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

Conformal Online Model Aggregation

Matteo Gasparin, Aaditya Ramdas

Conformal prediction equips machine learning models with a reasonable notion of uncertainty quantification under mild assumptions. However, conformal prediction only works if we fix the underlying model in advance. A relatively unaddressed issue in conformal prediction is that of model selection and/or aggregation: given a set of prediction models, which one should we conformalize? We suggest that instead of performing model selection, it can be prudent and practical to perform conformal set aggregation in an online, adaptive fashion. We propose a wrapper that takes in several conformal prediction sets, and outputs a single adaptively-combined prediction set. Our method, called conformal online model aggregation (COMA), is based on combining the prediction sets from several algorithms by weighted voting, and can be thought of as a sort of online stacking of the underlying conformal sets. As long as the input sets have (distribution-free) coverage guarantees, COMA retains coverage guarantees, under a negative correlation assumption between errors and weights. COMA is well suited to decentralized settings, where users are only willing to share their prediction sets for a new test point in a black-box fashion. As we demonstrate, it is also well suited to settings with distribution drift, where model selection is not advisable.

UAI 2026

Advances in PAC-Bayesian certification of deep neural networks: tighter closed-form inequalities and optimization of bounds on non-differentiable losses

Diego García-Pérez, Emilio Parrado-Hernandez, John Shawe-Taylor

This paper presents three theoretical contributions that improve the usability of risk certificates for neural networks based on PAC-Bayes bounds. First, two bounds on the KL divergence between Bernoulli distributions enable the derivation of the tightest explicit bounds on the true risk of classifiers across different ranges of empirical risk. Then, a novel method to optimize bounds on non-differentiable objectives is introduced, allowing to optimize risk bounds directly on the 0-1 loss instead of resourcing to a surrogate differentiable loss, such as the bounded cross-entropy. These theoretical contributions are illustrated with an empirical evaluation on the MNIST and CIFAR-10 datasets. In fact, this paper presents the first non data-dependent generalization bounds on the 0-1 loss for neural networks fitted on CIFAR-10.

UAI 2026

Perfect Matching Map Recovery Under Unknown Scalar Affine Transformation

Tigran Galstyan, Avetik Karagulyan, Arshak Minasyan

We study the problem of matching two sets of noisy feature vectors when underlying true features are related by an unknown scalar affine transformation. Our method comprises two primary steps. First, we standardize the feature vectors to estimate the unknown scalar affine transformation. Subsequently, we estimate the permutation by minimizing the Least Sum of Logarithms (LSL) between two sets of observations using the estimated transformation. Our main result shows that the unknown permutation can be perfectly recovered given that the minimal separation distance of true feature vectors scales as √(ρ_σ)∨ (dlog n)^1/4∨√(log n), where d is the ambient dimension, n is the sample size, and ρ_σ is the maximal ratio of noise magnitudes. Interestingly, the obtained rate, under mild heteroscedasticity, coincides with that of the non-affine setting. We additionally demonstrate that there exist configurations requiring a larger minimal separation distance for perfect recovery. The latter makes the matching problem more challenging from minimax perspective compared to the non-affine setting. Consequently, we show that in the problem of feature matching, standardizing the data implicitly estimates the scalar affine parameters. As part of our analysis, we prove non-asymptotic concentration bounds for the affine parameter estimators in the presence of heterogeneous noise magnitudes.

UAI 2026

Bregman contrastive estimation as a general framework for learning unnormalized models: Efficiency, robustness and optimal noise

Yuto Fujii, Hiroaki Sasaki, Takafumi Kanamori

Learning unnormalized models is an ubiquitous problem in modern statistics and machine learning. Noise contrastive estimation (NCE) takes a popular approach based on solving a binary classification problem: Unnormalized models are learned by discriminating input data with artificially generated noise data. This paper follows this approach, but proposes a general framework based on the Bregman divergence. By selecting the convex function in the divergence, our framework includes existing methods as special cases, and novel variants of NCE can be also derived. Learning unnormalized models in the proposed framework is performed by estimating the posterior probability in the binary classification, i.e., the composition of the logistic function and the ratio of data and noise distributions. Due to the boundedness of the logistic function, our framework is advantageous in outlier-robustness. In fact, we theoretically prove that robust estimation is possible in our framework under a variety of convex functions in the Bregman divergence. Furthermore, the asymptotic efficiency is also investigated, implying a trade-off between efficiency and robustness in our framework. Inspired by these results, we derive the optimal noise distribution under some constraints for robustness. Finally, we numerically demonstrate the robustness of the novel variants of NCE and the derived optimal noise distribution.

UAI 2026

Explainable Clustering of Mixture Models

Maximilian Fleissner, Maedeh Zarvandi, Debarghya Ghoshdastidar

The explainable clustering problem was first posed by Moshkovitz et al. (ICML 2020) and studies how well an axis-aligned decision tree with K leaves can approximate a given clustering. The performance of the tree is measured via the price of explainability, defined as the ratio between the clustering cost of the tree (where every leaf is a cluster) and the optimal cost. Several recent works have given worst-case characterizations of the price of explainability for different cost functions. However, these guarantees are data-agnostic and therefore notoriously pessimistic in practical clustering settings. In this paper, we study explainable clustering from the point of view of mixture models, which allows us to give the first data-dependent bounds on the price of explainability. First, we focus on K-medians clustering of mixture models with subexponential tails. We propose an algorithm that leverages information about the distribution of the data to find better cuts, and prove new upper and lower bounds. Second, we extend our algorithm and the theoretical guarantees it provides to kernel clustering, thereby refining the existing worst-case analysis.

UAI 2026

Average Controlled and Average Natural Micro Direct Effects in Summary Causal Graphs

Simon Ferreira, Charles K. Assaad

In this paper, we investigate the identifiability of average controlled direct effects and average natural direct effects in causal systems represented by summary causal graphs, which are abstractions of full causal graphs, often used in dynamic systems where cycles and omitted temporal information complicate causal inference. Unlike in the traditional linear setting, where direct effects are typically easier to identify and estimate, non-parametric direct effects, which are crucial for handling real-world complexities, particularly in epidemiological contexts where relationships between variables (e.g., genetic, environmental, and behavioral factors) are often non-linear, are much harder to define and identify. In particular, we give sufficient conditions for identifying average controlled micro direct effect and average natural micro direct effect from summary causal graphs in the presence of hidden confounding. Furthermore, we show that the conditions given for the average controlled micro direct effect become also necessary in the setting where there is no hidden confounding and where we are only interested in identifiability by adjustment.

UAI 2026

Mitigating Spurious Correlations with Memorization-Guided Dataset De-Biasing

Arda Fazla, Abolfazl Hashemi

Real-world datasets often contain spurious correlations that are not causally related to the target label. When such correlations dominate the majority of training samples, models tend to rely on them, leading to misclassification of minority samples that do not exhibit the same spurious patterns. While a potential approach is to select judicious subsets of data to better represent of the minority samples, it may require group labels which are typically unknown. Furthermore, as we demonstrate, widely used sample scoring functions in the invariant subset or coreset selection literature largely depend on spurious features and therefore fail to accurately capture the importance or difficulty of core, causally relevant features. Accordingly, we propose to mitigate spurious correlations, by developing a two-stage sample scoring function that disentangles the learning dynamics of core and spurious features and evaluates their difficulty separately. Based on our proposed metric, we introduce a new algorithm to find and prioritize informative samples both with and without spurious correlations. Extensive experiments demonstrate that a standard ERM model trained on our selected samples achieves superior performance compared to state-of-the-art debiasing techniques, while requiring as little as 10

UAI 2026

Poisson–Gamma Modeling of Inter-Relational Dependencies in Dynamic Knowledge Graphs

Nan Fang, Yijun Wang, Hao Liao, Sikun Yang

Dynamic knowledge graphs are ubiquitous in today’s AI applications, as we represent molecular structures, social relationships, and language information using these graph models. As knowledge graphs evolve over time and are often noisy and incomplete, modeling their temporal and relational dependencies becomes crucial for downstream tasks. To address these challenges, this paper proposes PGRE (Poisson–Gamma Relational Evolution), a probabilistic model for modeling inter-relational dependencies in dynamic knowledge graphs. PGRE represents multi-relational temporal links via a Poisson–Bernoulli formulation. It introduces Gamma-distributed latent variables to capture entity–factor associations and cross-relation dependencies mediated by shared latent communities. A Gamma Markov process further models the temporal evolution of these latent variables, enabling principled characterization of relational dynamics. Experiments on benchmark datasets show that PGRE achieves competitive performance in link prediction, particularly in sparse settings, while revealing meaningful relational evolution patterns in dynamic knowledge graphs.

UAI 2026

How PC-based Methods Err: Towards Better Reporting of Assumption Violations and Small Sample Errors

Sofia Faltenbacher, Jonas Wahl, Rebecca Jean Herman, Jakob Runge

Causal discovery methods based on the PC algorithm are proven to be sound if all structural assumptions are fulfilled and all conditional independence tests are correct. This idealized setting is rarely given in real data. In this work, we first showcase how local errors can lead to untrustworthy edge orientations far away from the error source, highlighting how consequential seemingly innocuous errors can become. Next, we introduce coherency scores to find assumption violations and small sample errors in the absence of a ground truth. These scores do not require statistical tests beyond those already executed by the causal discovery algorithm. Errors detected by our approach extend the set of errors that present themselves as orientation conflicts or ambiguities. We place our computationally cheap global error detection and quantification scores as a bridge between computationally expensive global answer-set-programming-based methods and less expensive local error detection methods. The scores are analyzed on simulated and real-world datasets.

UAI 2026

One Model to Rule Them All: Canonically Gluing Causal Models Along Shared Substructures

Markus Englberger, Devendra Singh Dhami

Causal Bayesian Networks (CBNs) provide a framework for reasoning about interventions, but analyzing complex systems often requires working with multiple overlapping models or hierarchical levels of granularity. We study how to canonically merge separate causal models that share a common substructure or abstract representation. We formalize this problem using category theory. We construct two distinct categories of causal models where morphisms are defined by maps that commute with interventions. Depending on whether these maps are injective or surjective, they represent causal submodels or causal abstractions, respectively. We demonstrate that the canonical merging of models sharing a common subsystem corresponds to computing a pushout in the category of submodels, while merging models sharing a common abstraction corresponds to a pullback in the category of abstractions. We establish sufficient topological and domain-level conditions under which these universal constructions exist.

UAI 2026

Neural Diffusion Intensity Models for Point Process Data

Xinlong Du, Harsha Honnappa, Vinayak Rao

Cox processes model overdispersed point process data via a latent stochastic intensity, but both estimation of the nonparametric intensity model and posterior inference over intensity paths are generally intractable, relying on computationally-heavy MCMC methods. We introduce Neural Diffusion Intensity Models, a variational inference framework for Cox processes driven by neural stochastic differential equations (SDEs). Our key theoretical result, based on enlargement of filtrations, shows that conditioning on point process observations preserves the diffusion structure of the latent intensity with an explicit drift correction. This provides guidance on how to choose an appropriate variational family so that ELBO maximization coincides with maximum likelihood estimation under sufficient model capacity. We provide an amortized encoder architecture that maps variable-length event sequences to posterior intensity paths by simulating the drift-corrected SDE, replacing repeated MCMC runs with a single forward SDE simulation. Experiments on synthetic and real-world data demonstrate accurate recovery of latent intensity dynamics and posterior paths, with orders-of-magnitude speedups over MCMC-based methods.

UAI 2026

Sparse Action-Dependent Policy Iteration under Coordination Structures: Convergence and Optimality

Jianglin Ding, Jingcheng Tang, Gangshan Jing

Action-dependent policies, which condition decisions of each agent on both states and other agents’ actions, provide a powerful structured framework for cooperative multi-agent reinforcement learning (MARL). Most existing studies have focused on auto-regressive formulations, where each agent’s policy depends on the actions of all preceding agents. However, this structure suffers from severe scalability limitations as the number of agents grows. In contrast, the theoretical foundations of sparse dependency structures remain largely unexplored. To address this gap, we introduce the Action Dependency Graph (ADG) to model sparse inter-agent dependencies. We propose a refined equilibrium concept with respect to the ADG that is stronger than the Nash equilibrium which often traps independent policies. Furthermore, within Coordination Graphs (CG) structured problems, we show that such an equilibrium attains global optimality when the ADG satisfies specific CG-induced conditions. To substantiate our theory, we develop a tabular multi-agent policy iteration algorithm that converges to the refined equilibrium exactly as predicted. We further extend our approach to deep MARL, confirming that these structural conditions provide a reliable design principle for scalable and optimal coordination.

UAI 2026

Communication-Efficient Distributed Training for Collaborative Flat Optima Recovery in Deep Learning

Tolga Dimlioglu, Anna Ewa Choromanska

We study centralized distributed data parallel training of deep neural networks (DNNs), aiming to improve the trade-off between communication efficiency and model performance of local gradient methods. Motivated by the flat-minima hypothesis, we first introduce a simple sharpness measure, Inverse Mean Valley, and show it strongly correlates with the generalization gap of DNNs. We then incorporate an efficient relaxation of this measure into the distributed objective as a lightweight regularizer that encourages workers to seek wide minima collaboratively. The regularizer exerts a pushing force that counteracts the consensus step pulling the workers together, giving rise to the Distributed Pull-Push Force (DPPF) algorithm. Empirically, DPPF generalizes better than other local gradient methods and synchronous gradient averaging while maintaining communication efficiency. In addition, our loss landscape visualizations confirm the ability of DPPF to locate flatter minima. Theoretically, we show that DPPF drives workers to span flat valleys with valley width governed by push–pull strengths, it yields self-stabilizing dynamics, it obeys generalization guarantees that depend on valley width, and it converges in the non-convex setting.

UAI 2026

Ensemble Diversity Optimization for Subjective Supervision

Xia Cui, Ziyi Huang, Nishanthi Rupika Abeynayake

Subjective NLP tasks often exhibit systematic annotator disagreement, requiring models that represent uncertainty rather than collapse it. We introduce Ensemble Diversity Optimization (EDO), a prediction-space framework that jointly optimizes ensemble weights, effective cardinality, and calibration through a unified differentiable objective. EDO learns ensemble composition and size end-to-end via Gumbel–Softmax relaxation and incorporates a signed diversity regularizer, tuned on validation data, to steer optimization toward either preserving or suppressing disagreement. This regularization prevents ensemble collapse and enables controlled navigation of the utility–calibration trade-off. The framework integrates a soft F1 surrogate, class-weighted cross-entropy to address imbalance, and reliability-weighted diversity to regulate intra-ensemble variability. Experiments on four subjective text-classification benchmarks (ArMIS, ConvAbuse, HS-Brexit, MD-Agreement) show that EDO substantially improves probabilistic calibration, reducing cross-entropy (40–78

UAI 2026

Which Directions Matter? Sparse Design for Affine Robust Optimization

Pedro Chumpitaz-Flores, My Duong, Juan S. Borrero, Kaixun Hua

Robust machine learning and optimization rely on the uncertainty model choice. We investigate which uncertainty directions a model must cover when defined by a finite dictionary and a budget constraint. Selecting a subset forms an atomic uncertainty set with a closed form support function, yielding tractable robust programs for affine objectives. We propose a data-driven selection rule based on a coverage objective over evaluation directions, including gradients, adversarial perturbations, or shifts observed on held out data. We prove this objective is monotone and submodular, supporting a greedy method with a (1-1/e) approximation guarantee and a matching hardness barrier. We also provide a certificate bounding the loss from the selected subset and a radius calibration rule with out-of-sample control.

UAI 2026

Canonical Domain Reduction for Partial Counterfactual Identification

Yesong Choe, Yeahoon Kwon, Min Woo Park, Sanghack Lee

Many counterfactual and causal queries are only partially identified from data, especially under unmeasured confounding. A common approach represents compatible nonparametric structural causal models (SCMs) on a finite canonical domain and computes sharp bounds via linear programming (LP) over the induced simplex. However, the canonical full counterfactual state space grows exponentially even for small graphs, making naive LP-based bounding computationally heavy. We propose a constraint-aware reduction that quotients out degrees of freedom irrelevant to the optimization problem. Because sharp bounds are determined jointly by the query functional and the data-implied information set, we aggregate full states into equivalence classes that are indistinguishable to every linear functional appearing in the LP objective and constraints. We show that optimizing over the induced push-forward distribution on the reduced domain preserves feasibility and yields the same sharp bounds as the full-domain.

UAI 2026

Fairness under Graph Uncertainty: Achieving Interventional Fairness with Partially Known Causal Graphs over Clusters of Variables

Yoichi Chikahara

Algorithmic decisions about individuals require predictions that are not only accurate but also fair with respect to sensitive attributes such as gender and race. Causal notions of fairness align with legal requirements, yet many methods assume access to detailed knowledge of the underlying causal graph, which is a demanding assumption in practice. We propose a learning framework that achieves interventional fairness by leveraging a causal graph over *clusters of variables*, which is substantially easier to estimate than a variable-level graph. With possible *adjustment cluster sets* identified from such a cluster causal graph, our framework trains a prediction model by reducing the worst-case discrepancy between interventional distributions across these sets. To this end, we develop a computationally efficient barycenter kernel maximum mean discrepancy (MMD) that scales favorably with the number of sensitive attribute values. Extensive experiments show that our framework strikes a better balance between fairness and accuracy than existing approaches, highlighting its effectiveness under limited causal graph knowledge.

UAI 2026

Policy Optimization for Adversarial Linear Mixture MDPs with Unknown Transitions and Bandit Feedback

Yutian Cheng, Canzhe Zhao, Shuai Li

We study episodic reinforcement learning with adversarial losses and bandit feedback in MDPs with unknown transitions under a linear-mixture model. In this setting, prior studies are typically built upon global optimization methods with the notion of occupancy measure, rather than the purely local policy optimization-based method, which avoids solving a constrained convex optimization problem and is thus more preferred in practice. In this work, we develop the first policy optimization-based algorithm that runs online mirror descent locally on each state. The main challenge is to interface local updates with transition learning: the dilated-bonus analysis requires predictable reachability surrogates and robust one-step maximizations over a confidence set, but the statistically natural VLS confidence region is a coupled ellipsoid over a shared parameter and is not (s,a)-rectangular. We address this by rectangularizing the VLS ellipsoid into local per-(s,a) kernel sets, which enables robust dynamic programming to compute occupancy envelopes and to drive the implicit-exploration estimator and dilated bonuses. Based on this technique, we prove a high-probability regret bound 𝒪(H^3/2√(S AK) + dH^3/2 S^3/2√(K)), which nearly matches the best-known bound achieved by occupancy-measure-based methods.

UAI 2026

Hyperbolic Belief Propagation

Zehua Cheng, Wei Dai, Jiahao Sun

Belief Propagation (BP) has operated in Euclidean space for four decades, yet the polynomial volume growth of ℝ^d is fundamentally mismatched to hierarchical graphs: faithful embedding of exponentially branching structure demands d = Ω(log n) dimensions and prohibitive 𝒪(d^3) covariance costs, while truncating d corrupts marginal estimates. We introduce Continuous Hyperbolic Belief Propagation (CHBP), formulated natively on the Lorentz hyperboloid ℍ^n_K, whose exponential volume growth eliminates this bottleneck. CHBP parameterises beliefs as Jacobian-corrected Wrapped Normals, approximates message integrals via Gauss–Hermite quadrature, and transports covariance tensors between tangent spaces via closed-form Levi-Civita parallel transport, with a curvature annealing schedule ensuring stable convergence. On hierarchical graphs, CHBP at d=5 reduces marginal KL divergence by 25× versus Euclidean BP at d=50 and achieves up to 91.45

UAI 2026

On the Sublinear Regret of Continuous K-Max Bandits

Yu Chen, Siwei Wang, Longbo Huang, Wei Chen

The K-Max combinatorial multi-armed bandit problem arises in applications such as recommendation and distributed decision making, where the reward is determined by the maximum outcome among K selected arms. When outcomes are continuous and only the maximum value together with the winner’s index is observed, this problem introduces unprecedented difficulties including discretization errors, non-deterministic tie-breaking, and severe estimation biases. To overcome these barriers, we introduce DCK-UCB, an efficient algorithm combining adaptive discretization with bias-corrected confidence bounds. We prove that DCK-UCB achieves a 𝒪(T^3/4) regret bound, the first sublinear guarantee in this setting. Numerical experiments show its superior performance over baseline methods. Furthermore, for the specific case of exponential distributions under full-bandit feedback, we propose MLE-Exp algorithm that attains a near-optimal 𝒪(√(T)) regret bound. This work establishes fundamental theoretical guarantees and provides a powerful algorithmic solution for continuous combinatorial bandits.

Keep browsing

More papers from top AI conferences

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