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

3978116155 · May 202619922001200920172026
48 results for distribution-free uncertainty

The paper tackles uncertainty quantification for classification under label shift without assuming i.i.d. data.

problem Uncertainty quantification for classification under label shift in non-i.i.d. settings.
method The paper uses conformal prediction and post-hoc binning for distribution-free UQ, and reweights these methods for label shift.
result The reweighted methods improve UQ performance under label shift, preserving coverage and calibration.

Study three types of uncertainty quantification for binary classification without distributional assumptions.

problem Uncertainty quantification for binary classification in a distribution-free setting.
method Established theorems connecting calibration, confidence intervals, and prediction sets for score-based classifiers.
result Distribution-free calibration is only possible using scoring functions that partition feature space into countably many sets.

Conformal prediction provides distribution-free uncertainty quantification for black-box models.

problem Uncertainty quantification for high-risk machine learning applications.
method Conformal prediction creates valid uncertainty sets without distributional assumptions.
result Sets contain the ground truth with a specified probability, e.g., 90%.

This work presents the concept of kernel mean embedding and kernel probabilistic programming in the context of stochastic systems. We propose formulations to represent, compare, and propagate uncertainties for fairly general stochastic dynamics in a distribution-free manner. The new tools enjoy sound theory rooted in f…

2019-11-25abs ↗pdf ↗

The paper proposes a method for distribution-free prediction sets that adapt to unknown temporal changes.

problem Distribution-free prediction sets require reliable calibration data, which is often unavailable in real-world settings with temporal changes.
method The method selects an adaptive window to construct prediction sets, optimizing a bias-variance tradeoff.
result The method provides sharp coverage guarantees and is shown to be adaptive to temporal drift through numerical experiments.

Mack's estimator improves chain ladder prediction for large exposure insurance models.

problem Uncertainty quantification in compound Poisson loss models.
method Large exposure asymptotics applied to Mack's estimator.
result Chain ladder prediction uncertainty can be quantified without model assumptions.

EPICSCORE improves conformal scores by explicitly accounting for epistemic uncertainty.

problem Overconfident predictions in data-sparse regions due to lack of epistemic uncertainty.
method Model-agnostic approach using Bayesian techniques like Gaussian Processes, Dropout, and Regression Trees.
result Enhanced predictive intervals that adaptively expand in sparse data regions and maintain compact intervals in abundant data.

CREDO assesses decision optimality under uncertainty without assuming a model.

problem Uncertainty in decision-making without reliable quantification of optimality.
method CREDO uses the inverse feasible region and conformal prediction balls to estimate decision optimality probability.
result CREDO provides accurate, efficient, and reliable evaluations of decision optimality.

Unified framework for reliable uncertainty quantification in RL.

problem Uncertainty quantification in high-stakes reinforcement learning.
method Unified conformal prediction framework integrating distributional RL and conformal calibration.
result Significantly improved coverage and reliability over standard methods.

The paper explores how over-parameterized linear regression models generalize without violating learning theory principles.

problem Understanding how over-parameterized linear regression models generalize without violating learning theory principles.
method The paper uses the predictive normalized maximum likelihood (pNML) learner to investigate the minimum norm solution of over-parameterized linear regression models.
result The model generalizes well when the test sample lies in a subspace spanned by eigenvectors associated with large eigenvalues of the training data.

CMCO provides robust uncertainty estimates for neural operators without retraining.

problem Uncertainty quantification in deep learning for real-time virtual sensing.
method Unified Monte Carlo dropout and split conformal prediction in DeepONet.
result Near-nominal empirical coverage in diverse applications.

Study on continuous sequence classification with distribution uncertainty.

problem Classifying continuous sequences with varying distribution uncertainty.
method Proposes distribution-free tests for three test designs: fixed-length, sequential, and two-phase tests.
result Error probabilities decay exponentially fast for all test designs.

The paper offers a method to create prediction sets with uncertainty control.

problem Calibrating and communicating uncertainty in machine learning predictions.
method Distribution-free, risk-controlling prediction sets using a holdout set to calibrate set sizes.
result Explicit finite-sample guarantees for error control in various machine learning tasks.

New methods for quantifying insurance claim cost uncertainty using LightGBM and GLMs.

problem Quantifying prediction uncertainty in insurance claim costs.
method Proposed non-conformity measures for GLMs and GBMs with Tweedie loss.
result Locally weighted Pearson residuals outperform other methods in maintaining nominal coverage with smallest average width.

ERAPS builds prediction sets for time-series data.

problem Uncertainty quantification in complex machine learning methods for time-series data.
method ERAPS is an ensemble-based framework for constructing prediction sets for time-series data, allowing unknown dependencies within features and responses.
result ERAPS demonstrates valid marginal and conditional coverage and yields smaller prediction sets than competing methods.

JAWS audits predictive uncertainty under covariate shift using jackknife+ weighted methods.

problem Auditing predictive uncertainty under data distribution shifts.
method JAW and JAWA methods for distribution-free uncertainty quantification.
result JAW relaxes the jackknife+'s assumption of data exchangeability for covariate shift.

COAD maximizes online auction revenue by quantifying uncertainty without known distributions.

problem Designing incentive-compatible mechanisms for online auctions with unknown bidder values and uncertain future participants.
method COAD uses distribution-free uncertainty quantification techniques and integrates machine learning methods to predict bidder values while ensuring revenue guarantees.
result COAD maximizes revenue in online auctions through bidder-specific reserve prices based on lower confidence bounds of valuations.

Paper develops a neural network method for censored survival analysis.

