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

Collaborative Multi-view Learning from Crowds

Shanshan Si, Liangxiao Jiang, Wenjun Zhang, Chaoqun Li, Liangjun Yu

As an effective post-processing approach to improving the quality of integrated labels, noise correction has received extensive attention in recent years. Recent studies have shown that utilizing information from both the original attribute view and the multiple noisy label view can significantly improve the performance of noise correction. However, most existing algorithms often learn information independently on each view, making them difficult to fully exploit the complementary information between these two views. To address this limitation, we propose a noise correction algorithm called collaborative multi-view learning from crowds (CMLFC). CMLFC first constructs instance correlation graphs on the original attribute view and the multiple noisy label view, respectively, and designs dedicated encoders to obtain view-specific representations. To capture the deep complementary information between these two views, it designs a contrastive fusion encoder to distill common representations from these two view-specific representations, and then forms a common view. Next, it trains three view-specific classifiers on these three views, and designs a joint loss function to collaboratively train these encoders and classifiers, enabling information to flow bidirectionally among views, thereby improving the quality of representations in each view. Finally, it employs the trained view-specific encoders and classifiers to obtain each instance’s representations and class probability distributions, respectively, which are then used to update its integrated label. Extensive experiments on real-world crowdsourced datasets validate the effectiveness, ablation, and sensitivity of CMLFC. Our codes and datasets are available at https://github.com/jiangliangxiao/CMLFC.

UAI 2026

Fixed-Confidence Best-Arm Identification for Causal Mediation Analysis

Harsh Shrivastava, Yuta Kawakami, Junpei Komiyama, Jin Tian

This paper studies the problem of identifying the treatment that maximizes the expected natural direct potential outcome (NDPO), which captures the potential outcome of an intervention while excluding the pathway transmitted through a mediator that researchers may wish to remove from evaluation. We first establish population-level identification of the expected NDPO in a causal bandit setting using observable interventional distributions. We then develop a fixed-confidence best-arm identification (BAI) algorithm based on the Track-and-Stop (TaS) framework, employing a cutting-set method to solve the resulting semi-infinite optimization problem. The proposed algorithm achieves sample-efficient identification with a high-probability correctness guarantee. We prove that it satisfies δ-correctness and asymptotic optimality. Finally, we validate the approach through empirical evaluations on a large-scale real-world advertising dataset (IPinYou).

UAI 2026

Evaluation of "Probabilities of Causation" in Case-Control Studies: Identification and Estimation

Ryusei Shingaki, Haruka Yoshida, manabu kuroki

"Probabilities of causation" play a crucial role in practical science. Pearl [2009] defined three types of probabilities of causation in the context of structural causal models: the probability of necessity (PN), the probability of sufficiency (PS), and the probability of necessity and sufficiency (PNS). Furthermore, Tian and Pearl [2000] and Kuroki and Cai [2011] provided the identification conditions for these probabilities under the assumption of monotonicity. However, these identification conditions are described based on "the joint probabilities of observed probabilities" and/or "causal risks". Therefore, they are not applicable to case–control studies, in which the available statistical data are given in the form of the conditional probabilities of observed variables given an outcome variable. To address this limitation, this paper provides novel identification conditions for the probabilities of causation using (i) two proxy covariates and (ii) a proxy covariate together with an instrumental variable. Remarkably, the use of a proxy covariate and an instrumental variable enables the identification not only of the probabilities of causation but also of the joint distribution of the potential outcome variables. When these probabilities can be evaluated using the proposed identification conditions, new plug-in estimators of these probabilities are presented.

UAI 2026

Valid and Efficient Uncertainty Quantification for Federated Joint Shift

Yuanjie Shi, Peihong Li, Xuanyu Cao, Yan Yan

Reliable uncertainty quantification (UQ) is critical for safety-sensitive federated learning (FL) applications, such as cross-hospital diagnosis and global sensor networks. In FL, privacy constraints prevent centralized data pooling, while client data exhibit joint distribution shifts across covariates, labels, and conditionals. These shifts violate the exchangeability assumption required by conformal prediction (CP), which otherwise guarantees distribution-free coverage under i.i.d. data. To address this gap, we propose Federated Conformal Prediction for Joint Shift (FCPJS), enabling valid CP under heterogeneous clients without sharing raw data. Specifically, the method operates in two stages: (i) the server constructs a privacy-preserving global sketch of nonconformity score distributions; (ii) each client performs importance-weighted calibration by contrasting its local scores with the global sketch. This distribution-ratio weighting corrects joint shifts in a unified manner. We prove that FCPJS attains valid marginal coverage across clients, up to an O(√(ε_m)+1/√(n)) error from the finite number of calibration samples n and sketch size m. Experiments on four heterogeneous benchmarks show that preserves coverage and improves predictive efficiency by 12.64

