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,657 papers · 148 categories

Trend · papers per month

200399599798 · Jun 202019922001200920172026
48 results for Credible sets

Paper introduces exact credible sets for classification problems.

problem No general way to construct exact credible sets for classification.
method Generalized credible set with connection to Neyman--Pearson lemma and randomized decision rule.
result Achieves any preassigned credible level for classification problems.

CP4SBI improves the calibration of credible sets in SBI models.

problem Inaccurate credible sets in SBI models lead to underestimation of true parameters.
method Develops a local conformal calibration framework for SBI models.
result Improves the quality of uncertainty quantification for neural posterior estimators.

In many settings, it is important that a model be capable of providing reasons for its predictions (i.e., the model must be interpretable). However, the model's reasoning may not conform with well-established knowledge. In such cases, while interpretable, the model lacks \textit{credibility}. In this work, we formally …

2017-11-08abs ↗pdf ↗

Develops a new method for sampling from Bayesian credible sets using deep generative quantile learning.

problem Sampling from posterior distributions in high-dimensional spaces with intractable likelihoods.
method Uses deep neural networks to implicitly sample from Bayesian credible sets via a push-forward mapping and Monge-Kantorovich depth.
result Demonstrates improved performance and theoretical consistency of the quantile learning framework.

The paper analyzes uncertainty quantification in sparse Gaussian process regression with a Brownian motion prior.

problem Analyzing uncertainty in sparse Gaussian process regression with a Brownian motion prior.
method Theoretical guarantees and limitations for pointwise credible sets are derived for a rescaled Brownian motion prior with a sparse variational Gaussian process method.
result Theoretical characterization of asymptotic frequentist coverage for credible sets, distinguishing conservative and overconfident cases.

Recent explainability related studies have shown that state-of-the-art DNNs do not always adopt correct evidences to make decisions. It not only hampers their generalization but also makes them less likely to be trusted by end-users. In pursuit of developing more credible DNNs, in this paper we propose CREX, which enco…

2019-08-13abs ↗pdf ↗

The paper proposes a method to assess survey data credibility without needing many samples, regardless of data dimension.

problem Assessing the credibility of survey data across different dimensions.
method Task-based approach and model-specific distance metric for verifying survey data credibility in regression models.
result The sample complexity of the proposed algorithm is independent of the data dimension, making it more efficient.

Generative sampler learns velocity fields for efficient posterior inference.

problem Sampling from complex posterior distributions in high dimensions.
method Generative multivariate posterior sampler via flow matching, learning a velocity field for a deterministic transport map.
result Conditional Brenier map enables fast generation of credible sets with theoretical consistency guarantees.

