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

Information-Theoretic Lower Bounds for Causal Inference under Credal Uncertainty

Hung Mai, Hai Nguyen, Khanh Nguyen, Luong Doan, Nhung Duong, Phong Ho, Tuan Do

Causal effect estimation from observational data typically assumes a single fixed observational distribution. We study the setting in which the distribution is known only to belong to a credal set, a convex set of plausible observational laws. Our results characterize how this observational ambiguity is transformed by causal identification formulas. First, using standard two-point information-theoretic tools after composition with the interventional map, we derive lower bounds for causal effect estimation. The key message is a causal amplification phenomenon: observational discrepancies in low-propensity treatment strata can be hard to detect while producing separated interventional effects. Consequently, in the binary hard-pair constructions, sample complexity scales as Ω(1/(π_0ε^2)) or Ω(1/(β_0ε^2)), and the average treatment effect need not incur an additional dependence on the number of strata. Second, we prove Lipschitz bounds for the interventional mapping, with amplification factor (1+1/α_min), showing how positivity controls robust identification width. Third, we study minimax regret for causal decisions under credal uncertainty and show that randomization can halve worst-case regret in a symmetric action-separation construction. We also give matching upper bounds in special cases and an NP-hardness result for computing robust identification width. The experiments are diagnostic checks of the tight hard-instance scaling laws rather than broad empirical benchmarks.

UAI 2026

Approximating Nash Equilibria in Finite-Horizon Multi-Adversarial Team Markov Games

Prasanna Maddila, Régis Sabbadin, Meritxell Vinyals

Multi-Adversarial Team Games (MATGs) extend the canonical normal-form framework of von Stengel and Koller – where a team of players sharing a common objective but unable to coordinate faces a single adversary - to settings involving multiple independent adversaries. From an algorithmic perspective, MATGs are notable as one of the few game classes admitting polynomial-time algorithms for computing ε-Nash equilibria. However, no complexity or algorithmic guarantees are known for the finite-horizon Markovian generalisation of MATGs. This paper establishes positive and negative results for approximating non-stationary Nash equilibria in finite-horizon Multi-Adversarial Team Markov Games. Specifically, we provide a polynomial-time algorithm for the single-adversary case, prove PPAD-hardness for the multiple-adversary case and present a polynomial-time algorithm for the multiple-adversary setting with additive transitions. We also provide an empirical evaluation of the proposed algorithms.

UAI 2026

Bayesian Causal Discovery in Directed Cyclic Graphs with Closed-Form Lag Bayes Factors

Seyed Reza Maadi, Sally Cripps

In coarsely sampled longitudinal data, feedback loops can appear as cyclic contemporaneous structure, yet most causal-discovery methods assume acyclicity. Bayesian directed cyclic graph models allow cycles by using non-Gaussian errors with lagged outcomes and exogenous covariates to identify contemporaneous structure. However, consecutive lags are often highly correlated. Existing methods place a binary indicator on each candidate lag, creating exponentially many lag patterns per edge; evidence for a true edge can split across correlated configurations and fall below selection thresholds (posterior fragmentation). We replace these indicators with one categorical variable recording edge absence or active lag, so lags compete within one state space. Under the Gaussian scale-mixture of Laplace errors, each candidate coefficient integrates out exactly, yielding closed-form Bayes factors from cached scalars with no matrix operations for lag comparison. We prove edge-and-lag selection consistency and show that the at-most-one-active-lag assumption is least costly where fragmentation is most severe; the method is a finite-sample regulariser for correlated-lag regimes, not a uniformly better alternative. Cached sufficient statistics and incremental Cholesky updates make the sampler 55–67 times faster without changing the target posterior. In the largest single-lag synthetic benchmark, the categorical encoding raises the true-positive rate from 0.83 to 0.99 and lowers structural Hamming distance from 6.0 to 0.3. On the Health and Retirement Study panel (17,883 individuals, 13 waves), both formulations share a four-edge contemporaneous core, but the categorical encoding yields larger autoregressive coefficients and a sparser contemporaneous graph than the independent encoding.

