Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

126252378504 · Jun 202019922001200920172026
48 results for Uncertainty Bounds

Two-step conformal prediction method for adaptive bounding box uncertainties in multi-object detection.

problem Quantifying predictive uncertainty for multi-object detection in safety-critical applications.
method Developed a two-step conformal prediction approach to propagate uncertainty in predicted class labels into bounding box uncertainties, ensuring coverage for incorrectly classified objects.
result Desired coverage levels are satisfied with practically tight predictive uncertainty intervals on real-world datasets.

Paper improves uncertainty quantification in PINNs using error bounds and solution bundles.

problem Uncertainty quantification in PINNs for differential equation systems.
method Two-step procedure with Bayesian Neural Networks and heteroscedastic variance.
result Improved uncertainty estimation over PINNs solutions in differential equation systems.

New rigorous uncertainty bounds for Gaussian Process regression.

problem Need for frequentist uncertainty bounds in applications like learning-based control.
method Introduce new uncertainty bounds that are rigorous and practically useful.
result New bounds are less conservative and more useful for practical applications.

BCPO optimizes offline RL policies by converting uncertainty into conservative bounds.

problem Offline RL's fragility under distribution shifts and model errors.
method Bayesian approach with credible lower bounds and KL regularization.
result BCPO yields an uncertainty-calibrated policy that avoids exploiting model errors.

The paper bounds solutions to complex optimization problems with uncertain data.

problem Distributionally robust optimization problems with multivariate uncertainty sets.
method Conditions and bounds derived for multivariate and univariate Wasserstein distances, Bregman-Wasserstein divergences, and signed Choquet integrals.
result Computable lower and upper bounds for DRO problems, derived from scalar-valued aggregation functions and Wasserstein distances.

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.

Paper develops a new RL method for MDPs with uncertainty, achieving better regret bounds.

problem Online reinforcement learning in environments with both endogenous and exogenous uncertainty.
method Developed a VB-UCRL algorithm that restarts based on variation schedules.
result Established a regret bound of saving at most S\sqrt{S} or S16T112S^{\frac{1}{6}}T^{\frac{1}{12}}.

The paper evaluates and improves uncertainty estimates in neural networks for safety-critical applications.

problem Quantifying uncertainty in neural networks for safety-critical systems.
method Proposes a statistical test for evaluating uncertainty realism in neural networks and transfers a classification architecture to image-to-image tasks.
result The variational U-Net architecture significantly improves uncertainty realism in image-to-image tasks compared to a plain model.

TULiP estimates uncertainty for deep learning models safely.

problem Reliable uncertainty estimation for deep learning models in the open world.
method TULiP considers a hypothetical perturbation, bounds its effect, and computes uncertainty from sampled predictions.
result TULiP achieves state-of-the-art performance in OOD detection benchmarks.

In many safety-critical applications such as autonomous driving and surgical robots, it is desirable to obtain prediction uncertainties from object detection modules to help support safe decision-making. Specifically, such modules need to estimate the probability of each predicted object in a given region and the confi…

2018-11-27abs ↗pdf ↗

New algorithm reduces regret in RL with adversarial corruption.

problem Adversarial corruption in reinforcement learning.
method Uncertainty-weighted least-squares regression and weighted uncertainty estimator.
result Achieves regret of ildeO(T+ζ) ilde{O}(\sqrt{T} + ζ) for contextual bandits.

New framework identifies and reduces errors in machine learning under distribution shift.

problem Errors in machine learning models when distributions change.
method Developed a principled framework to characterize and eliminate epistemic errors in imperfect multitask learning.
result Provided a decompositional epistemic error bound for general settings of distribution shift.

A new method optimizes robustness measures under input uncertainty using randomized Gaussian process upper confidence bound.

problem Optimizing robustness measures under input uncertainty.
method Randomized robustness measure GP-UCB (RRGP-UCB) that samples β from a chi-squared-based distribution.
result RRGP-UCB provides tight bounds on expected regret.

Paper introduces CRP-O framework for uncertainty quantification in deep operators.

problem Uncertainty quantification in energy-efficient deep learning algorithms, especially in SNNs.
method CRP-O framework using RP networks and SCP, with Gaussian Process Regression for super-resolution.
result Enhanced uncertainty bounds improve UQ estimates compared to existing methods.

The paper evaluates joint life insurance risk under dependence uncertainty using copulas and convex risk measures.

