Related papers: Quantization and centroidal Voronoi tessellations …
We propose finite-time measures to compute the divergence, the curl and the velocity gradient tensor of the point particle velocity for two- and three-dimensional moving particle clouds. For this purpose, a tessellation of the particle…
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…
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…
We consider statistical methods based on finite samples of locally randomized measurements in order to certify different degrees of multiparticle entanglement in intermediate-scale quantum systems. We first introduce hierarchies of…
The Voronoi tessellation is a natural way of space segmentation, which has many applications in various fields of science and technology, as well as in social sciences and visual art. The varieties of the Voronoi tessellation methods are…
Several researchers have proposed minimisation of maximum mean discrepancy (MMD) as a method to quantise probability measures, i.e., to approximate a target distribution by a representative point set. We consider sequential algorithms that…
This paper investigates the effect of quantization on the performance of the Neyman-Pearson test. It is assumed that a sensing unit observes samples of a correlated stationary ergodic multivariate process. Each sample is passed through an…
The point inclusion tests for polygons, in other words the point-in-polygon (PIP) algorithms, are fundamental tools for many scientific fields related to computational geometry, and they have been studied for a long time. The PIP algorithms…
Zador's celebrated theorem is a cornerstone of optimal quantisation, establishing both the weak limit of the empirical distribution of an $n$-point optimal quantiser in $R^d$ and the decay rate of the associated $L_s$-mean quantisation…
We consider the problem of validating whether a neural posterior estimate \( q(\theta \mid x) \) is an accurate approximation to the true, unknown true posterior \( p(\theta \mid x) \). Existing methods for evaluating the quality of an NPE…
The distributed and continuous representations used by neural networks are at odds with representations employed in linguistics, which are typically symbolic. Vector quantization has been proposed as a way to induce discrete neural…
A Poisson Binomial distribution over $n$ variables is the distribution of the sum of $n$ independent Bernoullis. We provide a sample near-optimal algorithm for testing whether a distribution $P$ supported on $\{0,...,n\}$ to which we have…
Voronoi constellations (VCs) are finite sets of vectors of a coding lattice enclosed by the translated Voronoi region of a shaping lattice, which is a sublattice of the coding lattice. In conventional VCs, the shaping lattice is a scaled-up…
The use of correntropy as a similarity measure has been increasing in different scenarios due to the well-known ability to extract high-order statistic information from data. Recently, a new similarity measure between complex random…
Randomness is a valuable resource in science, cryptography, engineering, and information technology. Quantum-mechanical sources of randomness are attractive because of the indeterminism of individual quantum processes. Here we consider the…
Weight-sharing quantization has emerged as a technique to reduce energy expenditure during inference in large neural networks by constraining their weights to a limited set of values. However, existing methods for weight-sharing…
Given two sets of training samples, general method is to estimate the density function and classify the test sample according to higher values of estimated densities. Natural way to estimate the density should be histogram tending to…
Calibration ensures that probabilistic forecasts meaningfully capture uncertainty by requiring that predicted probabilities align with empirical frequencies. However, many existing calibration methods are specialized for post-hoc…
Three-dimensional Voronoi analysis is used to quantify the clustering of inertial particles in homogeneous isotropic turbulence using data from numerics and experiments. We study the clustering behavior at different density ratios and…
Bayesian clustering methods have the widely touted advantage of providing a probabilistic characterization of uncertainty in clustering through the posterior distribution. An amazing variety of priors and likelihoods have been proposed for…