UAI 2026

Learning Expressive Random Feature Models via Parametrized Activations

Zailin Ma, Jiansheng Yang, Yaodong Yang

The random feature (RF) method is a powerful kernel approximation technique, but it typically uses fixed activation functions, limiting its adaptability across diverse tasks. To overcome this limitation, we introduce the Random Feature Model with Learnable Activation Functions (RFLAF), a novel statistical model that parameterizes activation functions as weighted sums of basis functions within the random feature framework. Examples of basis functions include radial basis functions (RBFs), spline functions, polynomials, and so forth. For theoretical results, we consider RBFs as representative basis functions. We start with a single RBF as the activation, and then extend the results to multiple RBFs, demonstrating that RF models with a learnable activation component substantially expand the represented function space. We provide estimates on the required number of samples and random features to achieve low excess risk. In our experiments, we test RFLAF with three types of bases: radial basis functions, spline functions and polynomials. Experimental results show that RFLAFs with RBFs and splines consistently outperform other RF models, where RBFs are three times more computationally efficient than splines. We then unfreeze the first-layer parameters and retrain the models, validating the expressivity advantage of learnable activation components on regular two-layer neural networks. Our work provides a deeper understanding of learnable activation components within modern neural network architectures.

UAI 2026

First-Order Softmax Weighted Switching Gradient Method for Distributed Stochastic Minimax Optimization with Stochastic Constraints

Zhankun Luo, Antesh Upadhyay, Sang Bin Moon, Abolfazl Hashemi

This paper addresses the distributed stochastic minimax optimization problem subject to stochastic constraints. We propose a novel first-order Softmax-Weighted Switching Gradient method tailored for federated learning. Under full client participation, our algorithm achieves the standard 𝒪̃(ϵ^-4) oracle complexity to satisfy a unified bound ϵ for both the optimality gap and feasibility tolerance. We extend our theoretical analysis to the practical partial participation regime by quantifying client sampling noise through a stochastic superiority assumption. Furthermore, by relaxing standard boundedness assumptions on the objective functions, we establish a strictly tighter lower bound for the softmax hyperparameter. We provide a unified error decomposition and establish a sharp 𝒪(log1/δ) high-probability convergence guarantee. Ultimately, our framework demonstrates that a single-loop primal-only switching mechanism provides a stable alternative for optimizing worst-case client performance, effectively bypassing the hyperparameter sensitivity and convergence oscillations often encountered in traditional primal-dual or penalty-based approaches. We verify the efficacy of our algorithm via experiment on the Neyman-Pearson (NP) classification, fair classification, and federated safe reinforcement learning tasks.

UAI 2026

The relative value of interventional and observational samples in Bayesian Causal Linear Gaussian Models

Valentinian Mihai Lungu, Anish Dhir, Mark van der Wilk, Ioannis Kontoyiannis

We investigate the asymptotic properties of Bayesian bivariate causal discovery for Gaussian Linear Structural Equation Models (SEMs) with heteroscedastic noise. We demonstrate that with purely observational data, the posterior distribution over the models fails to consistently identify the true causal structure—a consequence of the fundamental non-identifiability within the Markov Equivalence Class. Specifically, if the true generating mechanism corresponds to a connected graph (A → B or B → A), the asymptotic behavior of the posterior is given by the ratio between the prior on the true model and the push-forward prior of the alternative. In contrast, for the independence model, we establish that the posterior concentrates at a stochastic polynomial rate of O_p(n^-1/2). To resolve this non-identifiability, we incorporate m interventional samples and characterize the concentration rates as a function of the observational-to-total sample ratio, η. We identify a sharp concentration dichotomy: while the independence graph maintains a polynomial O_p(N^-1/2) rate (where N = n+m), connected graphs undergo a phase transition to exponentially fast convergence. This highlights an exponential relative importance between the two data types, as altering the amount of one data type directly changes the exponent governing the concentration speed. We derive explicit formulae for the exponential decay rates and provide precise conditions under which mixing observational and interventional data optimizes concentration speed. Finally, our theoretical findings are validated through empirical simulations in Bayesian Gaussian equivalent (BGe)-style prior specifications offering a principled foundation for experimental design in Bayesian causal discovery.

