A remark on entropy numbers

08/29/2020
by   Vladimir Temlyakov, et al.
0

Talagrand's fundamental result on the entropy numbers is slightly improved. Our proof uses different ideas based on results from greedy approximation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2022

On the entropy numbers and the Kolmogorov widths

Direct estimates between linear or nonlinear Kolmogorov widths and entro...
research
02/28/2016

On the entropy numbers of the mixed smoothness function classes

Behavior of the entropy numbers of classes of multivariate functions wit...
research
04/26/2023

Entropy-based convergence rates of greedy algorithms

We present convergence estimates of two types of greedy algorithms in te...
research
05/29/2023

An Alternate Proof of Near-Optimal Light Spanners

In 2016, a breakthrough result of Chechik and Wulff-Nilsen [SODA '16] es...
research
09/15/2020

A functorial characterization of von Neumann entropy

We classify the von Neumann entropy as a certain concave functor from fi...
research
03/11/2021

On Hardy's Apology Numbers

Twelve well-known "Recreational" numbers are generalized and classified ...
research
05/14/2018

Maximum Entropy Interval Aggregations

Given a probability distribution p = (p_1, ..., p_n) and an integer 1≤ ...

Please sign up or login with your details

Forgot password? Click here to reset