English
Related papers

Related papers: Quantization for a mixture of uniform distribution…

200 papers

The basic goal of quantization for probability distribution is to reduce the number of values, which is typically uncountable, describing a probability distribution to some finite set and thus approximation of a continuous probability…

Probability · Mathematics 2021-01-27 Mrinal Kanti Roychowdhury

This paper explores the process of optimal quantization for several types of discrete probability distributions. Quantization is a technique used to approximate a complex distribution with a smaller set of representative points, which is…

Probability · Mathematics 2025-07-16 Russel Cabasag , Samir Huq , Eric Mendoza , Mrinal Kanti Roychowdhury

The basic goal of quantization for probability distribution is to reduce the number of values, which is typically uncountable, describing a probability distribution to some finite set and thus to make an approximation of a continuous…

Probability · Mathematics 2022-08-23 Joseph Rosenblatt , Mrinal Kanti Roychowdhury

Quantization for a probability distribution refers to the idea of estimating a given probability by a discrete probability supported by a finite number of points. In this paper, firstly a general approach to this process is outlined using…

Probability · Mathematics 2022-01-26 Joseph Rosenblatt , Mrinal Kanti Roychowdhury

Quantization for probability distributions concerns the best approximation of a $d$-dimensional probability distribution $P$ by a discrete probability with a given number $n$ of supporting points. In this paper, we have considered a…

Dynamical Systems · Mathematics 2022-05-17 Lakshmi Roychowdhury , Mrinal Kanti Roychowdhury

Optimal quantization for mixed distributions has emerged as a compelling area of study. In this work, we have focused on a mixed distribution formed from two uniform distributions with partially overlapping supports. For this class of…

The quantization scheme in probability theory deals with finding a best approximation of a given probability distribution by a probability distribution that is supported on finitely many points. In this paper, first we state and prove a…

Probability · Mathematics 2023-05-05 Juan Gomez , Haily Martinez , Mrinal K. Roychowdhury , Alexis Salazar , Daniel J. Vallez

In this paper, we have studied various mixed distributions generated by two uniform distributions: first, where the supports are two connected line segments, and second, where the supports are two disconnected line segments. For these mixed…

Probability · Mathematics 2025-08-12 Asha Barua , Gustavo Fernandez , Ashley Gomez , Ogla Lopez , Mrinal Kanti Roychowdhury

Quantization for probability distributions refers broadly to estimating a given probability measure by a discrete probability measure supported by a finite number of points. We consider general geometric approaches to quantization using…

Dynamical Systems · Mathematics 2020-02-11 Joseph Rosenblatt , Mrinal Kanti Roychowdhury

Quantization for a probability distribution refers to the idea of estimating a given probability by a discrete probability supported by a finite set. In this article, we consider a probability distribution generated by an infinite system of…

Dynamical Systems · Mathematics 2022-04-26 Dogan Comez , Mrinal Kanti Roychowdhury

The purpose of quantization for a probability distribution is to estimate the probability by a discrete probability with finite support. In this paper, a nonuniform probability measure $P$ on $\mathbb R^2$ which has support the Sierpi\'nski…

Information Theory · Computer Science 2023-06-29 Mrinal Kanti Roychowdhury

The representation of a given quantity with less information is often referred to as `quantization' and it is an important subject in information theory. In this paper, we have considered absolutely continuous probability measures on unit…

Probability · Mathematics 2017-07-10 Mrinal Kanti Roychowdhury

Constrained quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with a finite number of supporting points lying on a specific set. The specific set is known as the…

We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit…

Information Theory · Computer Science 2010-08-24 Yuriy A. Reznik

Quantization for a Borel probability measure refers to the idea of estimating a given probability by a discrete probability with support containing a finite number of elements. If in the quantization some of the elements in the support are…

Probability · Mathematics 2025-03-24 Pigar Biteng , Mathieu Caguiat , Tsianna Dominguez , Mrinal Kanti Roychowdhury

In this paper, first we have defined a uniform distribution on the boundary of a regular hexagon, and then investigated the optimal sets of $n$-means and the $n$th quantization errors for all positive integers $n$. We give an exact formula…

The quantization scheme in probability theory deals with finding a best approximation of a given probability distribution by a probability distribution that is supported on finitely many points. For a given $k\geq 2$, let $\{S_j : 1\leq…

Dynamical Systems · Mathematics 2019-11-22 Mrinal Kanti Roychowdhury

One of the main concepts in quantum physics is a density matrix, which is a symmetric positive definite matrix of trace one. Finite probability distributions are a special case where the density matrix is restricted to be diagonal. Density…

Quantum Physics · Physics 2014-08-14 Manfred K. Warmuth , Dima Kuzmin

A theoretical framework is developed to describe the transformation that distributes probability density functions uniformly over space. In one dimension, the cumulative distribution can be used, but does not generalize to higher…

Neural and Evolutionary Computing · Computer Science 2016-09-08 Eric Kee

Finite precision approximations of discrete probability distributions are considered, applicable for distribution synthesis, e.g., probabilistic shaping. Two algorithms are presented that find the optimal $M$-type approximation $Q$ of a…

Information Theory · Computer Science 2017-05-08 Georg Böcherer , Bernhard C. Geiger
‹ Prev 1 2 3 10 Next ›