English
Related papers

Related papers: On the Conditional Smooth Renyi Entropy and its Ap…

200 papers

Shannon entropy is the shortest average codeword length a lossless compressor can achieve by encoding i.i.d. symbols. However, there are cases in which the objective is to minimize the \textit{exponential} average codeword length, i.e. when…

Information Theory · Computer Science 2024-06-10 Andrea Somazzi , Paolo Ferragina , Diego Garlaschelli

We demonstrate that the Renyi-2 entropy provides a natural measure of information for any multimode Gaussian state of quantum harmonic systems, operationally linked to the phase-space Shannon sampling entropy of the Wigner distribution of…

Quantum Physics · Physics 2013-05-27 Gerardo Adesso , Davide Girolami , Alessio Serafini

To address the challenge of quantifying uncertainty in the outputs generated by language models, we propose a novel measure of semantic uncertainty, semantic spectral entropy, that is statistically consistent under mild assumptions. This…

Computation and Language · Computer Science 2025-05-27 Yi Liu

Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum R\'enyi entropies. In order to do this, we appeal to a very general quantum encoding scheme that…

Quantum Physics · Physics 2017-10-05 G. Bellomo , G. M. Bosyk , F. Holik , S. Zozor

We study the information leakage to a guessing adversary in zero-error source coding. The source coding problem is defined by a confusion graph capturing the distinguishability between source symbols. The information leakage is measured by…

Information Theory · Computer Science 2021-02-04 Yucheng Liu , Lawrence Ong , Sarah Johnson , Joerg Kliewer , Parastoo Sadeghi , Phee Lep Yeoh

Predictive inference requires balancing statistical accuracy against informational complexity, yet the choice of complexity measure is usually imposed rather than derived. We treat econometric objects as predictive rules, mappings from…

Statistics Theory · Mathematics 2026-02-16 Nicholas G. Polson , Daniel Zantedeschi

We consider finite element approximations of ill-posed elliptic problems with conditional stability. The notion of {\emph{optimal error estimates}} is defined including both convergence with respect to mesh parameter and perturbations in…

Numerical Analysis · Mathematics 2024-03-25 Erik Burman , Mihai Nechita , Lauri Oksanen

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

Entropy rate of sequential data-streams naturally quantifies the complexity of the generative process. Thus entropy rate fluctuations could be used as a tool to recognize dynamical perturbations in signal sources, and could potentially be…

Information Theory · Computer Science 2014-03-24 Ishanu Chattopadhyay , Hod Lipson

In this paper, we prove the anisotropic Shannon inequality for the Renyi entropy with the best constant on Folland-Stein homogeneous Lie groups. As a consequence, we also prove the optimal Shannon inequality in the same setting. Using a…

Functional Analysis · Mathematics 2024-02-16 Marianna Chatzakou , Michael Ruzhansky , Anjali Shriwastawa

Behavior of the entropy numbers of classes of multivariate functions with mixed smoothness is studied here. This problem has a long history and some fundamental problems in the area are still open. The main goal of this paper is to develop…

Numerical Analysis · Mathematics 2016-03-01 V. Temlyakov

Estimating the entropy of a discrete random variable is a fundamental problem in information theory and related fields. This problem has many applications in various domains, including machine learning, statistics and data compression. Over…

Information Theory · Computer Science 2020-12-22 Yuval Shalev , Amichai Painsky , Irad Ben-Gal

In this paper, we prove that the Renyi entropy of linearly normalized partial maxima of independent and identically distributed random variables is convergent to the corresponding limit Renyi entropy when the linearly normalized partial…

Other Statistics · Statistics 2014-04-23 Ali Saeb

This paper explores the relationship between the condition number of a neural network's weight tensor and the extent of information encoded by the associated processing unit, viewed through the lens of information theory. It argues that a…

Machine Learning · Statistics 2026-02-10 Oswaldo Ludwig

We introduce a new framework term coding for extremal problems in discrete mathematics and information flow, where one chooses interpretations of function symbols so as to maximise the number of satisfying assignments of a finite system of…

Information Theory · Computer Science 2026-02-10 Søren Riis

Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…

Mathematical Physics · Physics 2020-12-24 David Sutter , Omar Fawzi , Renato Renner

A lower bound on the R\'enyi differential entropy of a sum of independent random vectors is demonstrated in terms of rearrangements. For the special case of Boltzmann-Shannon entropy, this lower bound is better than that given by the…

Information Theory · Computer Science 2015-05-07 Liyao Wang , Mokshay Madiman

This paper explores some applications of a two-moment inequality for the integral of the $r$-th power of a function, where $0 < r< 1$. The first contribution is an upper bound on the R\'{e}nyi entropy of a random vector in terms of the two…

Information Theory · Computer Science 2017-02-24 Galen Reeves

Uncertainty relations for a pair of arbitrary measurements and for a single measurement are posed in the form of inequalities using the Renyi entropies. The formulation deals with discrete observables. Both the relations with…

Quantum Physics · Physics 2008-07-21 A. E. Rastegin

Sharp, nonasymptotic bounds are obtained for the relative entropy between the distributions of sampling with and without replacement from an urn with balls of $c\geq 2$ colors. Our bounds are asymptotically tight in certain regimes and,…

Probability · Mathematics 2026-01-14 Oliver Johnson , Lampros Gavalakis , Ioannis Kontoyiannis