Credibility theory provides tools to obtain better estimates by combining individual data with sample information. We apply the Credibility theory to a Uniform distribution that is used in testing the reliability of forecasting an interest rate for long term horizons. Such empirical exercise is asked by Regulators (CRR…

2014-09-17abs ↗pdf ↗

New method uses fractional posteriors for semiparametric inference with improved uncertainty quantification.

problem Semiparametric inference with nonparametric priors and fractional posteriors.
method Established a general Bernstein--von Mises theorem for fractional posterior distributions, proposed shifted-and-rescaled credible sets.
result Fractional posterior credible sets provide reliable uncertainty quantification but have inflated size; shifted-and-rescaled set is an efficient confidence set.

New auction design uses statistical learning to reduce costs and improve fairness.

problem Designing efficient multi-item auctions with reduced implementation costs and fairness.
method Nonparametric density estimation for credible intervals, two new strategies.
result Strategies consistently outperform alternative methods in revenue maximization and cost reduction.

The paper proposes a fair and private decentralized deep learning framework.

problem Ensuring fairness and privacy in collaborative deep learning.
method A reputation system and differential privacy are used. FDPDDL framework is built with two stages: initialisation and update.
result FDPDDL achieves high fairness, comparable accuracy to centralised and distributed frameworks, and better accuracy than standalone.

EENNs improve inference efficiency but need nested prediction sets for reliable uncertainty estimates.

problem Non-nested prediction sets from standard uncertainty quantification methods in EENNs.
method Introduced anytime-valid confidence sequences (AVCSs) tailored for EENNs.
result AVCSs generate nested prediction sets across EENN exits, addressing the issue of non-nested sets.

The paper tests the credibility of public and private surveys using linear regression and differential privacy.

problem Ensuring the validity of data analysis results from sample surveys using linear regression.
method Designing an algorithm to test the credibility of surveys and extending it to handle LDP.
result The algorithm achieves optimal estimation error bound for 1\ell_1 linear regression and reduces sample complexity.

Online health communities are a valuable source of information for patients and physicians. However, such user-generated resources are often plagued by inaccuracies and misinformation. In this work we propose a method for automatically establishing the credibility of user-generated medical statements and the trustworth…

2017-05-06abs ↗pdf ↗

BIGUE algorithm provides credible intervals for hyperbolic network embeddings.

problem Uncertainty in hyperbolic network embeddings.
method Markov chain Monte Carlo (MCMC) algorithm for Bayesian hyperbolic random graph model.
result Samples from the posterior distribution provide credible intervals for hyperbolic coordinates and network properties.

This paper approaches the definition and properties of dynamic convex risk measures through the notion of a family of concave valuation operators satisfying certain simple and credible axioms. Exploring these in the simplest context of a finite time set and finite sample space, we find natural risk-transfer and time-co…

2007-09-03abs ↗pdf ↗

Bayesian inference engines improve density estimation accuracy and scalability.

problem Constructing accurate and scalable probability density functions.
method Bayesian inference engines (no-U-turn sampling and expectation propagation) with binning strategy.
result Density estimates have excellent comparative performance and scale well to large sample sizes.

The intention of this paper is to estimate a Bayesian distribution-free chain ladder (DFCL) model using approximate Bayesian computation (ABC) methodology. We demonstrate how to estimate quantities of interest in claims reserving and compare the estimates to those obtained from classical and credibility approaches. In …

2010-04-15abs ↗pdf ↗

Adapts Gaussian process surrogate evaluation with conformal prediction for better coverage guarantees.

problem Uncertainty quantification and model specification issues in Gaussian process surrogate models.
method Adaptive cross-conformal prediction intervals using posterior standard deviation weighting.
result Conformal prediction intervals provide significant correlation with surrogate model error and frequentist coverage guarantees.

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.

Walley's Imprecise Dirichlet Model (IDM) for categorical i.i.d. data extends the classical Dirichlet model to a set of priors. It overcomes several fundamental problems which other approaches to uncertainty suffer from. Yet, to be useful in practice, one needs efficient ways for computing the imprecise=robust sets or i…

2009-01-26abs ↗pdf ↗

It is important to collect credible training samples (x,y)(x,y) for building data-intensive learning systems (e.g., a deep learning system). Asking people to report complex distribution p(x)p(x), though theoretically viable, is challenging in practice. This is primarily due to the cognitive loads required for human agents t…

2019-10-08abs ↗pdf ↗

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.

Ubiquitous systems with End-Edge-Cloud architecture are increasingly being used in healthcare applications. Federated Learning (FL) is highly useful for such applications, due to silo effect and privacy preserving. Existing FL approaches generally do not account for disparities in the quality of local data labels. Howe…

2020-01-29abs ↗pdf ↗

No policy can simultaneously be fully autonomous, optimally calibrated, and helpful, proving a trilemma.

problem Proving impossibility of a policy achieving maximum helpfulness, optimal calibration, and full autonomy.
method Geometric proof showing that adding any non-affine autonomy incentive to a strictly proper scoring rule destroys strict properness.
result The Behavioral Credibility Trilemma: no policy can achieve all three goals simultaneously.

Methods for reasoning under uncertainty are a key building block of accurate and reliable machine learning systems. Bayesian methods provide a general framework to quantify uncertainty. However, because of model misspecification and the use of approximate inference, Bayesian uncertainty estimates are often inaccurate -…

2018-07-01abs ↗pdf ↗

This work develops rigorous theoretical basis for the fact that deep Bayesian neural network (BNN) is an effective tool for high-dimensional variable selection with rigorous uncertainty quantification. We develop new Bayesian non-parametric theorems to show that a properly configured deep BNN (1) learns the variable im…

2019-12-03abs ↗pdf ↗