UAI 2026

Computing Exact Nash Equilibria in Graphical Games: A Geometric Approach to Paths, Stars, and Caterpillars

Evan Lucca, Mohammad T. Irfan, Luis E. Ortiz

Computing mixed-strategy Nash equilibria (MSNE) in graphical games being PPAD-complete, special types of graphical games have received a lot of attention over the years. We present a number of new results using a geometric approach to computing exact MSNE. We consider graphical games of several structures, such as paths, stars, and caterpillars. We also consider graphical polymatrix games on these structures. We provide a new tight upper bounding result for path-structured graphical games and a new quadratic-time algorithm for representing all MSNE and computing one for path-structured polymatrix games. For star graphical games, our algorithm is logarithmic time for non-degenerate cases (i.e., without symmetric players) and linear time for general cases with symmetric players. Interestingly, having more symmetric players makes the computation more expensive. For star polymatrix games, our algorithm is linear in the input size. For the open problems on caterpillar polymatrix and graphical games, our algorithms are polynomial time in the input size.

UAI 2026

Conformal Prediction Sets for Instance Segmentation

Kerri Lu, Dan M. Kluger, Stephen Bates, Sherrie Wang

Current instance segmentation models achieve high performance on average predictions, but lack principled uncertainty quantification: their outputs are not calibrated, and there is no guarantee that a predicted mask is close to the ground truth. To address this limitation, we introduce a conformal prediction algorithm to generate adaptive confidence sets for instance segmentation. Given an image and a pixel coordinate query, our algorithm generates a confidence set of instance predictions for that pixel, with a provable guarantee for the probability that at least one of the predictions has high Intersection-Over-Union (IoU) with the true object instance mask. We apply our algorithm to instance segmentation examples in agricultural field delineation, cell segmentation, and vehicle detection. Empirically, we find that our prediction sets vary in size based on query difficulty and attain the target coverage, outperforming baselines (naive best parameter and morphological dilation-based methods). We provide versions of the algorithm with asymptotic and finite sample guarantees. Our work is the first to capture structural uncertainty in instance segmentation by constructing confidence sets of diverse segmentation predictions.

UAI 2026

When Can We Learn from Noisy Logical Data? Parameterized Complexity of Approximate Concept Fitting in Description Logics

Chang Lu, Yizheng Zhao, Renate Schmidt

SAT-based bounded fitting—searching for a smallest logical concept that correctly classifies all given examples—yields sample-efficient PAC learning for structured hypothesis classes such as description logic (DL) concepts. Yet this paradigm is fundamentally brittle: it demands realizability, and a single mislabeled example can render the underlying SAT instance unsatisfiable. While agnostic learnability follows from finite VC-dimension of bounded-size concept classes, the real barrier is computational: minimizing misclassifications over all concepts of bounded size is NP-hard. We study this barrier through parameterized complexity. We introduce ApxFit(k,t)—the problem of deciding whether there exists a DL concept of size at most k that misclassifies at most t out of m examples—and establish a complexity landscape for fragments of 𝒜ℒ𝒞 whose operator sets contain {⊓,∃} or {⊔,∀}: the problem is W[2]-hard parameterized by concept size k (even for t=0), yet lies in XP parameterized by outlier count t for any fixed k. Algorithmically, we lift bounded fitting from SAT to partial weighted MAX-SAT and combine it with structural risk minimization, yielding the first noise-tolerant DL concept learner with formal agnostic generalization guarantees.

UAI 2026

Score-Regularized Joint Sampling with Importance Weights for Flow Matching

Xinshuang Liu, Runfa Li, Shaoxiu Wei, Truong Nguyen

