English
Related papers

Related papers: Optimal quantization for some triadic uniform Cant…

200 papers

This paper establishes the strict optimality in precision for frequency and distribution estimation under local differential privacy (LDP). We prove that a linear estimator with a symmetric and extremal configuration, and a constant support…

Information Theory · Computer Science 2026-03-24 Mingen Pan

The seminal result of Johnson and Lindenstrauss on random embeddings has been intensively studied in applied and theoretical computer science. Despite that vast body of literature, we still lack of complete understanding of statistical…

Machine Learning · Computer Science 2021-04-13 Maciej Skorski

We derive a lower bound on the smallest output entropy that can be achieved via vector quantization of a $d$-dimensional source with given expected $r$th-power distortion. Specialized to the one-dimensional case, and in the limit of…

Information Theory · Computer Science 2017-03-27 Tobias Koch , Gonzalo Vazquez-Vilar

We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our…

Quantum Physics · Physics 2007-05-23 Panos Aliferis , Daniel Gottesman , John Preskill

We study the asymptotic error of score-based diffusion model sampling in large-sample scenarios from a non-parametric statistics perspective. We show that a kernel-based score estimator achieves an optimal mean square error of…

Statistics Theory · Mathematics 2024-07-25 Kaihong Zhang , Caitlyn H. Yin , Feng Liang , Jingbo Liu

The Boolean product $R = P \cdot Q$ of two $\{ 0, 1\} \; m \times m \; $ matrices is $$R(j,k) = 1 \; \mathrm{\ IF\ for\ some\ } \; t \; \,P(j, t) = Q(t, k) = 1\; \; \mathrm{ELSE\ } \, R(j, k) = 0. $$ The near-optimal design reduces the…

Combinatorics · Mathematics 2018-08-27 Eli Shamir

Range coders and ANS replace empirical probabilities with integer frequencies summing to a fixed $M$; the resulting per-symbol code-length redundancy is exactly the KL divergence of the empirical distribution from the quantized one.…

Information Theory · Computer Science 2026-05-04 Kamila Szewczyk

We study the problem of testing discrete distributions with a focus on the high probability regime. Specifically, given samples from one or more discrete distributions, a property $\mathcal{P}$, and parameters $0< \epsilon, \delta <1$, we…

Data Structures and Algorithms · Computer Science 2020-09-15 Ilias Diakonikolas , Themis Gouleakis , Daniel M. Kane , John Peebles , Eric Price

We consider channel coding for Gaussian channels with the recently introduced mean and variance cost constraints. Through matching converse and achievability bounds, we characterize the optimal first- and second-order performance. The main…

Information Theory · Computer Science 2025-09-15 Adeel Mahmood , Aaron B. Wagner

In this paper, we consider a problem of counting rational points near self-similar sets. Let $n\geq 1$ be an integer. We shall show that for some self-similar measures on $\mathbb{R}^n$, the set of rational points $\mathbb{Q}^n$ is…

Number Theory · Mathematics 2021-01-18 Han Yu

Let $\{f_i\}_{i=1}^N$ be a set of equi-contractive similitudes on $\mathbb{R}^1$ satisfying the finite-type condition. We study the asymptotic quantization error for self-similar measures $\mu$ associated with $\{f_i\}_{i=1}^N$ and a…

Functional Analysis · Mathematics 2025-04-09 Sanguo Zhu

After the correction of an inaccurate result in the reference, the author uses five different methods, and gets five different inequalities on the Hausdorff measure of the Cartesian product of the middle third Cantor set with itself: $$H^s…

Dynamical Systems · Mathematics 2019-10-01 Yuchen Fan

A local tester for an error correcting code $C\subseteq \Sigma^{n}$ is a tester that makes $Q$ oracle queries to a given word $w\in \Sigma^n$ and decides to accept or reject the word $w$. An optimal local tester is a local tester that has…

Computational Complexity · Computer Science 2023-04-14 Dor Minzer , Kai Zheng

We prove an inequality related to questions in Approximation Theory, Probability Theory, and to Irregularities of Distribution. Let $h_R$ denote an $L ^{\infty}$ normalized Haar function adapted to a dyadic rectangle $R\subset [0,1] ^{3}$.…

Classical Analysis and ODEs · Mathematics 2007-06-21 Michael T Lacey , Dmitry Bilyk

In this paper, we present a method to certify the approximation quality of a low rank tensor to a given third order symmetric tensor. Under mild assumptions, best low rank approximation is attained if a control parameter is zero or…

Optimization and Control · Mathematics 2023-07-21 Shenglong Hu , Defeng Sun , Kim-Chuan Toh

We present an information-theoretic approach to lower bound the oracle complexity of nonsmooth black box convex optimization, unifying previous lower bounding techniques by identifying a combinatorial problem, namely string guessing, as a…

Optimization and Control · Mathematics 2023-07-10 Gábor Braun , Cristóbal Guzmán , Sebastian Pokutta

We study optimal quadrature formulas for arbitrary weighted integrals and integrands from the Sobolev space $H^1([0,1])$. We obtain general formulas for the worst case error depending on the nodes $x_j$. A particular case is the computation…

Numerical Analysis · Mathematics 2018-07-17 Erich Novak , Shun Zhang

We consider the problem of detecting the true quantum state among $r$ possible ones, based of measurements performed on $n$ copies of a finite-dimensional quantum system. A special case is the problem of discriminating between $r$…

Quantum Physics · Physics 2012-05-14 Michael Nussbaum , Arleta Szkoła

Consider a photon that has just emerged from a linear polarizing filter. If the photon is then subjected to an orthogonal polarization measurement-e.g., horizontal vs vertical-the photon's preparation cannot be fully expressed in the…

Quantum Physics · Physics 2013-01-11 William K. Wootters

The optimal receiver operating characteristic (ROC) curve, giving the maximum probability of detection as a function of the probability of false alarm, is a key information-theoretic indicator of the difficulty of a binary hypothesis…

Information Theory · Computer Science 2025-06-10 Bruce Hajek , Xiaohan Kang