Related papers: Uniform Distribution on $(n-1)$-Sphere: Rate-Disto…
The unit ball random geometric graph $G=G^d_p(\lambda,n)$ has as its vertices $n$ points distributed independently and uniformly in the $d$-dimensional unit ball, with two vertices adjacent if and only if their $l_p$-distance is at most…
For the HB problem with the CR constraint, the rate-distortion function is derived under the assumption that the side information sequences are (stochastically) degraded. The rate-distortion function is also calculated explicitly for three…
The rate-distortion function (RDF) has long been an information-theoretic benchmark for data compression. As its natural extension, the indirect rate-distortion function (iRDF) corresponds to the scenario where the encoder can only access…
We present a new method to estimate the rate-distortion-perception function in the perfect realism regime (PR-RDPF), for multivariate continuous sources subject to a single-letter average distortion constraint. The proposed approach is not…
Self-diffusion coefficients, $D^*$, are routinely estimated from molecular dynamics simulations by fitting a linear model to the observed mean-squared displacements (MSDs) of mobile species. MSDs derived from simulation exhibit statistical…
I proposed rate tolerance and discussed its relation to rate distortion in my book "A Generalized Information Theory" published in 1993. Recently, I examined the structure function and the complexity distortion based on Kolmogorov's…
Due to measurement noise, a common problem in in various fields is how to estimate the ratio of two functions. We consider this problem of estimating the ratio of two functions in a nonparametric regression model. Assuming the noise is…
Suppose that $\{G_n\}$ is a sequence of finite graphs such that each $G_n$ is the tangency graph of a sphere packing in $\mathbb{R}^d$. Let $\rho_n$ be a uniformly random vertex of $G_n$ and suppose that $(G,\rho)$ is the distributional…
We study the compression of data in the case where the useful information is contained in a set rather than a vector, i.e., the ordering of the data points is irrelevant and the number of data points is unknown. Our analysis is based on…
We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…
We consider 1d random Hermitian $N\times N$ block band matrices consisting of $W\times W$ random Gaussian blocks (parametrized by $j,k \in\Lambda=[1,n]\cap \mathbb{Z}$, $N=nW$) with a fixed entry's variance…
Source coding theorems and Shannon rate-distortion functions were studied for the discrete-time Wiener process by Berger and generalized to nonstationary Gaussian autoregressive processes by Gray and by Hashimoto and Arimoto. Hashimoto and…
We attempt to investigate a two-dimensional Gauss-Kuzmin theorem for R\'enyi-type continued fraction expansions. More precisely speaking, our focus is to obtain specific lower and upper bounds for the error term considered which imply the…
Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated, in particular when X 1 is not…
Generalization to novel visual conditions remains a central challenge for both human and machine vision, yet standard robustness metrics offer limited insight into how systems trade accuracy for robustness. We introduce a…
The Grassmann manifold G_{n,p}(L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space L^{n}, where L is either R or C. This paper considers an unequal dimensional quantization in which a source…
In this paper, we study rate-distortion theory for general sources with an emphasis on the existence of optimal reconstruction distributions on noncompact alphabets. Classical attainability results typically rely on compactness of the…
Understanding generalization in modern machine learning settings has been one of the major challenges in statistical learning theory. In this context, recent years have witnessed the development of various generalization bounds suggesting…
We build on recent works on Stein's method for functions of multivariate normal random variables to derive bounds for the rate of convergence of some asymptotically chi-square distributed statistics. We obtain some general bounds and…
We investigate the problem of density estimation on the unit circle and the unit sphere from a computational perspective. Our primary goal is to develop new density estimators that are both rate-optimal and computationally efficient for…