Flow matching models effectively represent complex distributions, yet estimating expectations of functions of their outputs remains challenging under limited sampling budgets. Independent sampling often yields high-variance estimates, especially when rare but high-impact outcomes dominate the expectation. We propose a non-IID sampling framework that jointly draws multiple samples to cover diverse, salient regions of a flow matching model’s generative distribution. To balance diversity and quality, we introduce a score-based regularization for the diversity mechanism (SR), which uses the score function, i.e., the gradient of the log probability, to ensure samples are pushed apart within high-density regions of the data manifold, mitigating off-manifold drift. To enable unbiased estimation when desired, we further develop an approach for importance weighting of non-IID flow samples by learning a residual velocity field that reproduces the marginal distribution of the non-IID samples and by evolving importance weights along trajectories. Empirically, our method produces diverse, high-quality samples and accurate importance-weight estimates and debiased expectation estimates, advancing the reliable characterization of flow matching model outputs.

UAI 2026

LENS: Latent Precision Inference in Multi-LLM Routing

Juntao Liu, Lixing Yu, Kun Yue, Zhiwen Tang

Large language model (LLM) routing aims to select an appropriate model for each query under performance–cost trade-offs. A natural approach to improve adaptivity is to leverage interaction feedback to form behavioral signatures and continuously refine routing decisions as the environment changes. However, in realistic deployments, such feedback can have highly variable effective precision due to selective logging, imperfect evaluation signals, and temporal drift. As a result, behavioral signatures may be noisy or weakly informative, and treating them as uniformly precise can miscalibrate performance estimation and destabilize routing effectiveness. We propose the Latent prEcisioN inference System (LENS), a probabilistic routing framework that explicitly models the latent precision of interaction-derived signals. LENS formulates routing as posterior utility maximization under imprecise supervision, and marginalizes over latent precision to adaptively control how strongly behavioral signatures influence model selection. We instantiate LENS with an efficient variational inference procedure and evaluate it on multi-LLM routing benchmarks across diverse tasks and distribution shifts. Experimental results show that LENS consistently improves performance–cost trade-offs, with particularly strong gains under task and model shifts.

UAI 2026

EagleConv: Bio-inspired Dual-Foveated Convolution for Robust Small Object Detection

Jianwei Liu, Lifei Hao, Baoqi Huang, Bing Jia, Xuandong Zhao

Small object detection underpins wide-area vision tasks such as UAV and remote-sensing imagery. However, standard convolutions often exhibit low-pass smoothing behavior, which suppresses the sparse edge cues of tiny targets and may cause them to be overwhelmed by background clutter, leading to semantic information loss at the early stages of feature extraction. Inspired by the dual-fovea physiology of the eagle eye, we propose EagleConv, a bio-inspired operator that superimposes three Gaussian components into a center-excitation, surround-inhibition, peripheral-context response profile to selectively amplify small-object signals while attenuating noise. Architecturally, EagleConv adopts a sparse dual-pathway design that integrates partial-channel depthwise dual-foveated filtering, pointwise channel mixing, and adaptive residual gating, followed by anti-aliasing downsampling for robust dimensionality reduction. Experiments on three public benchmarks show that augmenting YOLOv11s with EagleConv delivers consistent and significant gains over multiple convolution-augmentation baselines, achieving state-of-the-art performance and confirming its transferability and generality as a plug-and-play module for wide-area small-object detection.

UAI 2026

Constrained Random Forest for Domain-Generalizable Classification

Camilla Lingjærde, Geir Kjetil Sandve, Arnoldo Frigessi, Sylvia Richardson, Johan Pensar

Domain generalization is a critical challenge in machine learning, where models must generalize outside their training domain(s) to unseen test or deployment domains without retraining. Motivated by the principle of independent causal mechanisms, the notion of domain invariance provides a principled causality-inspired approach to domain generalization. In this context, we introduce a general domain-constrained supervised learning framework where the aim is to learn a representation of the input data that results in improved domain invariance and stability in the resulting prediction model. Adapting the framework to tree-based learning, we introduce the Constrained Random Forest that prioritizes stable predictive mechanisms, leading to improved generalization across diverse environments. Experiments on synthetic and real-world datasets show improved robustness over competing methods, even in settings where the underlying assumptions that enable domain-invariant learning in theory are violated.

