English
Related papers

Related papers: Quantization for uniform distributions on stretche…

200 papers

We develop a test for spherical symmetry of a multivariate distribution $\Pr$ that works well even when the dimension of the data $d$ is larger than the sample size $n$. We propose a non-negative measure of spherical asymmetry $\zeta(\Pr)$…

Statistics Theory · Mathematics 2025-09-09 Bilol Banerjee , Anil K. Ghosh

We show a statistical version of Taylor's theorem and apply this result to non-parametric density estimation from truncated samples, which is a classical challenge in Statistics \cite{woodroofe1985estimating, stute1993almost}. The…

Statistics Theory · Mathematics 2021-07-01 Constantinos Daskalakis , Vasilis Kontonis , Christos Tzamos , Manolis Zampetakis

Following the student t-statistic, normalization has been a widely used method in statistic and other disciplines including economics, ecology and machine learning. We focus on statistics taking the form of a ratio over (some power of) the…

Statistics Theory · Mathematics 2025-09-19 Haolin Zou , Heyuan Yao , Victor de la Peña

Consider $k$ independent random samples from $p$-dimensional multivariate normal distributions. We are interested in the limiting distribution of the log-likelihood ratio test statistics for testing for the equality of $k$ covariance…

Statistics Theory · Mathematics 2023-05-23 Wenchuan Guo , Yongcheng Qi

Uniform measures have played a fundamental role in geometric measure theory since they naturally appear as tangent objects. For instance, they were essential in the groundbreaking work of Preiss on the rectifiability of Radon measures.…

Metric Geometry · Mathematics 2018-03-26 A. Dali Nimer

In this paper, we study the probabilistic local well-posedness of the cubic Schr\"odinger equation (cubic NLS): \[ (i\partial_{t} + \Delta) u = \pm |u|^{2} u \text{ on } [0,T) \times \mathbb{R}^{d}, \] with initial data being a Wiener…

Analysis of PDEs · Mathematics 2024-04-10 Jean-Baptiste Casteras , Juraj Foldes , Gennady Uraltsev

We consider skew-products of quadratic maps over certain Misiurewicz-Thurston maps and study their statistical properties. We prove that, when the coupling function is a polynomial of odd degree, such a system admits two positive Lyapunov…

Dynamical Systems · Mathematics 2012-07-12 Rui Gao , Weixiao Shen

We consider statistical learning problems in which data are observed as a set of probability measures. Optimal transport (OT) is a popular tool to compare and manipulate such objects, but its computational cost becomes prohibitive when the…

Machine Learning · Statistics 2026-03-24 Erell Gachon , Elsa Cazelles , Jérémie Bigot

The Wasserstein distance provides a notion of dissimilarities between probability measures, which has recent applications in learning of structured data with varying size such as images and text documents. In this work, we study the…

Machine Learning · Statistics 2022-06-28 Donlapark Ponnoprat

We investigate $(2+1)$-dimensional discretized directed polymers in Gaussian random media. By numerically calculating the probability distribution function of overlap between two independent and identical systems on a common random…

Disordered Systems and Neural Networks · Physics 2019-05-20 Masahiko Ueda

By combining the Minkowski inequality and the quantum Chernoff bound, we derive easy-to-compute upper bounds for the error probability affecting the optimal discrimination of Gaussian states. In particular, these bounds are useful when the…

Quantum Physics · Physics 2008-07-27 Stefano Pirandola , Seth Lloyd

This work is about an improved error analysis of CholeskyQR with the randomized model for the tall-skinny $X \in \mathbb{R}^{m\times n}$. Due to the structure of CholeskyQR, we utilize the randomized model in the first step of CholeskyQR…

Numerical Analysis · Mathematics 2025-08-19 Haoran Guan , Yuwei Fan

Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in…

Methodology · Statistics 2019-04-10 Victor M. Panaretos , Yoav Zemel

Lloyd's algorithm is an iterative method that solves the quantization problem, i.e. the approximation of a target probability measure by a discrete one, and is particularly used in digital applications. This algorithm can be interpreted as…

Optimization and Control · Mathematics 2026-05-14 Léo Portales , Elsa Cazelles , Edouard Pauwels

We state some inequalities for m-divisible and infinite divisible characteristic functions. Basing on them we propose a statistical test for a distribution to be infinitely divisible. Keywords: infinite divisible distributions; statistical…

Probability · Mathematics 2019-04-17 Lev B. Klebanov , Ashot V. Kakosyan , Irina V. Volchenkova

We establish for dual quantization the counterpart of Kieffer's uniqueness result for compactly supported one dimensional probability distributions having a $\log$-concave density (also called strongly unimodal): for such distributions,…

Probability · Mathematics 2020-10-22 Benjamin Jourdain , Gilles Pagès

In this paper we consider the problem of uniformity testing with limited memory. We observe a sequence of independent identically distributed random variables drawn from a distribution $p$ over $[n]$, which is either uniform or is…

Information Theory · Computer Science 2022-06-22 Tomer Berg , Or Ordentlich , Ofer Shayevitz

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

In statistical analysis, quantifying uncertainties through measures such as entropy, extropy, varentropy, and varextropy is of fundamental importance for understanding distribution functions. This paper investigates several properties of…

Statistics Theory · Mathematics 2025-01-28 Santosh Kumar Chaudhary , Nitin Gupta

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson
‹ Prev 1 8 9 10 Next ›