English
Related papers

Related papers: Metric entropy for functions of bounded total gene…

200 papers

Minimum divergence estimators provide a natural choice of estimators in a statistical inference problem. Different properties of various families of these divergence measures such as Hellinger distance, power divergence, density power…

Statistics Theory · Mathematics 2025-07-08 Subhrajyoty Roy , Supratik Basu , Abhik Ghosh , Ayanendranath Basu

Finite mixture models have long been used across a variety of fields in engineering and sciences. Recently there has been a great deal of interest in quantifying the convergence behavior of the \emph{mixing measure}, a fundamental object…

Statistics Theory · Mathematics 2025-09-05 Yun Wei , Sayan Mukherjee , XuanLong Nguyen

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

The entropy is a measure of uncertainty that plays a central role in information theory. When the distribution of the data is unknown, an estimate of the entropy needs be obtained from the data sample itself. We propose a semi-parametric…

Methodology · Statistics 2022-01-06 Stéphane Robin , Luca Scrucca

In this paper we develop a theory of matrix completion for the extreme case of noisy 1-bit observations. Instead of observing a subset of the real-valued entries of a matrix M, we obtain a small number of binary (1-bit) measurements…

Statistics Theory · Mathematics 2014-07-02 Mark A. Davenport , Yaniv Plan , Ewout van den Berg , Mary Wootters

We describe a method to computationally estimate the probability density function of a univariate random variable by applying the maximum entropy principle with some local conditions given by Gaussian functions. The estimation errors and…

Statistics Theory · Mathematics 2012-06-21 Mihail-Ioan Pop

Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…

Information Theory · Computer Science 2015-01-14 Alexander Schönhuth

We present a new methodology for the characterization of the metric entropy of infinite-dimensional ellipsoids with exponentially decaying semi-axes. This procedure does not rely on the explicit construction of coverings or packings and…

Functional Analysis · Mathematics 2024-05-21 Thomas Allard , Helmut Bölcskei

We revisit generalized entropic formulations of the uncertainty principle for an arbitrary pair of quantum observables in two-dimensional Hilbert space. R\'enyi entropy is used as uncertainty measure associated with the distribution…

Quantum Physics · Physics 2014-06-23 Steeve Zozor , Gustavo Martín Bosyk , Mariela Portesi

We establish the first information-theoretic limits for multimodal retrieval. Casting ranking as lossy source coding, we derive a single-letter rate-distortion function $R(D)$ for reciprocal-rank distortion and prove a converse bound that…

Information Theory · Computer Science 2025-09-16 Thomas Y. Chen

A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…

Information Theory · Computer Science 2007-07-13 Joseph DeStefano , Erik Learned-Miller

For \Gamma a countable amenable group consider those actions of \Gamma as measure-preserving transformations of a standard probability space, written as {T_\gamma}_{\gamma \in \Gamma} acting on (X,{\cal F}, \mu). We say…

Dynamical Systems · Mathematics 2016-09-07 Daniel J. Rudolph , Benjamin Weiss

Estimating the entropy rate of discrete time series is a challenging problem with important applications in numerous areas including neuroscience, genomics, image processing and natural language processing. A number of approaches have been…

Methodology · Statistics 2023-03-22 Ioannis Papageorgiou , Ioannis Kontoyiannis

Given a probability distribution P, what is the minimum amount of bits needed to store a value x sampled according to P, such that x can later be recovered (except with some small probability)? Or, what is the maximum amount of uniform…

Information Theory · Computer Science 2007-07-13 Thomas Holenstein , Renato Renner

Entropy estimation is of practical importance in information theory and statistical science. Many existing entropy estimators suffer from fast growing estimation bias with respect to dimensionality, rendering them unsuitable for…

Information Theory · Computer Science 2023-08-22 Ziqiao Ao , Jinglai Li

A novel principle is presented which allows for the proof of bounded weak solutions to a class of physically relevant, strongly coupled parabolic systems exhibiting a formal gradient-flow structure. The main feature of these systems is that…

Analysis of PDEs · Mathematics 2015-06-11 Ansgar Jüngel

We seek an entropy estimator for discrete distributions with fully empirical accuracy bounds. As stated, this goal is infeasible without some prior assumptions on the distribution. We discover that a certain information moment assumption…

Information Theory · Computer Science 2022-12-27 Doron Cohen , Aryeh Kontorovich , Aaron Koolyk , Geoffrey Wolfer

Simple upper and lower bounds are obtained for the integral $\int_0^x\mathrm{e}^{-\gamma t}t^\nu I_\nu(t)\,\mathrm{d}t$, $x>0$, $\nu>-\frac{1}{2}$, $0<\gamma<1$. Most of our bounds for this integral are tight as $x\rightarrow\infty$. We…

Classical Analysis and ODEs · Mathematics 2021-04-13 Robert E. Gaunt

We consider the problem of learning a target probability distribution over a set of $N$ binary variables from the knowledge of the expectation values (with this target distribution) of $M$ observables, drawn uniformly at random. The space…

Statistical Mechanics · Physics 2015-09-02 Tomoyuki Obuchi , Simona Cocco , Rémi Monasson

We introduce a new distance-preserving compact representation of multi-dimensional point-sets. Given $n$ points in a $d$-dimensional space where each coordinate is represented using $B$ bits (i.e., $dB$ bits per point), it produces a…

Data Structures and Algorithms · Computer Science 2017-11-07 Piotr Indyk , Ilya Razenshteyn , Tal Wagner
‹ Prev 1 3 4 5 6 7 10 Next ›