UAI 2026

Gradient-Guided Reward Optimization for Inference-time Alignment

Hankun Lin, Ruqi Zhang

Ensuring the reliability of Large Language Models (LLMs) under distribution drift requires inference-time adaptation. While inference-time alignment methods such as Best-of-N and rejection sampling are widely used, they frame the task as a sampling-intensive, reward-guided search, leading to two key limitations: their performance is bounded by the base model’s generation quality, and their reliance on imperfect reward models makes them vulnerable to reward hacking. To address these challenges, we introduce *Gradient-Guided Reward Optimization* (GGRO), a lightweight inference-time method that performs targeted, minimal intervention during decoding via gradient guidance. Specifically, GGRO monitors token-level entropy to identify high-uncertainty regions indicative of drift or misalignment. Upon detection, it responds by injecting nudging tokens, generated using gradient signals from an off-the-shelf reward model, to steer the generation trajectory rather than merely re-ranking samples. Experiments show that GGRO consistently improves inference-time alignment across safety, helpfulness, and reasoning benchmarks. It also increases coverage of high-quality responses and robustness to reward hacking, with minimal computational overhead. Code is available at https://github.com/lhk2004/GGRO.

UAI 2026

Overcoming Dependent Censoring in the Evaluation of Survival Models

Christian Marius Lillelund, Shi-ang Qi, Russell Greiner

Dependent censoring occurs when the event time and censoring time are not conditionally independent given the observed covariates. This complicates survival model evaluation because widely used metrics, such as the Brier score, typically handle right-censoring using inverse probability of censoring weighting (IPCW). Unfortunately, IPCW is valid only when the estimated censoring distribution is independent of the event time. We propose a dependent Brier score based on an Archimedean copula and the Copula-Graphic estimator, and establish consistency and asymptotic normality of its margin-time estimator. To evaluate the metric, we introduce a semi-synthetic framework that creates realistic dependent censoring while preserving the original covariate structure and known event times. Across 12 datasets, the proposed metric reduces estimation error by 12-16

UAI 2026

Grokked Models are Better Unlearners

Yuanbang Liang, Yang Li

*Grokking*—delayed generalization that emerges well after a model has fit the training data—has been linked to robustness and representation quality. We ask whether this training regime also helps with *machine unlearning*, i.e., removing the influence of specified data without full retraining. We compare applying standard unlearning methods *before* versus *after* the grokking transition across vision (CNNs/ResNets on CIFAR, SVHN and ImageNet) and language (a transformer on a TOFU-style setup). Starting from grokked checkpoints consistently yields (i) more **efficient forgetting** (fewer updates to reach a target forget level), (ii) **less collateral damage** (smaller drops on retained and test performance), and (iii) **more stable updates** across seeds, relative to early-stopped counterparts under identical unlearning algorithms. Analyses of features and curvature further suggest that post-grokking models learn *more modular representations* with reduced gradient alignment between forget and retain subsets, which facilitates selective forgetting. Our results highlight **when** a model is trained (pre- vs. post-grokking) as an orthogonal lever to **how** unlearning is performed, providing a practical recipe to improve existing unlearning methods without altering their algorithms.

UAI 2026

HHC: Hierarchical Hypergraph Communication for Multi-Agent Systems

Qifan Liang, Chenlong Li, Feiyu Wang, Jing Fu, Yixiang Shan, Lu Guo, Wei Liu, Lichang Song, Ting Long

