Related papers: Generalized Rank Dirichlet Distributions
We consider distributed learning using constant stepsize SGD (DSGD) over several devices, each sending a final model update to a central server. In a final step, the local estimates are aggregated. We prove in the setting of…
We consider (annealed) large deviation principles for component empirical measures of several families of marked sparse random graphs, including (i) uniform graphs on $n$ vertices with a fixed degree distribution; (ii) uniform graphs on $n$…
A new family of distribution is proposed by using Kumaraswamy-G (Cordeiro and de Castro, 2011) distribution as the base line distribution in the Generalized Marshal-Olkin (Jayakumar and Mathew, 2008) Construction. A number of special cases…
Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…
We study the convergence of a variant of distributed gradient descent (DGD) on a distributed low-rank matrix approximation problem wherein some optimization variables are used for consensus (as in classical DGD) and some optimization…
In this article we propose and validate an unsupervised probabilistic model, Gaussian Latent Dirichlet Allocation (GLDA), for the problem of discrete state discovery from repeated, multivariate psychophysiological samples collected from…
An interesting line of research is the investigation of the laws of random variables known as Dirichlet means. However, there is not much information on interrelationships between different Dirichlet means. Here, we introduce two…
Probabilistic finite mixture models are widely used for unsupervised clustering. These models can often be improved by adapting them to the topology of the data. For instance, in order to classify spatially adjacent data points similarly,…
Randomized rankings have been of recent interest to achieve ex-ante fairer exposure and better robustness than deterministic rankings. We propose a set of natural axioms for randomized group-fair rankings and prove that there exists a…
The adoption of continuous shrinkage priors in high-dimensional linear models has gained widespread attention due to their practical and theoretical advantages. Among them, the R2D2 prior has gained popularity for its intuitive…
This paper proposes a unified class of generalized location-scale mixture of multivariate elliptical distributions and studies integral stochastic orderings of random vectors following such distributions. Given a random vector…
We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a random vertex-weight representing initial inhomogeneities in the…
This article presents a new class of generalized transmuted lifetime distributions which includes a large number of lifetime distributions as sub-family. Several important mathematical quantities such as density function, distribution…
We build a sharp approximation of the whole distribution of the sum of iid heavy-tailed random vectors, combining mean and extreme behaviors. It extends the so-called 'normex' approach from a univariate to a multivariate framework. We…
Distributional reinforcement learning (DRL) has achieved empirical success in various domains. One core task in DRL is distributional policy evaluation, which involves estimating the return distribution $\eta^\pi$ for a given policy $\pi$.…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
In the present paper new insights into the study of the Non-central Dirichlet distribution are provided. This latter is the analogue of the Dirichlet distribution obtained by replacing the Chi-Squared random variables involved in its…
This paper studies the distribution of a family of rankings, which includes Google's PageRank, on a directed configuration model. In particular, it is shown that the distribution of the rank of a randomly chosen node in the graph converges…
We prove that for each $k\ge0$, the probability that a root vertex in a random planar graph has degree $k$ tends to a computable constant $d_k$, so that the expected number of vertices of degree $k$ is asymptotically $d_k n$, and moreover…
In this article, we propose two classes of relative information measures based on extropy, viz., the generalized extropy similarity ratio (GESR) and generalized extropy divergence ratio (GEDR), that measure the similarity and discrepancy…