Related papers: Constrained quantization for probability distribut…
Let $P$ be a Borel probability measure on $\mathbb R^2$ supported by the Cantor dusts generated by a set of $4^u,\ u\geq 1$, contractive similarity mappings satisfying the strong separation condition. For this probability measure, we…
Let $\nu$ be a Borel probability measure on a $d$-dimensional Euclidean space $\mathbb{R}^d$, $d\geq 1$, with a compact support, and let $(p_0, p_1, p_2, \ldots, p_N)$ be a probability vector with $p_j>0$ for $0\leq j\leq N$. Let $\{S_j:…
We propose a kernel-based nonparametric framework for mean-variance optimization that enables inference on economically motivated shape constraints in finance, including positivity, monotonicity, and convexity. Many central hypotheses in…
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…
Contextuality is usually defined as absence of a joint distribution for a set of measurements (random variables) with known joint distributions of some of its subsets. However, if these subsets of measurements are not disjoint,…
Quantum Clustering is a powerful method to detect clusters in data with mixed density. However, it is very sensitive to a length parameter that is inherent to the Schr\"odinger equation. In addition, linking data points into clusters…
Our aim is to make a step towards clarification of foundations for the notion of entanglement (both physical and mathematical) by representing it in the conditional probability framework. In Schr\"odinger's words, this is entanglement of…
Predicting the outcomes of quantum measurements is a cornerstone of quantum information theory and a key resource for quantum technologies. Here, we introduce a comprehensive framework for quantifying the predictability of measurements on a…
We investigate quantization coefficients for self-similar probability measures \mu on limit sets which are generated by systems S of infinitely many contractive similarities and by probabilistic vectors. The theory of quantization…
Randomized (dithered) quantization is a method capable of achieving white reconstruction error independent of the source. Dithered quantizers have traditionally been considered within their natural setting of uniform quantization. In this…
We prove an analogue of the portmanteau theorem on weak convergence of probability measures allowing measures which are unbounded on an underlying metric space but finite on the complement of any Borel neighbourhood of a fixed element.
Estimation of parameters that obey specific constraints is crucial in statistics and machine learning; for example, when parameters are required to satisfy boundedness, monotonicity, or linear inequalities. Traditional approaches impose…
We introduce the concept of boundariness capturing the most efficient way of expressing a given element of a convex set as a probability mixture of its boundary elements. In other words, this number measures (without the need of any…
Quantum coherence characterizes the non-classical feature of a single party system with respect to a local basis. Based on a recently introduced resource framework, coherence can be regarded as a resource and be systematically manipulated…
We introduce and study the unconstrained polarization (or Chebyshev) problem which requires to find an $N$-point configuration that maximizes the minimum value of its potential over a set $A$ in $p$-dimensional Euclidean space. This problem…
Let $\{S_j : 1\leq j\leq 3\}$ be a set of three contractive similarity mappings such that $S_j(x)=rx+\frac {j-1}{2}(1-r)$ for all $x\in \mathbb R$, and $1\leq j\leq 3$, where $0<r<\frac 1 3$. Let $P=\sum_{j=1}^3 \frac 13 P\circ S_j^{-1}$.…
For a given $r\in (0, +\infty)$, the quantization dimension of order $r$, if it exists, denoted by $D_r(\mu)$, of a Borel probability measure $\mu$ on ${\mathbb R}^d$ represents the speed how fast the $n$th quantization error of order $r$…
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…
We introduce a novel framework for implementing error-correction in constrained systems. The main idea of our scheme, called Quantized-Constraint Concatenation (QCC), is to employ a process of embedding the codewords of an error-correcting…
Constraints can be interpreted in a broad sense as any kind of explicit restriction over the parameters. While some constraints are defined directly on the parameter space, when they are instead defined by known behaviour on the model,…