UAI 2026

Finding the Signal in the Spam: Jointly Learning Rewards and Worker Reliability from Pairwise Comparisons

Kaustubh Shivshankar Shejole, Tanish Agarwal, Arpit Agarwal, Avishek Ghosh

The problem of learning from pairwise comparisons has been widely studied across many domains such as recommendation systems, social choice, and more recently, fine-tuning large language models. In this problem, the goal is to learn item rewards based on pairwise comparisons between them. In many scenarios, these comparisons are elicited from crowdworkers using platforms such as Amazon Mechanical Turk, Scale AI, etc. However, crowdworkers are often unreliable due to limited domain knowledge or revenue-maximizing (spamming) behavior. In this work, our goal is to understand whether worker reliability (competency) can be learned jointly with item rewards. To this end, we adopt the Boltzmann-rational model for pairwise comparisons, which extends the Bradley–Terry–Luce model by incorporating worker competencies. We derive an EM-based algorithm for learning under this model by introducing Polya-Gamma latent variables to transform the logistic likelihood into a conditionally Gaussian form, enabling tractable optimization and leading to a simplified Q function in the E-step of the algorithm. This technique allows us to reduce our formulation to a matrix sensing problem, using which we establish theoretical convergence guarantees for our algorithm. We conduct extensive experiments on real-world and synthetic datasets. These experiments demonstrate the advantages of using our algorithm over several baselines and confirm its strong robustness to both spammers and adversarial workers, highlighting its practical effectiveness in realistic crowdsourcing and reward learning settings.

UAI 2026

Improving TensorSketch Using Complex Random Variables

Amit Sharma, Mohammad Azhar Khan, Rameshwar Pratap, Keegan Kang

by [Pham and Pagh, 2013, Kar and Karnick, 2012] provides efficient sketching algorithms for high-dimensional polynomial kernels 𝐱^⊗ p∈ℝ^d^p. [Kar and Karnick, 2012] uses dense Johnson-Lindenstrauss (JL)-type projections with computational cost O(pDd), whereas [Pham and Pagh, 2013] extends the sparse [Charikar et al., 2004] algorithm, yielding a faster algorithm for high-dimensional sparse inputs with running time O(p(nnz(𝐱) + D log D)). However, the variance of both estimators grows exponentially with the polynomial degree p, scaling as 3^p/D, where D denotes the sketch dimension. Recent work by [Wacker et al., 2023] showed that using complex-valued distribution reduces this dependence to 2^p/D for the approach of [Kar and Karnick, 2012]. However, their method relies on dense JL-type projections with computational cost O(pDd) and does not extend to the algorithm of [Pham and Pagh, 2013]. In this work, we introduce a simple variant of [Pham and Pagh, 2013] that achieves the same variance bound as [Wacker et al., 2023], while retaining its advantage of the input-sparsity running time. We validate our results with supporting experiments on synthetic and real-world datasets.

UAI 2026

Analytic Planning under Uncertainty with Moment Closure

Shishir Sharma, Doina Precup

Effective model-based reinforcement learning in stochastic environments requires planning that accounts for predictive uncertainty. Propagating full state distributions analytically offers a principled way to do this, but has traditionally required restrictive policy or reward structures to remain tractable. Consequently, modern deep reinforcement learning has largely retreated to either stochastic sampling, which introduces significant target variance, or deterministic point estimates that ignore predictive covariance entirely. We investigate whether distribution-aware planning is possible without these constraints. Using a quadratic action-value parameterization, we first reduce the Bellman backup to an expectation over the state-value function alone; the key idea is then a compatibility principle between the predictive transition distribution and the value function class, under which this expectation is analytic in the distribution’s moments. We instantiate this principle with a Gaussian transition model paired with a radial-basis value function, yielding a closed-form backup that propagates both predictive mean and covariance. Empirically, our approach reduces target variance and yields well-calibrated predictive uncertainty under stochastic observations in continuous control, providing a principled framework for planning with learned distribution models.

UAI 2026

The Art of Calling the Winner by Asking Just Enough Questions

Nisarg Shah, Ziqi Yu

We study active elicitation of agent preferences for collectively choosing among m alternatives using prominent voting rules. We focus on the next-best query model, in which an agent responds to a query by revealing their next most favorite alternative, and measure the competitive ratio, which is the worst case ratio between the number of queries made by the active elicitation algorithm and the minimum number of queries needed to reveal the winning alternative(s) in hindsight. We show that the best competitive ratio is sublinear in m for many positional scoring rules but linear in m for all Condorcet-consistent rules. Our analysis centers on a simple elicitation algorithm we propose, which not only achieves optimal theoretical bounds, but also impressive empirical performance on real data.

