相关论文: Optimal quantization for the Cantor distribution g…

We prove that if $V=L$ then there is a $\Pi^1_1$ maximal orthogonal (i.e. mutually singular) set of measures on Cantor space. This provides a natural counterpoint to the well-known Theorem of Preiss and Rataj that no analytic set of…

We prove effective equidistribution of expanding horocycles in $\mathrm{SL}_2(\mathbb{Z})\backslash\mathrm{SL}_2(\mathbb{R})$ with respect to various classes of Borel probability measures on $\mathbb{R}$ having certain Fourier asymptotics.…

Using the Kaczmarz algorithm, we prove that for any singular Borel probability measure $\mu$ on $[0,1)$, every $f\in L^2(\mu)$ possesses a Fourier series of the form $f(x)=\sum_{n=0}^{\infty}c_ne^{2\pi inx}$. We show that the coefficients…

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…

In this article, we study the approximation of a probability measure $\mu$ on $\mathbb{R}^{d}$ by its empirical measure $\hat{\mu}_{N}$ interpreted as a random quantization. As error criterion we consider an averaged $p$-th moment…

Many modern distributed real-time signal sensing/monitoring systems require quantization for efficient signal representation. These distributed sensors often have inherent computational and energy limitations. Motivated by this concern, we…

A general theory of resource-bounded measurability and measure is developed. Starting from any feasible probability measure $\nu$ on the Cantor space $\C$ and any suitable complexity class $C \subseteq \C$, the theory identifies the subsets…

We study the discrimination of N mixed quantum states in an optimal measurement that maximizes the probability of correct results while the probability of inconclusive results is fixed at a given value. After considering the discrimination…

For any $\alpha\in(0,d)$, we construct Cantor sets in $\mathbb{R}^d$ of Hausdorff dimension $\alpha$ such that the associated natural measure $\mu$ obeys the restriction estimate $\| \widehat{f d\mu} \|_{p} \leq C_p \| f \|_{L^2(\mu)}$ for…

Given $\rho\in(0, 1/3]$, let $\mu$ be the Cantor measure satisfying $\mu=\frac{1}{2}\mu f_0^{-1}+\frac{1}{2}\mu f_1^{-1}$, where $f_i(x)=\rho x+i(1-\rho)$ for $i=0, 1$. The support of $\mu$ is a Cantor set $C$ generated by the iterated…

The impact of measurement imperfections on quantum metrology protocols has not been approached in a systematic manner so far. In this work, we tackle this issue by generalising firstly the notion of quantum Fisher information to account for…

Correlation self-testing of quantum theory involves identifying a task or set of tasks whose optimal performance can be achieved only by theories that can realise the same set of correlations as quantum theory in every causal structure.…

It is known that the class $\mathcal{U}_{\beta}$, of generalized s-selfdecom-posable probability distributions, can be viewed as an image via random integral mapping $\mathcal{J}^{\beta}$ of the class $ID$ of all infinitely divisible…

The performance of many machine learning techniques depends on the choice of an appropriate similarity or distance measure on the input space. Similarity learning (or metric learning) aims at building such a measure from training data so…

The problem of quantization of measures looks for best approximations of probability measures on a metric space by discrete measures supported on $N$ points, where the error of approximation is measured with respect to the Wasserstein…

Let $\mathcal{G}$ be a directed graph with vertices $1,2,\ldots, 2N$. Let $\mathcal{T}=(T_{i,j})_{(i,j)\in\mathcal{G}}$ be a family of contractive similitudes. For every $1\leq i\leq N$, let $i^+:=i+N$. For $1\leq i,j\leq N$, we define…

We establish a Zador like theorem for $L^r$-optimal vector quantization when the similarity measure is a twice differentiable Bregman divergence of a strictly convex function. On our way we also prove a similar result when the Bregman…

Consider the following prediction problem. Assume that there is a block box that produces bits according to some unknown computable distribution on the binary tree. We know first $n$ bits $x_1 x_2 \ldots x_n$. We want to know the…

In this note, we develop some of the basic theory of s-finite (measures and) kernels, a little-studied class that Staton has recently argued convincingly to be precisely the semantic counterpart of (first-order) probabilistic programs. We…

We provide an algorithm to approximate a finitely supported discrete measure $\mu$ by a measure $\nu_{N}$ corresponding to a set of $N$ points so that the total variation between $\mu$ and $\nu_N$ has an upper bound. As a consequence if…