English
Related papers

Related papers: R\'enyi divergence-based uniformity guarantees for…

200 papers

The concept of the smoothing parameter plays a crucial role in both lattice-based and code-based cryptography, primarily due to its effectiveness in achieving nearly uniform distributions through the addition of noise. Recent research by…

Information Theory · Computer Science 2024-05-17 Hao Yan , Cong Ling

The R\'enyi (Shannon) entropy, i.e. $Re_{\alpha}(Sh)$, of the ground state of quantum systems in local bases normally show a volume-law behavior. For a subsystem of quantum chains at critical point there is an extra logarithmic subleading…

Statistical Mechanics · Physics 2022-06-10 Babak Tarighi , Reyhaneh Khasseh , M. N. Najafi , M. A. Rajabpour

Consistent Hashing functions are widely used for load balancing across a variety of applications. However, the original presentation and typical implementations of Consistent Hashing rely on randomised allocation of hash codes to keys which…

Data Structures and Algorithms · Computer Science 2015-03-19 Matthew Sackman

We discuss some properties of the generalized entropies, called Renyi entropies and their application to the case of continuous distributions. In particular it is shown that these measures of complexity can be divergent, however, their…

Disordered Systems and Neural Networks · Physics 2007-05-23 I. Varga , J. Pipek

In this work, we prove uniform continuity bounds for entropic quantities related to the sandwiched R\'enyi divergences such as the sandwiched R\'enyi conditional entropy. We follow three different approaches: The first one is the "almost…

Quantum Physics · Physics 2025-05-08 Andreas Bluhm , Ángela Capel , Paul Gondolf , Tim Möbus

Motivated by giving a meaning to "The probability that a random integer has initial digit d", we define a URI-set as a random set E of natural integers such that each n>0 belongs to E with probability 1/n, independently of other integers.…

Probability · Mathematics 2012-11-20 Élise Janvresse , Thierry De La Rue

Let $p_n(y)=\sum_k\hat{\alpha}_k\phi(y-k)+\sum_{l=0}^{j_n-1}\sum_k\hat {\beta}_{lk}2^{l/2}\psi(2^ly-k)$ be the linear wavelet density estimator, where $\phi$, $\psi$ are a father and a mother wavelet (with compact support),…

Statistics Theory · Mathematics 2009-08-31 Evarist Giné , Richard Nickl

We consider the problem of approximating the empirical Shannon entropy of a high-frequency data stream under the relaxed strict-turnstile model, when space limitations make exact computation infeasible. An equivalent measure of entropy is…

Computation · Statistics 2013-04-18 Peter Clifford , Ioana Ada Cosma

Estimating divergences in a consistent way is of great importance in many machine learning tasks. Although this is a fundamental problem in nonparametric statistics, to the best of our knowledge there has been no finite sample exponential…

Information Theory · Computer Science 2016-03-30 Shashank Singh , Barnabás Póczos

On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…

Classical Analysis and ODEs · Mathematics 2023-01-06 Anatoly Serdyuk , Tetiana Stepaniuk

This paper presents a novel theoretical study of the general problem of multiple source adaptation using the notion of Renyi divergence. Our results build on our previous work [12], but significantly broaden the scope of that work in…

Machine Learning · Computer Science 2012-05-14 Yishay Mansour , Mehryar Mohri , Afshin Rostamizadeh

A loss function measures the discrepancy between the true values (observations) and their estimated fits, for a given instance of data. A loss function is said to be proper (unbiased, Fisher consistent) if the fits are defined over a unit…

Information Theory · Computer Science 2018-05-11 Amichai Painsky , Gregory W. Wornell

Universal hypothesis testing refers to the problem of deciding whether samples come from a nominal distribution or an unknown distribution that is different from the nominal distribution. Hoeffding's test, whose test statistic is equivalent…

Information Theory · Computer Science 2017-11-15 Pengfei Yang , Biao Chen

We consider nonparametric or universal sequential hypothesis testing problem when the distribution under the null hypothesis is fully known but the alternate hypothesis corresponds to some other unknown distribution. These algorithms are…

Information Theory · Computer Science 2013-08-30 Jithin K. Sreedharan , Vinod Sharma

We introduce hardness in relative entropy, a new notion of hardness for search problems which on the one hand is satisfied by all one-way functions and on the other hand implies both next-block pseudoentropy and inaccessible entropy, two…

Cryptography and Security · Computer Science 2024-11-15 Rohit Agrawal , Yi-Hsiu Chen , Thibaut Horel , Salil Vadhan

This paper starts by considering the minimization of the Renyi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),…

Information Theory · Computer Science 2015-10-27 Igal Sason

We develop a general theory for computing the Renyi entropy with general multiple disjoint intervals from the swapping operations. Our theory is proposed based on the fact that we have observed the resemblance between the replica trick in…

Statistical Mechanics · Physics 2026-04-03 Han-Qing Shi , Hai-Qing Zhang

For normalized sums $Z_n$ of i.i.d. random variables, we explore necessary and sufficient conditions which guarantee the normal approximation with respect to the R\'enyi divergence of infinite order. In terms of densities $p_n$ of $Z_n$,…

Probability · Mathematics 2024-06-21 Sergey G. Bobkov , Friedrich Götze

This paper concerns the construction of tests for universal hypothesis testing problems, in which the alternate hypothesis is poorly modeled and the observation space is large. The mismatched universal test is a feature-based technique for…

Information Theory · Computer Science 2016-04-18 Dayu Huang , Sean Meyn

This paper develops systematic approaches to obtain $f$-divergence inequalities, dealing with pairs of probability measures defined on arbitrary alphabets. Functional domination is one such approach, where special emphasis is placed on…

Information Theory · Computer Science 2016-12-06 Igal Sason , Sergio Verdú