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

222444666888 · Jun 202019922001200920172026
48 results for Uncertainty Sets

Dual representations for robust risk measures and uncertainty sets.

problem Characterizing continuity of robust risk measures and their uncertainty sets.
method Develop dual representations for robust risk measures and uncertainty sets based on distinct geometric assumptions.
result Two dual frameworks for consolidated uncertainty sets are complementary, not interchangeable.

The volume of a credal set correlates with epistemic uncertainty in binary classification but not in multi-class.

problem Representing and quantifying epistemic uncertainty in machine learning.
method Examined the geometric representation of credal sets as dd-dimensional polytopes and their volume as a measure of uncertainty.
result The volume of a credal set is a meaningful measure of epistemic uncertainty in binary classification but not in multi-class.

Worst-Case Sensitivity measures model sensitivity to uncertainty set size.

problem Model sensitivity to uncertainty set size in Distributionally Robust Optimization.
method Introducing Worst-Case Sensitivity as a measure of model sensitivity, and deriving closed-form expressions for various uncertainty sets.
result DRO solutions can be sensitive to the family and size of the uncertainty set, and worst-case sensitivity reflects these properties.

ARO overfits by making constraints dependent on uncertainty, leading to brittleness.

problem ARO's adaptive policies become brittle when realizations fall outside the uncertainty set.
method Assigning constraint-specific uncertainty set sizes with probabilistic guarantees.
result Regularization through specific uncertainty set sizes ensures stability and flexibility.

The paper introduces new measures for quantifying uncertainty in machine learning.

problem Uncertainty representation and quantification in machine learning.
method Proper scoring rules for aleatoric and epistemic uncertainty quantification.
result Established a natural bridge between credal set and second-order distribution representations of uncertainty.

The paper extends calibration to sets of probabilistic classifiers, finding many ensembles are poorly calibrated.

problem Evaluating the validity of epistemic uncertainty in sets of probabilistic classifiers.
method Proposed a novel nonparametric calibration test for sets of probabilistic classifiers.
result Ensembles of deep neural networks are often not well calibrated.

This study introduces axioms to assess regression uncertainty measures.

problem Limited formal justification and evaluations of uncertainty measures in regression settings.
method Introduces axioms and analyzes entropy- and variance-based measures in a predictive exponential family context.
result Provides a principled foundation for reliable uncertainty assessment in regression.

SCS identifies a range of plausible equally weighted portfolios, quantifying selection uncertainty.

problem Uncertainty in selecting the best equally weighted portfolio subset.
method Introduces Selection Confidence Set (SCS) for EWPs, covering plausible portfolios with high probability.
result SCS quantifies selection uncertainty and covers the unknown optimal selection with high probability.

CRUDE calibrates regression uncertainty without assuming specific error distributions.

problem Uncalibrated uncertainty estimates in regression models, especially for modern predictive tasks.
method CRUDE assumes error distributions have a constant shape, shifted and scaled by predicted mean and standard deviation.
result CRUDE produces sharper, better calibrated, and more accurate uncertainty estimates than existing methods.

Our goal is to build robust optimization problems for making decisions based on complex data from the past. In robust optimization (RO) generally, the goal is to create a policy for decision-making that is robust to our uncertainty about the future. In particular, we want our policy to best handle the the worst possibl…

2014-07-04abs ↗pdf ↗

Conformal prediction sets improve human decision making by quantifying model uncertainty.

problem Humans signal uncertainty and offer alternatives when unsure, but machine learning models often lack this feature.
method Conducted a randomized controlled trial with human subjects given conformal prediction sets.
result Human accuracy improves when given conformal prediction sets compared to fixed-size prediction sets.

We develop a new framework of uncertainty variables to model uncertainty. An uncertainty variable is characterized by an uncertainty set, in which its realization is bound to lie, while the conditional uncertainty is characterized by a set map, from a given realization of a variable to a set of possible realizations of…

2019-09-24abs ↗pdf ↗

Paper discusses optimal CP for second-order predictions.

problem How to incorporate second-order predictions into conformal prediction.
method Introduces Bernoulli prediction sets (BPS) for second-order predictions and applies conformal risk control for compromised validity.
result BPS provides the smallest prediction sets with conditional coverage.

When the cost of misclassifying a sample is high, it is useful to have an accurate estimate of uncertainty in the prediction for that sample. There are also multiple types of uncertainty which are best estimated in different ways, for example, uncertainty that is intrinsic to the training set may be well-handled by a B…

2018-10-29abs ↗pdf ↗

