Related papers: Generalized Rank Dirichlet Distributions
We propose the supervised hierarchical Dirichlet process (sHDP), a nonparametric generative model for the joint distribution of a group of observations and a response variable directly associated with that whole group. We compare the sHDP…
The Extended Generalized Pareto Distribution (EGPD) (Naveau et al. 2016) is a family of distribution that has been introduced to model the full range of a positive random variable but with the lower and the upper tails distributed according…
When $S=(S_t)_{t\ge 0}$ is an $\alpha$-stable subordinator, the sequence of ordered jumps of $S$, up till time $1$, omitting the $r$ largest of them, and taken as proportions of their sum $^{(r)}S_t$, defines a 2-parameter distribution on…
In most domains of network analysis researchers consider networks that arise in nature with weighted edges. Such networks are routinely dichotomized in the interest of using available methods for statistical inference with networks. The…
We introduce a novel generative model for the representation of joint probability distributions of a possibly large number of discrete random variables. The approach uses measure transport by randomized assignment flows on the statistical…
This Master's thesis examines the properties of large degree vertices in random recursive directed acyclic graphs (RRDAGs), a generalization of the well-studied random recursive tree (RRT) model. Using a novel adaptation of Kingman's…
A regularized version of Mixture Models is proposed to learn a principal graph from a distribution of $D$-dimensional data points. In the particular case of manifold learning for ridge detection, we assume that the underlying manifold can…
Generalized linear model with $L_1$ and $L_2$ regularization is a widely used technique for solving classification, class probability estimation and regression problems. With the numbers of both features and examples growing rapidly in the…
A Dirichlet-kernel Gasser-M\"uller (D-GM) estimator is introduced for fixed design regression on the simplex, extending the univariate analog due to Chen [Statist. Sinica, vol. 10(1) (2000), pp. 73-91]. Its pointwise bias and variance,…
We study various classes of random processes defined on the regular tree $T_d$ that are invariant under the automorphism group of $T_d$. Most important ones are factor of i.i.d. processes (randomized local algorithms), branching Markov…
Ranked set sampling (RSS) is a stratified sampling method that improves efficiency over simple random sampling (SRS) by utilizing auxiliary information for ranking and stratification. While balanced RSS (BRSS) assumes equal allocation…
We compute analytically the probability distribution and moments of the sum and product of the non-zero eigenvalues and singular values of random matrices with (i) non-negative entries, (ii) fixed rank, and (iii) prescribed sums of the…
This paper focuses on generalization performance analysis for distributed algorithms in the framework of learning theory. Taking distributed kernel ridge regression (DKRR) for example, we succeed in deriving its optimal learning rates in…
Density power divergence (DPD) is designed to robustly estimate the underlying distribution of observations, in the presence of outliers. However, DPD involves an integral of the power of the parametric density models to be estimated; the…
We consider an array of random variables, taking values in a complete and separable metric space, that exhibits a kind of symmetry which we call row exchangeability. Given such an array, a natural model for Bayesian nonparametric inference…
The probability distribution of the magnitude can be modeled by an exponential distribution according to the Gutenberg-Richter relation. Two alternatives are the truncated exponential distribution (TED) and the cut-off exponential…
There are several ways to measure the compressibility of a random measure; they include general approaches such as using the rate-distortion curve, as well as more specific notions, such as the Renyi information dimension (RID). The RID…
In the realm of big data and machine learning, data-parallel, distributed stochastic algorithms have drawn significant attention in the present days.~While the synchronous versions of these algorithms are well understood in terms of their…
We consider a random model for directed graphs whereby an arc is placed from one vertex to another with a prescribed probability which may vary from arc to arc. Using perturbation bounds as well as Chernoff inequalities, we show that the…
The large time, small mass, asymptotic behavior of the average mass distribution $\pb$ is studied in a $d$-dimensional system of diffusing aggregating particles for $1\leq d \leq 2$. By means of both a renormalization group computation as…