problem Evaluating risk of joint life insurance products under uncertainty in dependence structure.
method Monotonicity of risk evaluation with concordance order, linear programming for bounds, and numerical analysis.
result Bounds for mean, Value-at-Risk, and Expected Shortfall computed using linear programs.

New framework improves model reliability under distribution shifts.

problem Lack of formal guarantees connecting shift magnitude to prediction reliability in TTA methods.
method Develops a PAC-Bayesian framework interpreting MMD-balls as credal sets.
result Establishes generalization bounds and provides epistemic uncertainty quantification.

The paper sets limits on the accuracy of macroeconomic forecasts based on statistical moments and trade volumes.

problem Uncertainty in predicting macroeconomic variables like prices and returns.
method Defines theoretical lower bounds of uncertainty and upper limits on forecast accuracy based on statistical moments and trade volumes.
result Accuracy of forecasts of probabilities of macroeconomic variables doesn't exceed Gaussian approximations.

Novel MOBO method for risk measures under input uncertainty.

problem Efficiently identifying Pareto front for black-box functions with input uncertainty.
method Assumes Gaussian process model and constructs bounding boxes for risk measures.
result The method can return an arbitrary-accurate solution with high probability.

Proposes new priors for neural networks to improve generalization and uncertainty.

problem Improving generalization and uncertainty estimation in neural networks.
method Exploits scalable and structured posteriors as priors with generalization guarantees.
result Improves generalization and uncertainty estimation with non-vacuous bounds.

Bayesian regression underestimates parameter uncertainties in noisy models.

problem Parameter uncertainties are underestimated in Bayesian regression for imperfect models.
method Analyzed and designed an ansatz to correct for misspecification in near-deterministic surrogate models.
result Posterior distributions must cover all training points to avoid divergent generalization error.

Paper quantifies distortion risk measures' robustness to distributional uncertainty.

problem Quantifying risk measures' robustness to distributional uncertainty.
method Employing isotonic projections, the paper derives bounds on distortion risk measures' values.
result Sharp bounds on distortion risk measures' values are provided, especially for Value-at-Risk and Range-Value-at-Risk.

We extend Bayes' theorem for upper probabilities considering likelihood uncertainty.

problem Addressing uncertainty in likelihood for upper probability bounds.
method Generalization of Wasserman and Kadane's result, considering both prior and likelihood uncertainty.
result A sufficient condition for the upper bound to become an equality.

New method quantifies uncertainty in reinforcement learning models.

problem Quantifying uncertainty over expected cumulative rewards in reinforcement learning.
method Proposes a new uncertainty Bellman equation to more accurately estimate value function variance.
result Our method converges to the true posterior variance over values and improves sample-efficiency.

We study the problem of safe learning and exploration in sequential control problems. The goal is to safely collect data samples from operating in an environment, in order to learn to achieve a challenging control goal (e.g., an agile maneuver close to a boundary). A central challenge in this setting is how to quantify…

2019-06-13abs ↗pdf ↗

Bayesian meta learning improves uncertainty quantification in regression.

problem Trusting uncertainty quantification in Bayesian regression.
method Trust-Bayes framework for Bayesian meta learning, optimizing for trustworthy uncertainty quantification.
result Lower bounds and sample complexity for trustworthy uncertainty quantification are characterized.

New method improves uncertainty quantification for large batch sizes and misspecified models.

problem Challenges in tuning algorithms for accurate uncertainty quantification in large batch sizes and misspecified models.
method Proposes new discrete-time approximations to SGD and SGLD, proving error bounds for practical tuning.
result Quantitative, non-asymptotic error bounds for accurate predictions of covariance and autocorrelation time.

Structured credal learning separates covariate shift and label disagreement.

problem Uncertainty in real-world learning tasks due to covariate shift and noisy labels.
method Introduces a structured credal learning framework that explicitly separates these sources.
result Geometric bounds and decomposition reveal how covariate shifts affect label disagreement contributions.

Researchers find a way to price American options without relying on specific asset price models.

problem Determining the upper bound on the price of American options under model uncertainty.
method Using martingale optimal transport problem to describe model uncertainty and proving that optimal exercise schemes must be nonrandomized under certain conditions.
result The price upper bound and its relaxed version coincide under suitable convexity conditions, removing the need for the model-free price upper bound to be nonrandomized.