Proposes a simple method to explain aleatoric uncertainty in neural networks.

problem Lack of transparent explanations for uncertainty estimates in AI models.
method Adapting a neural network with Gaussian output to estimate predictive variance and applying explainers to the variance output.
result The proposed method explains uncertainty more reliably than complex approaches and outperforms them in most settings.

Study benchmarks uncertainty quantification in chest X-ray classification.

problem Reliable uncertainty quantification for medical AI models.
method Evaluation of 13 uncertainty quantification methods on MIMIC-CXR-JPG dataset.
result Insights into effectiveness and disentanglement of epistemic and aleatoric uncertainties.

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.

New method optimises worst-case risk under model uncertainty.

problem Minimizing expected risk under posterior beliefs leads to sub-optimal decisions due to model uncertainty.
method Distributionally Robust Optimisation with Bayesian Ambiguity Sets (DRO-BAS)
result Improved out-of-sample robustness in the Newsvendor problem.

Decision-calibrated prediction sets improve power system operations by reducing unnecessary costs.

problem Balancing operating costs and reliability in power systems with renewable uncertainty.
method Learn conditional prediction sets as sub-level sets of norm-based score functions, calibrate uncertainty sets based on reliability of downstream decisions.
result Decision-calibrated sets lead to more efficient operations with smaller uncertainty sets and lower costs compared to standard coverage-based calibration.

The paper proposes a framework for information-theoretic predictive uncertainty measures.

problem The need for reliable estimation of predictive uncertainty in machine learning.
method Revisiting core concepts, categorizing predictive uncertainty measures based on model and approximation of true distribution.
result Identification of conditions under which certain predictive uncertainty measures excel.

A new framework for measuring uncertainty in machine learning models.

problem Uncertainty measures for second-order distributions in machine learning models have theoretical flaws.
method Formal criteria and a general framework based on the Wasserstein distance.
result The Wasserstein distance-based measure satisfies all proposed criteria for meaningful uncertainty measures.

JUCAL jointly calibrates aleatoric and epistemic uncertainties in classifier ensembles.

problem Misrepresentation of predictive uncertainty due to unbalanced aleatoric and epistemic uncertainties.
method Joint Uncertainty Calibration (JUCAL) that jointly calibrates two constants to weight and scale uncertainties.
result Significantly outperforms state-of-the-art calibration methods across various text classification tasks.

We give explicit solutions for utility maximization of terminal wealth problem u(XT)u(X_T) in the presence of Knightian uncertainty in continuous time [0,T][0,T] in a complete market. We assume there is uncertainty on both drift and volatility of the underlying stocks, which induce nonequivalent measures on canonical space o…

2019-09-11abs ↗pdf ↗

Extends fractional LpL^p uncertainty principles with extremizers and stability results.

problem Investigating uncertainty principles in fractional LpL^p settings.
method Analyzing the fractional Schrödinger equation to find extremal functions and sharp constants.
result Proves stability of extremizers for fractional uncertainty inequalities.

Formulates superhedging under costs and uncertainty for continuous assets.

problem Superhedging with transaction costs and model uncertainty for continuous processes.
method New topological framework for continuous asset prices with parametric model uncertainty.
result Formulates a superhedging theorem in the presence of transaction costs and model uncertainty.

Many real-world regression problems demand a measure of the uncertainty associated with each prediction. Standard decision forests deliver efficient state-of-the-art predictive performance, but high-quality uncertainty estimates are lacking. Gaussian processes (GPs) deliver uncertainty estimates, but scaling GPs to lar…

2015-06-11abs ↗pdf ↗

Extends model uncertainty framework to non-linear affine processes for longevity bonds and contingent claims.

problem Model uncertainty and non-linear affine processes in financial markets.
method Extended reduced-form setting with affine process intensities, introduced longevity bond, and priced contingent claims.
result Consistent valuation of longevity bonds and arbitrage-free market under sublinear operator.

This paper introduces a new method for uncertainty quantification in prediction models.

problem Quantifying uncertainty in high-stakes applications like medicine and finance.
method Confidence sets for outcome excursions, focusing on identifying subsets of features where outcomes exceed a threshold.
result Theoretical guarantees for the probability that confidence sets contain the true feature subset, both asymptotically and for finite sample sizes.

NCP improves deep classifier uncertainty quantification efficiency.

problem Uncertainty quantification for deep classifiers in high-stake applications.
method Neighborhood Conformal Prediction (NCP) algorithm.
result NCP produces smaller prediction sets than traditional CP methods.