English
Related papers

Related papers: The P-Box CDF-Intervals: Reliable Constraint Reaso…

200 papers

This research introduces a new constraint domain for reasoning about data with uncertainty. It extends convex modeling with the notion of p-box to gain additional quantifiable information on the data whereabouts. Unlike existing approaches,…

Logic in Computer Science · Computer Science 2014-05-19 Aya Saad

A pair of lower and upper cumulative distribution functions, also called probability box or p-box, is among the most popular models used in imprecise probability theory. They arise naturally in expert elicitation, for instance in cases…

Probability · Mathematics 2018-08-10 Matthias C. M. Troffaes , Sebastien Destercke

Decisions about health interventions are often made using limited evidence. Mathematical models used to inform such decisions often include uncertainty analysis to account for the effect of uncertainty in the current evidence base on…

Applications · Statistics 2021-11-30 Rowan Iskandar

Probability boxes, also known as $p$-boxes, correspond to sets of probability distributions bounded by a pair of distribution functions. They fall into the class of models known as imprecise probabilities. One of the central questions…

Probability · Mathematics 2025-10-28 Damjan Škulj

In modern engineering, physical processes are modelled and analysed using advanced computer simulations, such as finite element models. Furthermore, concepts of reliability analysis and robust design are becoming popular, hence, making…

Methodology · Statistics 2017-03-20 Roland Schöbi , Bruno Sudret

Given an imprecise probabilistic model over a continuous space, computing lower/upper expectations is often computationally hard to achieve, even in simple cases. Because expectations are essential in decision making and risk analysis,…

Probability · Mathematics 2009-06-09 L. Utkin , S. Destercke

Simulation-based inference methods that feature correct conditional coverage of confidence sets based on observations that have been compressed to a scalar test statistic require accurate modeling of either the p-value function or the…

Machine Learning · Statistics 2025-08-18 Ali Al Kadhim , Harrison B. Prosper

There exist several simple representations of uncertainty that are easier to handle than more general ones. Among them are random sets, possibility distributions, probability intervals, and more recently Ferson's p-boxes and Neumaier's…

Probability · Mathematics 2008-08-21 Sebastien Destercke , Didier Dubois , Eric Chojnacki

Estimation of the complete distribution of a random variable is a useful primitive for both manual and automated decision making. This problem has received extensive attention in the i.i.d. setting, but the arbitrary data dependent setting…

Machine Learning · Statistics 2023-03-01 Paul Mineiro , Steven R. Howard

The mid-p-value is a proposed improvement on the ordinary p-value for the case where the test statistic is partially or completely discrete. In this case, the ordinary p-value is conservative, meaning that its null distribution is larger…

Statistics Theory · Mathematics 2017-06-02 Patrick Rubin-Delanchy , Nicholas A. Heard , Daniel John Lawson

In the context of treatment effect estimation, this paper proposes a new methodology to recover the counterfactual distribution when there is a single (or a few) treated unit and possibly a high-dimensional number of potential controls…

Econometrics · Economics 2023-09-08 Ricardo Masini

Reliable uncertainty quantification is crucial for reinforcement learning (RL) in high-stakes settings. We propose a unified conformal prediction framework for infinite-horizon policy evaluation that constructs distribution-free prediction…

Machine Learning · Statistics 2025-10-31 Feichen Gan , Youcun Lu , Yingying Zhang , Yukun Liu

The increasing deployment of machine learning as well as legal regulations such as EU's GDPR cause a need for user-friendly explanations of decisions proposed by machine learning models. Counterfactual explanations are considered as one of…

Machine Learning · Computer Science 2020-08-04 André Artelt , Barbara Hammer

Uncertainty quantification is essential in decision-making, especially when joint distributions of random variables are involved. While conformal prediction provides distribution-free prediction sets with valid coverage guarantees, it…

Machine Learning · Computer Science 2025-01-03 Rui Luo , Zhixin Zhou

Counterfactual explanations for black-box models aim to pr ovide insight into an algorithmic decision to its recipient. For a binary classification problem an individual counterfactual details which features might be changed for the model…

Machine Learning · Statistics 2025-05-29 James M. Adams , Gesine Reinert , Lukasz Szpruch , Carsten Maple , Andrew Elliott

Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…

Artificial Intelligence · Computer Science 2018-07-02 Brendan Juba

There exist many simple tools for jointly capturing variability and incomplete information by means of uncertainty representations. Among them are random sets, possibility distributions, probability intervals, and the more recent Ferson's…

Probability · Mathematics 2008-08-21 Sebastien Destercke , Didier Dubois , Eric Chojnacki

Data following an interval structure are increasingly prevalent in many scientific applications. In medicine, clinical events are often monitored between two clinical visits, making the exact time of the event unknown and generating…

Methodology · Statistics 2025-04-01 Carlos García Meixide , Michael R. Kosorok , Marcos Matabuena

We introduce a fine-grained framework for uncertainty quantification of predictive models under distributional shifts. This framework distinguishes the shift in covariate distributions from that in the conditional relationship between the…

Methodology · Statistics 2025-05-20 Jiahao Ai , Zhimei Ren

We derive information-theoretic converses (i.e., lower bounds) for the minimum time required by any algorithm for distributed function computation over a network of point-to-point channels with finite capacity, where each node of the…

Information Theory · Computer Science 2017-01-04 Aolin Xu , Maxim Raginsky
‹ Prev 1 2 3 10 Next ›