Bracketing Entropy
A tool for measuring the complexity of a function class, defined as the logarithm of the minimum number of brackets needed to cover the function class. It is commonly used in empirical process theory and in convergence rate analysis for MLE.
Timeline (last 90 days)
One of the paper's core technical contributions is a sharp upper bound on the L^2 bracketing entropy of bounded sub-polynomial balls, a result of independent value.
Bracketing entropy is defined as the logarithm of the minimum number of brackets needed to cover a function class, and is commonly used to bound the supremum of empirical processes via the Dudley entropy integral, thereby controlling the convergence rate of the MLE.
All Facts (2)
One of the paper's core technical contributions is a sharp upper bound on the L^2 bracketing entropy of bounded sub-polynomial balls, a result of independent value.
50%UnverifiedBracketing entropy is defined as the logarithm of the minimum number of brackets needed to cover a function class, and is commonly used to bound the supremum of empirical processes via the Dudley entropy integral, thereby controlling the convergence rate of the MLE.
50%