Cooperative multi-agent reinforcement learning (MARL) faces significant coordination challenges due to partial observability. Although communication can mitigate these issues, traditional methods often overlook the fact that agents can simultaneously belong to multiple collaborative groups, playing diverse roles. This limitation hinders the effective integration of tactical and strategic information. To address this, we propose Hierarchical Hypergraph Communication (HHC). In HHC, agents are modeled via a tactical-level hypergraph that supports overlapping multi-group memberships, facilitating the extraction of fine-grained tactical features. Simultaneously, these tactical hyperedges serve as virtual nodes to integrate and communicate strategic intents within a strategic-level hypergraph. This dual-layered architecture empowers agents to align individual actions with global strategies through a hierarchical communication process, thereby enhancing decision-making capabilities. Extensive experiments demonstrate the effectiveness of HHC in complex coordination tasks.

UAI 2026

Probabilistic Verification of Neural Networks via Efficient Probabilistic Hull Generation

Jingyang Li, Xin Chen, Hongfei Fu, Guoqiang Li

The problem of probabilistic verification of a neural network investigates the probability of satisfying the safe constraints in the output space when the input is given by a probability distribution. It is significant to answer this problem when the input is affected by disturbances which are often modeled by probabilistic variables. In the paper, we propose a novel neural network probabilistic verification framework which computes a guaranteed range for the safe probability by efficiently finding safe and unsafe probabilistic hulls. Our approach consists of three main innovations: (1) a state space subdivision strategy using regression trees to produce probabilistic hulls, (2) a boundary-aware sampling method which identifies the safety boundary in the input space using samples that are later used for building regression trees, and (3) iterative refinement with probabilistic prioritization for computing a guaranteed range for the safe probability. The accuracy and efficiency of our approach are evaluated on various benchmarks including ACAS Xu and a rocket lander controller. The result shows a clear improvement over the state of the art.

UAI 2026

Exploiting Concavity Information in Contextual Bandit Optimization

Kevin Li, Eric Laber

The contextual bandit models sequential decision-making problems in which rewards depend on both the chosen action and observed context. In many domains such as medicine, business, and engineering, prior knowledge provides structural information about the reward function that can be exploited to improve optimization efficiency. This paper studies settings where, for each observable context, the conditional mean reward is known to be concave with respect to the action variable. To leverage this structure, we develop a contextual bandit algorithm that conditions a Bayesian Gaussian Process posterior on concavity constraints. We propose a novel reward model that combines a concavity-preserving regression spline basis with a constrained GP posterior, yielding a tractable shape-constrained estimator. Building on this model, we construct a UCB algorithm and establish new posterior concentration inequalities for the constrained posterior, leading to regret guarantees that are never worse than applying standard GP-UCB without concavity information and can be strictly tighter when concavity is informative. Experiments on benchmark problems and a Warfarin dosing test application demonstrate substantial reductions in cumulative regret relative to state-of-the-art baselines.

UAI 2026

Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement

Guoming Li, Jian Yang, Xukun Wang, Zixiao Wang, Shangsong Liang, Yifan Chen

Coarsening-based training for graph neural networks (GNNs), i.e. training on coarsened graphs rather than the original large ones, has become a promising direction for scaling GNNs to massive graphs. However, prior work has been evaluated almost exclusively on *homophilic* graphs, leaving the more challenging *heterophilic* settings underexplored. We show, both empirically and theoretically, that existing coarsening-based training methods suffer significant performance degradation on heterophilic graphs due to inevitable loss of graph information during coarsening. To address this, we propose **A**daptive **C**omplementary **E**nhancement, a plug-and-play, model-agnostic strategy that reintegrates the information discarded in coarsening: ACE learns a projector for re-constructing original node features and applies *anisotropic structural regularization* to embed local heterophily. We further adopt *homoscedastic uncertainty weighting* to adaptively balance the combined training objective of primary coarsened-graph training loss and full-graph auxiliary loss with augmented node features re-constructed by the heterophily-aware projector. Extensive experiments show that ACE drives consistent gains on heterophilic benchmarks while preserving competitive results on homophilic graphs with minimal computational overhead. Code is available at the GitHub repository: < https://github.com/vasile-paskardlgm/ACE >.

Keep browsing

More papers from top AI conferences

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