UAI 2026

Birds of a Feather Reason Together: Gestalt Grouping Meets Neuro-Symbolic Inference

Jingyuan Sha, Hikaru Shindo, Kristian Kersting, Devendra Singh Dhami

This paper introduces Gestalt Reasoning Machines (GRMs), a novel neuro-symbolic framework that integrates Gestalt principles to enhance reasoning models with perception capabilities similar to human cognition. Traditional models, which rely on large datasets and complex computations, often overlook the crucial human cognitive function of grouping, resulting in inefficiencies when dealing with abstract concepts. GRMs address this challenge by incorporating a grouping mechanism grounded in Gestalt principles, enabling the system to recognize and reason over complex visual patterns that are otherwise difficult to capture through object-level features alone. This grouping capability allows GRMs to identify higher-order structures and relational configurations that are essential for human-like reasoning. We demonstrate that GRMs outperform purely neural baselines by leveraging logic-based reasoning infused with perceptual grouping cues, offering a more interpretable and cognitively aligned approach. Our contributions include the design of GRMs and the empirical validation of their effectiveness in visual reasoning tasks that demand structured perception.

UAI 2026

Sign Identifiability of Causal Effects in Stationary Stochastic Dynamical Systems

Gijs van Seeventer, Saber Salehkaleybar

We study identifiability in continuous-time linear stationary stochastic differential equations with a known causal structure. Unlike existing approaches, we relax the assumption of a known diffusion matrix, thereby respecting the model’s intrinsic scale invariance. Therefore, rather than recovering drift coefficients themselves, we introduce edge-sign identifiability: for a given causal structure, we ask whether the sign of a given drift entry is uniquely determined across all observational covariance matrices induced by parametrisations compatible with that structure. This leads to a trichotomy of edge-sign identifiability: identifiable, non-identifiable, and partially identifiable. This trichotomy introduces the new notion of partial identifiability to the literature, which we show is a genuine category in our setting. Under a notion of faithfulness, we derive criteria to identify membership of each category for general graphs. Applying our criteria to specific causal structures, both analogous to classical causal settings (e.g., instrumental variables) and novel cyclic settings, we determine their edge-sign identifiability and, in some cases, obtain explicit expressions for the sign of a target edge in terms of the observational covariance matrix.

UAI 2026

The Price of Knowledge: Optimal Algorithms for Costly Bandits

Felix Schur, Jesus Lago, Tanner Fiez

We study stochastic bandits in which observing a reward is optional but incurs an action-dependent cost. This setting captures applications where feedback acquisition (e.g., human evaluation or randomized testing) is expensive, and the learner must trade off exploration, exploitation, and observation cost. We formulate regret to include both reward loss and the cumulative cost of requested observations. Our first result is structural: for minimizing regret, it is without loss of generality to consider two-phase policies that first request labels during an exploration phase and then commit to a single action without further observations. Building on this reduction, we introduce two cost-sensitive complexity measures that extend maximum information gain: a cost-adjusted information gain Γ_T(c) for minimax analysis, and a cost- and gap-adjusted information gain Γ_T^gap(Δ_c) for instance-dependent analysis. Using these quantities, we develop two Gaussian-process-based algorithms, C3-GP and GP-C-LUCB, and derive regret upper bounds for correlated-action settings with heterogeneous observation costs. In the finite independent-arm setting, we further prove matching lower and upper bounds (up to constants/logarithmic factors), yielding a tight characterization of both minimax and instance-dependent regret in terms of the proposed cost-aware complexity measures.

UAI 2026

A Sobering Look at Tabular Data Generation via Probabilistic Circuits

Davide Scassola, Dylan Ponsford, Adrian Javaloy, Sebastiano Saccani, Luca Bortolussi, Henry Gouk, Antonio Vergari

Tabular data is more challenging to generate than text and images, due to its heterogeneous features and much lower sample sizes. On this task, diffusion-based models are the current state-of-the-art (SotA) model class, achieving almost perfect performance on commonly used benchmarks. In this paper, we question the perception of progress for tabular data generation. First, we highlight the limitations of current protocols to evaluate the fidelity of generated data, and advocate for alternative ones. Next, we revisit a simple baseline—hierarchical mixture models in the form of deep probabilistic circuits (PCs)—which delivers competitive or superior performance to SotA models for a fraction of the cost. PCs are the generative counterpart of decision forests, and as such can natively handle heterogeneous data as well as deliver tractable probabilistic generation and inference. Finally, in a rigorous empirical analysis we show that the apparent saturation of progress for SotA models is largely due to the use of inadequate metrics. As such, we highlight that there is still much to be done to generate realistic tabular data.

