Related papers: A Coupling Proof of Convex Ordering for Compound D…
Feature selection can facilitate the learning of mixtures of discrete random variables as they arise, e.g. in crowdsourcing tasks. Intuitively, not all workers are equally reliable but, if the less reliable ones could be eliminated, then…
We study metric projections onto cones in the Wasserstein space of probability measures, defined by stochastic orders. Dualities for backward and forward projections are established under general conditions. Dual optimal solutions and their…
The accurate representation of epistemic uncertainty is a challenging yet essential task in machine learning. A widely used representation corresponds to convex sets of probabilistic predictors, also known as credal sets. One popular way of…
The theory of commutative monads on cartesian closed categories provides a framework where aspects of the theory of distributions and other extensive quantities can be formulated and some results proved. We make explicit a link between our…
It is a well-known fact that an exchangeable sequence has empirical distributions that form a reverse-martingale. This paper is devoted to proof of the converse statement. As a byproduct of the proof for the binary case, we introduce and…
Directionally convex ($dcx$) ordering is a tool for comparison of dependence structure of random vectors that also takes into account the variability of the marginal distributions. When extended to random fields it concerns comparison of…
This paper focuses on generalizing quantiles from the ordering point of view. We propose the concept of partial quantiles, which are based on a given partial order. We establish that partial quantiles are equivariant under order-preserving…
An equivalent condition for the product of elements of an independent random sample on a compact algebraic group converging in distribution to some random variable as the sample size increases is obtained. Namely, a limit distribution…
In this paper we present a random shuffling scheme to apply with adaptive sorting algorithms. Adaptive sorting algorithms utilize the presortedness present in a given sequence. We have probabilistically increased the amount of presortedness…
Distributional regression aims at estimating the conditional distribution of a targetvariable given explanatory co-variates. It is a crucial tool for forecasting whena precise uncertainty quantification is required. A popular methodology…
The exponential ordering is exploited in the context of non-auto\-no\-mous delay systems, inducing monotone skew-product semiflows under less restrictive conditions than usual. Some dynamical concepts linked to the order, such as…
The posterior distribution of the number of components k in a finite mixture satisfies a set of inequality constraints. The result holds irrespective of the parametric form of the mixture components and under assumptions on the prior…
Reconciliation enforces coherence between hierarchical forecasts, in order to satisfy a set of linear constraints. While most works focus on the reconciliation of the point forecasts, we consider probabilistic reconciliation and we analyze…
We consider an extension of the setting of label ranking, in which the learner is allowed to make predictions in the form of partial instead of total orders. Predictions of that kind are interpreted as a partial abstention: If the learner…
We offer a new perspective on risk aggregation with FGM copulas. Along the way, we discover new results and revisit existing ones, providing simpler formulas than one can find in the existing literature. This paper builds on two novel…
We investigate the distribution of the volume and coordination number associated to each particle in a jammed packing of monodisperse hard sphere using the mesoscopic ensemble developed in Nature 453, 606 (2008). Theory predicts an…
The limiting probability distribution is one of the key characteristics of a Markov chain since it shows its long-term behavior. In this paper, for a higher order Markov chain, we establish some properties related to its exact limiting…
Many results in probability (most famously, Strassen's theorem on stochastic domination), characterize some relationship between probability distributions in terms of the existence of a particular structured coupling between them. Optimal…
We study optimization problems in which a linear functional is maximized over probability measures that are dominated by a given measure according to an integral stochastic order in an arbitrary dimension. We show that the following four…
We prove that every finitely generated convex set of finitely supported probability distributions has a unique base, and use this result to show that the monad of convex sets of probability distributions is presented by the algebraic theory…