problem Distribution-free quantile prediction for censored survival data.
method Develops a novel neural network algorithm for simultaneous quantile optimization.
result The algorithm produces better calibrated quantiles on real datasets.

CREDO combines credal and conformal methods to create interpretable prediction intervals.

problem Overconfident prediction intervals in regions of model extrapolation.
method CREDO uses a credal envelope to widen intervals in weak evidence regions and then applies conformal calibration.
result CREDO prediction intervals are interpretable and maintain target coverage.

New federated conformal prediction method addresses label shift for uncertainty quantification.

problem Label shift in federated learning and its impact on uncertainty quantification.
method Quantile regression-based federated conformal prediction method with privacy constraints.
result Method provides valid coverage of prediction sets and differential privacy guarantees.

This dissertation analyzes conformal prediction methods for accurate uncertainty quantification in machine learning.

problem The importance of uncertainty in machine learning applications is often overlooked.
method A distribution-free framework called conformal prediction is studied and analyzed.
result Conformal prediction is the only framework that does not require strong assumptions about the data.

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.

Research in reinforcement learning has produced algorithms for optimal decision making under uncertainty that fall within two main types. The first employs a Bayesian framework, where optimality improves with increased computational time. This is because the resulting planning task takes the form of a dynamic programmi…

2009-02-02abs ↗pdf ↗

DistPred provides a fast, distribution-free method for regression and forecasting.

problem Deterministic point estimates in regression and prediction tasks.
method Transforming proper scoring rules into a differentiable form and using it as a loss function.
result Achieved state-of-the-art performance and significantly improved computational efficiency.

The ACCRU framework improves probabilistic forecasts by capturing input-dependent uncertainty.

problem Uncertainty in deterministic predictions, especially for skewed and non-Gaussian errors.
method Neural network trained with a loss function balancing accuracy and reliability to learn input-dependent, non-Gaussian uncertainty distributions.
result Improves probabilistic forecasts relative to existing methods, capturing skewed and non-Gaussian errors.

Hybrid Bayesian-conformal framework improves uncertainty quantification in healthcare predictions.

problem Jointly satisfying distribution-free coverage guarantees and risk-adaptive precision in clinical decision-making.
method Integrates Bayesian hierarchical random forests with group-aware conformal calibration, using posterior uncertainties to weight conformity scores.
result Achieves target coverage (94.3% vs 95% target) with adaptive precision, 21% narrower intervals for low-uncertainty cases.

MAPS algorithm creates reliable prediction intervals for high-dimensional data.

problem Computing reliable conditional prediction intervals in high-dimensional settings.
method Lifted predictive model (LPM) and MAPS algorithm for distribution-free intervals.
result MAPS algorithm produces valid prediction intervals for any trained model.

Proposes CPO framework for robust decision-making with explainable uncertainty regions.

problem Overly conservative uncertainty regions in data-driven optimization lead to suboptimal decisions.
method Conformal-Predict-Then-Optimize (CPO) framework using conditional generative models and visual summaries.
result Demonstrates improved robustness and explainability in decision-making.

The paper tackles distribution-free prediction intervals for multi-source data.

problem Challenges in achieving valid inferences due to distribution shifts and privacy concerns.
method Derives efficient influence functions, incorporates machine learning, and proposes data-adaptive strategies.
result Achieves parametric rates of convergence to nominal coverage probabilities for prediction intervals.

Paper proposes a new framework for combining investment strategies without market-specific assumptions.

problem Lack of a distribution-free and consistent preference framework for decision-making in combining investment strategies.
method Introduces a novel framework for decision-making in combining strategies, free from market conditions and statistical assumptions.
result Proposed strategies outperform individual component strategies in long-term wealth accumulation, with small tradeoffs in Sharpe ratios.

Validates network bootstraps for uncertainty quantification in network visualisation.

problem Quantifying uncertainty in network embeddings when only a single observation is available.
method Statistical indistinguishable embeddings using k-nearest neighbour smoothing, validated by an exchangeable network test.
result Proposes a principled, distribution-free network bootstrap that passes the exchangeable network test.

Paper proposes a risk-averse approach to energy storage price arbitrage using conformal uncertainty quantification.

problem Inherent volatility and uncertainty of real-time electricity prices create financial risks for storage arbitrage.
method Two-layer prediction model with conformal uncertainty quantification for high coverage of real-time price uncertainty.
result The framework achieves good profit margins with minimal losses, demonstrating effectiveness in real-time market.

Framework controls uncertainty in LLMs without labels or probabilities.

problem Managing uncertainty in black-box LLMs without token-level probability or true labels.
method Integrates generative models, UCP, and conformal alignment to control uncertainty.
result Achieves close-to-nominal coverage and tighter thresholds than split UCP.

This study uses ICL to efficiently generate robust confidence intervals for noisy regression tasks.

problem Uncertainty quantification for in-context learning in noisy regression tasks.
method Proposes a method based on conformal prediction to construct prediction intervals with guaranteed coverage.
result Conformal prediction with in-context learning (CP with ICL) achieves robust and scalable uncertainty estimates.

Develops statistical guarantees for image-to-image regression models.

problem Current image-to-image regression models lack statistical guarantees for model mistakes and hallucinations.
method Uncertainty quantification techniques with rigorous statistical guarantees for image-to-image regression problems.
result Derives uncertainty intervals around each pixel with formal mathematical guarantees.

tsbootstrap handles time series uncertainty without assuming independence.

problem Time series data violate IID assumptions, leading to undercoverage in traditional methods.
method Provides various resampling and bootstrap methods, including classical and adaptive conformal calibration.
result Dependence-aware methods reduce coverage deficits, with sieve resampling performing best.