UAI 2026

Global Convergence of Average Reward Constrained MDPs with Neural Critic and General Policy Parameterization

Anirudh Satheesh, Pankaj Kumar Barman, Washim Uddin Mondal, Vaneet Aggarwal

We study infinite-horizon Constrained Markov Decision Processes (CMDPs) with general policy parameterizations and multi-layer neural network critics. Existing theoretical analyses for constrained reinforcement learning largely rely on tabular policies or linear critics, which limits their applicability to high-dimensional and continuous control problems. We propose a primal–dual natural actor–critic algorithm that integrates neural critic estimation with natural policy gradient updates and leverages Neural Tangent Kernel (NTK) theory to control function-approximation error under Markovian sampling, without requiring access to mixing-time oracles. We establish global convergence and cumulative constraint violation rates of 𝒪̃(T^-1/4) up to approximation errors induced by the policy and critic classes. Our results provide the first such guarantees for CMDPs with general policies and multi-layer neural critics, substantially extending the theoretical foundations of actor–critic methods beyond the linear-critic regime.

UAI 2026

Quantized Stochastic Primal–Dual Methods for Distributed Optimization under Relaxed Global Geometry

Susmit Sarkar, Abhinav Raghuvanshi, Kushal Chakrabarti, Mayank Baranwal

We study distributed optimization with stochastic gradients and finite-bit communication modeled by random (unbiased) quantization. We propose q-PDGD, a quantized stochastic primal–dual method, and analyze it under relaxed global geometry. Under restricted secant inequality (RSI), a constant step-size yields linear contraction to an explicit neighborhood determined by gradient noise, quantization distortion, and network connectivity, while a diminishing step-size achieves 𝒪(1/k) convergence without shared-minimizer assumptions. Under Polyak–Łojasiewicz (PL) inequality, we obtain linear-to-neighborhood convergence in the same stochastic quantized setting. Our results match the best-known centralized stochastic rates in oracle complexity, and are supported by experiments demonstrating the predicted tradeoffs between quantization level, step-size choice, and graph structure.

UAI 2026

Bayesian Adaptation Gym: A Benchmark for the Bayesian Low-Rank Adaptation of Multi-Modal Language Models

Colin Samplawski, Ramneet Kaur, Manoj Acharya, Anirban Roy, Adam D Cobb

Large multi-modal language models are increasingly deployed in high-stakes domains, making well-calibrated uncertainty essential. Traditional Bayesian methods approximate posteriors over all model weights, which becomes intractable for modern large models. For this reason, recent work instead considers Bayesian low-rank adaptation to enable tractable posterior approximation. Due to a lack of a standardized benchmark to evaluate these approaches, it remains unclear where these methods provide meaningful benefits. To fill this gap, we introduce Bayesian Adaptation Gym (BAG), a benchmark for the Bayesian adaptation of multi-modal language models. BAG provides reference implementations of classic Bayesian baselines and state-of-the-art adaptation methods, along with a multi-modal dataset and task suite designed to probe calibration, robustness under distribution shift, and decision-making under uncertainty via active learning. Using BAG, we conduct and report extensive experiments across model sizes, datasets, and tasks to highlight the successes and failures of current Bayesian adaptation approaches. To enable further research, BAG is fully open source: https://github.com/SRI-CSL/BayesAdapt.

UAI 2026

Variance Reduction for Non-Log-Concave Sampling with Applications to Inverse Problems

M. Berk Sahin, Ahmet Ege Tanriverdi, Behzad Sharif, Abolfazl Hashemi

Sampling from high-dimensional, non-log-concave distributions with unnormalized densities is a fundamental challenge in machine learning, particularly when the exact gradient of the potential is unavailable and must be approximated via stochastic gradients that exhibit high variance under a fixed budget of gradient computations per iteration. Although variance reduction techniques such as SGD with momentum, STORM, and PAGE have demonstrated improved convergence properties in non-convex optimization, their implications for sampling from non-log-concave distributions remain largely unexplored. In this work, we develop the first unified analysis of these estimators for sampling from non-log-concave distributions. We establish improved non-asymptotic convergence rates in ε-relative Fisher information and, under a Poincaré inequality assumption, in squared total variation distance, and further prove weak convergence to the target distribution. We extend our analysis to solving inverse problems with score-based generative priors. We empirically validate our theory and demonstrate that, under a fixed gradient computations per iteration, variance-reduction techniques consistently improve sample quality in two standard imaging applications.

