This work introduces a method to decompose uncertainty in in-context learning for large language models.
problem Understanding the sources of uncertainty in in-context learning for large language models.
method Variational uncertainty decomposition framework without sampling from latent parameter posterior.
result Quantitative and qualitative validation of decomposed epistemic and aleatoric uncertainties.
A new method decomposes subjective risk into epistemic and aleatoric uncertainties.
problem Uncertainty quantification in modeling decisions.
method Subjective risk decomposition using strictly proper loss.
result Recovery of classic uncertainty measures and new learning-theoretic connections.
New method for uncertainty analysis in TabPFN, a state-of-the-art tabular transformer.
problem No method for uncertainty decomposition in TabPFN.
method Casted as a Bayesian predictive inference problem, derived variance estimators using predictive CLT.
result Fast to compute credible bands that target epistemic uncertainty and achieve near-nominal frequentist coverage.
This work introduces a bias-variance decomposition for proper scores, improving uncertainty estimation in predictive models.
problem Reliable uncertainty estimation for predictions in safety-critical applications, especially under domain drift.
method Developed a general bias-variance decomposition for proper scores, introducing the Bregman Information as the variance term.
result The decomposition provides novel formulations for different predictive tasks, including classification and model ensembles.
A framework preserves uncertainty in ensemble distillation.
problem Preserving uncertainty decomposition in ensemble distillation.
method General framework for distilling both regression and classification ensembles, preserving natural uncertainty decomposition.
result Framework maintains decomposition of predictive uncertainty.
Method provides formal guarantees for decomposing model uncertainty.
problem Decomposing model uncertainty into aleatoric and epistemic components.
method Higher-order calibration using k-snapshots.
result Formal guarantees for aleatoric uncertainty matching real-world distribution.
ProbFM provides principled uncertainty quantification for financial forecasting.
problem Lack of principled uncertainty quantification in financial applications.
method Probabilistic Time Series Foundation Model with Uncertainty Decomposition using Deep Evidential Regression (DER).
result DER maintains competitive forecasting accuracy while providing explicit epistemic-aleatoric uncertainty decomposition.
Paper decomposes risk into aleatoric and epistemic uncertainties and generates predictive uncertainty measures.
problem Unclear relationships between various predictive uncertainty measures in literature.
method Bayesian estimation to decompose risk into aleatoric and epistemic uncertainties, generating different predictive uncertainty measures.
result Experimental validation confirms usefulness of derived predictive uncertainty measures for detecting out-of-distribution and misclassified instances.
Bayesian neural networks (BNNs) with latent variables are probabilistic models which can automatically identify complex stochastic patterns in the data. We describe and study in these models a decomposition of predictive uncertainty into its epistemic and aleatoric components. First, we show how such a decomposition ar…
The paper introduces a new framework to assess generative model uncertainty.
problem Lack of a theoretical framework for assessing generative models' generalization and uncertainty.
method Bias-variance-covariance decomposition for kernel scores, with unbiased and consistent estimators.
result Kernel-based variance and entropy for uncertainty estimation are more predictive than existing methods.
This paper introduces a new framework for quantifying predictive uncertainty for both data and models that relies on projecting the data into a Gaussian reproducing kernel Hilbert space (RKHS) and transforming the data probability density function (PDF) in a way that quantifies the flow of its gradient as a topological…
Ensemble learning is a standard approach to building machine learning systems that capture complex phenomena in real-world data. An important aspect of these systems is the complete and valid quantification of model uncertainty. We introduce a Bayesian nonparametric ensemble (BNE) approach that augments an existing ens…
Study decomposes uncertainty in HK-distribution parameter estimation for QUS.
problem Uncertainty in HK-distribution parameter estimation for quantitative ultrasound.
method Bayesian Neural Networks (BNNs) for parameter estimation and uncertainty decomposition.
result Decomposes total predictive uncertainty into epistemic and aleatoric components.
Proposes a new method for uncertainty estimation in neural networks.
problem Uncertainty quantification in neural networks for high-risk applications.
method Intuitive framework based on signal-to-noise ratio and variance-gated measure.
result Demonstrates a collapse in diversity of committee machines.
Framework disentangles deep feature uncertainty for efficient inference.
problem Inference-time uncertainty estimation for reliable decision-making.
method Uncertainty-Guided Inference-Time Selection framework.
result Significantly tighter prediction intervals and 60% compute reduction.
A novel framework quantifies uncertainty using proper scores for various tasks.
problem Uncertainty quantification in machine learning for reliable applications.
method Proposes a general framework based on proper scores for epistemic, aleatoric uncertainty, and model calibration.
result Achieves state-of-the-art uncertainty estimation for large language models and generative models.
A novel double-space tensor-product RKHS framework for hybrid uncertainty sensitivity analysis.
problem Quantifying the influence of hybrid aleatory and epistemic uncertainties on high-dimensional system responses.
method A novel double-space tensor-product RKHS framework for sensitivity analysis under hybrid uncertainty.
result Concurrent double Möbius inversion orthogonally decomposes global dependence measure into pure aleatory effects, pure epistemic effects, and their interaction contributions.
Bayesian neural networks with latent variables are scalable and flexible probabilistic models: They account for uncertainty in the estimation of the network weights and, by making use of latent variables, can capture complex noise patterns in the data. We show how to extract and decompose uncertainty into epistemic and…
A new method to break down insurance costs into risk and uncertainty.
problem Understanding and quantifying insurance costs in uncertain environments.
method An axiomatic approach to decompose premium principles into risk and deviation measures.
result Maximal risk and minimal deviation measures can be uniquely identified in decompositions.
Depth uncertainty networks don't improve with bias correction, contrary to expectations.
problem Improving performance in active learning with overparameterised models like NNs.
method Depth uncertainty networks, compared to underparameterised models, show no improvement in performance with bias correction.
result Depth uncertainty networks do not improve with bias correction, unlike underparameterised models.
A new method reduces Volterra kernel complexity and uncertainty quantification.
problem Challenges in modeling nonlinear systems with Volterra series due to high model order.
method Bayesian Tensor Network Volterra kernel machines (BTN-V) using canonical polyadic decomposition.
result Competitive accuracy, enhanced uncertainty quantification, and reduced computational cost.
The paper decomposes probabilistic scores into reliability, uncertainty, and information loss.
problem Understanding the reliability and uncertainty of probabilistic predictions.
method Developed decomposition identities for proper losses, quantifying reliability, residual uncertainty, and information gain.
result A three-term identity for classification scores, revealing miscalibration, grouping term, and feature-level uncertainty.
BSG learns dynamic network spillovers and uncertainty quantification.
problem Identifying indirect spillovers and systemic risk in dynamic networks.
method Bayesian Spillover Graphs using FEVD and Bayesian time series models.
result Significant performance gains over baselines in identifying source and sink nodes.
Paper tackles uncertainty in GNNs for graph data.
problem Uncertainty in GNNs' predictions for graph data.
method CF-T2NN, tensor decomposition, topological learning.
result CF-T2NN improves reliability and interpretability of GNN outcomes.
Bayesian neural network models improve uncertainty quantification in multivariate regression.
problem Uncertainty quantification in multivariate regression models with heteroscedastic noise.
method Proposes Bayesian Last Layer neural network models and EM algorithms for parameter learning.
result Capable of disentangling aleatoric and epistemic uncertainty.
New method uses conformal prediction for time series forecasting, accounting for temporal correlation.
problem Uncertainty quantification in temporally correlated time series data.
method Time series decomposition with component-wise conformal prediction.
result The method provides customized prediction intervals for different temporal components.
New method estimates covariance in multi-view data with better accuracy and uncertainty.
problem Estimating covariance in multi-view data with shared and view-specific latent factors.
method Spectral decompositions and conditional conjugate priors for factor loadings and residual variances.
result Proves favorable asymptotic properties and excellent performance in simulations and real data.
Bayesian parametric matrix models provide uncertainty quantification for spectral learning.
problem Uncertainty quantification in spectral learning for safety-critical applications.
method Bayesian parametric matrix models (B-PMMs) that extend PMMs to provide uncertainty estimates.
result B-PMMs achieve exceptional uncertainty calibration (ECE < 0.05) while maintaining favorable scaling.
The target of this paper is to establish the bid-ask pricing frame work for the American contingent claims against risky assets with G-asset price systems (see \cite{Chen2013b}) on the financial market under Knight uncertainty. First, we prove G-Dooby-Meyer decomposition for G-supermartingale. Furthermore, we consider …
We consider the fundamental theorem of asset pricing (FTAP) and hedging prices of options under non-dominated model uncertainty and portfolio constrains in discrete time. We first show that no arbitrage holds if and only if there exists some family of probability measures such that any admissible portfolio value proces…
New method quantifies uncertainty at class level for better decision-making.
problem Improving cost-sensitive decision-making in classification tasks.
method Label-wise decomposition of uncertainty measures based on non-categorical metrics.
result Proposed measures adhere to desirable properties and improve uncertainty quantification.
A new approach to sensitivity analysis without the Sobol decomposition.
problem Traditional sensitivity indices like Sobol indices have limitations.
method Introducing sensitivity measures that generalize existing indices and define interaction effects.
result Sensitivity measures can create new indices and define interaction effects.
New method explains sensitivity of test data uncertainty in Bayesian inference.
problem Widespread belief that test data similarity reduces epistemic uncertainty.
method Information-theoretic decomposition of predictive uncertainty.
result Defines sensitivity using information-theoretic quantities.
New methods for scoring function decomposition improve forecast evaluation.
problem Improving forecast evaluation and understanding forecast components.
method Linear recalibration of forecasts for miscalibration, discrimination, and uncertainty.
result Enhanced statistical power and deeper insights into forecast components.
Novel framework for risk-sensitive reinforcement learning using martingale decomposition.
problem Risk sensitivity in sequential decision-making with uncertain rewards.
method Martingale decomposition and chaotic variation for reward uncertainty, integrated into model-free reinforcement learning algorithms.
result Demonstrated relevance of risk-sensitive reinforcement learning in grid world and portfolio optimization problems.
Proposes measures for uncertainty quantification using proper scoring rules.
problem Uncertainty quantification for prediction tasks.
method Decomposes proper scoring rules into divergence and entropy components, tailoring uncertainty quantification to specific tasks.
result Flexibility in uncertainty quantification improves performance in selective prediction and active learning.
Knowledge Graph (KG) embedding has attracted more attention in recent years. Most KG embedding models learn from time-unaware triples. However, the inclusion of temporal information beside triples would further improve the performance of a KGE model. In this regard, we propose ATiSE, a temporal KG embedding model which…
Bayesian deep learning accounts for input uncertainty using Errors-in-Variables models.
problem Uncertainty in deep regression models, especially from input data.
method Bayesian treatment with Errors-in-Variables model to decompose predictive uncertainty.
result The approach yields more complete and consistent uncertainty estimates.
Polynomial chaos surrogates quantify epistemic uncertainty in AI-driven scientific models.
problem Uncertainty in reward estimates hinders interpretability in sequential generative models.
method Fit polynomial chaos expansions to trained models to propagate epistemic uncertainty and quantify sensitivity.
result Interpretable decomposition of reward components driving generative decisions.
Geopolitical and geoeconomic shocks affect sovereign risk differently, with distinct transmission channels.
problem Understanding how geopolitical and geoeconomic shocks impact sovereign credit risk.
method Daily panel data of 42 economies over 2018-2025; semistructural framework; Shapley-Taylor decomposition; machine learning predictions; placebo and sign-restricted SVAR evidence.
result Geopolitical shocks primarily increase sovereign credit spreads through direct repricing, while geoeconomic shocks mainly affect spreads through financial conditions and policy uncertainty.
PG-EVIKAL refines molecular property predictions using neighbor fusion and evidential neural networks.
problem Improving molecular property predictions using test-time neighbor fusion.
method Adapting evidential neural networks to refine predictions by re-ranking structurally similar neighbors.
result PG-EVIKAL reduces RMSE on 14 out of 16 molecular datasets, improving calibration and sequential refinement.
We present a method to quantify uncertainty in the predictions made by simulations of mathematical models that can be applied to a broad class of stochastic, discrete, and differential equation models. Quantifying uncertainty is crucial for determining how accurate the model predictions are and identifying which input …
This paper reviews Bayesian methods for sparsity-aware modeling.
problem Uncertainty evaluation and robustness in sparsity-aware models.
method Incorporates sparsity-promoting priors into deep neural networks, Gaussian processes, and tensor decomposition.
result Bayesian methods improve model robustness and uncertainty evaluation.
New model reconstructs flow from sparse data with uncertainty quantification.
problem Reconstructing nonlinear flow from limited observations.
method Semi-Conditional Variational Autoencoder (SCVAE) for probabilistic flow reconstruction.
result SCVAE improves reconstruction accuracy compared to Gappy Proper Orthogonal Decomposition (GPOD).
Techniques for understanding the functioning of complex machine learning models are becoming increasingly popular, not only to improve the validation process, but also to extract new insights about the data via exploratory analysis. Though a large class of such tools currently exists, most assume that predictions are p…
A Gaussian Process Ordinary Differential Equation framework for large continuous dynamical systems
problem Forecasting complex dynamical systems
method Kernel autonomous ODE approach based on Gaussian Processes and Quadratic Order Model Reduction
result Full model outperforms ROM methods in terms of accuracy or computational costs
A new method optimizes complex engineering designs under uncertainty efficiently.
problem Optimizing large, uncertain engineering designs with limited resources.
method Multi-level informed optimization via decomposed Kriging.
result Significantly faster and more accurate optimization compared to state-of-the-art methods.
We report on time-varying network connectedness within three banking systems: North America, the EU, and ASEAN. The original method by Diebold and Yilmaz is improved by using exponentially weighted daily returns and ridge regularization on vector autoregression (VAR) and forecast error variance decomposition (FEVD). We…