UAI 2026

Fairness Uncertainty Quantification: A Constrained Stochastic Optimization Perspective

Abhishek Roy, Prasant Mohapatra

In this paper, we construct confidence interval (CI) for the test-unfairness of a group-fairness aware classifier trained by Stochastic Gradient Descent (SGD) type algorithms. Since these algorithms are almost invariably used to train modern machine learning models, the learned parameters—and consequently their fairness—are inherently random. We quantify this randomness, which can have far-reaching consequences, especially for sensitive applications. Viewing fairness-aware classification through the lens of constrained optimization allows us to leverage tools from stochastic approximation theory to establish the asymptotic normality of the estimated parameters. Existing work typically provides fairness guarantees either in expectation or for the exact minimizer of the constrained objective <cit.>, without accounting for the stochasticity induced by the optimization algorithm itself. To construct CIs for fairness in practice, we develop an easily parallelizable online multiplier bootstrap procedure. In doing so, we also extend theoretical guarantees for online bootstrap methods from unconstrained SGD to the constrained optimization setting which may be of independent interest. We illustrate the effectiveness of our approach through extensive simulations and experiments on benchmark datasets.

UAI 2026

VaSST: Variational Inference for Symbolic Regression using Soft Symbolic Trees

Somjit Roy, Pritam Dey, Bani Mallick

Symbolic regression (SR) has gained recent traction in AI-driven scientific discovery for learning closed-form physical laws. Yet existing methods are dominated by heuristic search or data-intensive approaches that often assume low-noise regimes and lack principled uncertainty quantification, while fully probabilistic SR formulations remain scarce. We introduce a scalable probabilistic framework for SR, VaSST, based on variational inference. VaSST uses soft symbolic trees, a continuous relaxation of symbolic expression trees in which discrete operator and feature assignments are replaced by probability distributions over allowable components. This transforms combinatorial symbolic search through an astronomically large expression space into efficient gradient-based optimization while preserving a coherent probabilistic interpretation. The learned soft representations induce posterior distributions over symbolic structures, enabling uncertainty quantification across plausible symbolic forms through posterior-aware symbolic model selection. On simulated experiments and the Feynman Symbolic Regression Database, VaSST achieves strong structural recovery and predictive accuracy compared to state-of-the-art competing SR methods.

UAI 2026

Kernel Integrated R^2: A Measure of Dependence

Pouya Roudaki, Shakeel Gavioli-Akilagun, Florian Kalinke, Mona Azadkia, Zoltan Szabo

We introduce kernel integrated R^2, a new measure of statistical dependence that combines the local normalization principle of the recently introduced integrated R^2 with the flexibility of reproducing kernel Hilbert spaces (RKHSs). The proposed measure extends integrated R^2 from scalar responses to responses taking values on general spaces equipped with a characteristic kernel, allowing to measure dependence of multivariate, functional, and structured data, while remaining sensitive to tail behaviour and oscillatory dependence structures. We establish that (i) this new measure takes values in [0,1], (ii) equals zero if and only if independence holds, and (iii) equals one if and only if the response is almost surely a measurable function of the covariates. Two estimators are proposed: a graph based method using K-nearest neighbours and an RKHS-based method built on conditional mean embeddings. We prove consistency and derive convergence rates for the graph-based estimator, showing its adaptation to intrinsic dimensionality. Numerical experiments on simulated data and a real data experiment in the context of dependency testing for media annotations demonstrate competitive power against state-of-the-art dependence measures, particularly in settings involving non-linear and structured relationships.

UAI 2026

Constrained Weighted Bayesian Bootstrap

Sam Rosen, Jason Xu

We prove the weighted Bayesian bootstrap, a method for approximate sampling of a posterior distribution, can be extended to sample from general constrained posterior distributions under mild assumptions. The method entails a simple algorithm that can take advantage of fast tools from convex optimization. Under regularity conditions, we show the asymptotic distribution of samples from the constrained weighted Bayesian bootstrap has a covariance matching the restricted maximum likelihood estimator, an efficient estimator. We assess the method empirically on a variety of constrained Bayesian problems, demonstrating broad applicability of the method as well as advantages over existing peer methods. The constrained weighted Bayesian bootstrap quickly samples from constrained posteriors, providing adequate uncertainty quantification for problems typically solved via optimization methods designed to deliver only a point estimate. As a case study, using constraints required in European-style option prices, uncertainty estimates of an option pricing surface are derived with constrained weighted Bayesian bootstrap.

Keep browsing

More papers from top AI conferences

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