From Gauss to Kolmogorov: localized measures of complexity for ellipses
From MaRDI portal
Publication:2199701
adaptive estimationcomplexity measureellipse constraintKolmogorov widthleast squareslocal metric entropy
Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).
Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).
Recommendations
- Kolmogorov complexity and the geometry of Brownian motion
- Relative Kolmogorov complexity and geometry
- scientific article; zbMATH DE number 17560
- Ellipticity and circularity measuring via Kullback-Leibler divergence
- The Local Geometry of Testing in Ellipses: Tight Control via Localized Kolmogorov Widths
- Kolmogorov Complexity, Lovász Local Lemma and Critical Exponents
- Kolmogorov complexity and Hausdorff dimension
- scientific article; zbMATH DE number 2089354
- Sharp asymptotics of the metric entropy for ellipsoids
- A geometric approach to complexity
Cites work
- A new perspective on least squares under convex constraint
- Adapting to Unknown Smoothness via Wavelet Shrinkage
- An automatic inequality prover and instance optimal identity testing
- Chaining, interpolation and convexity II: the contraction principle
- Chaining, interpolation, and convexity
- Compressed sensing
- Concentration inequalities. A nonasymptotic theory of independence
- High-dimensional statistics. A non-asymptotic viewpoint
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 5654889 (Why is no real title available?)
- scientific article; zbMATH DE number 3980111 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- Hypothesis testing for densities and high-dimensional multinomials: sharp local minimax rates
- Ideal spatial adaptation by wavelet shrinkage
- Introduction to nonparametric estimation
- Local Rademacher complexities
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Majorizing measures: The generic chaining
- Minimax risk over hyperrectangles, and implications
- Near-optimality of linear recovery in Gaussian observation scheme under \(\| \cdot \|_{2}^{2}\)-loss
- On density estimation in the view of Kolmogorov's ideas in approximation theory
- On risk bounds in isotonic and other shape restricted regression problems
- On the degrees of freedom in shape-restricted regression.
- Optimal filtering of square-integrable signals in Gaussian noise
- Rademacher penalties and structural risk minimization
- Randomized sketches for kernels: fast and optimal nonparametric regression
- Risk bounds in isotonic regression
- Smoothing spline ANOVA models
- Some results on Tchebycheffian spline functions and stochastic processes
- The geometry of hypothesis testing over convex cones: generalized likelihood ratio tests and minimax radii
- The Local Geometry of Testing in Ellipses: Tight Control via Localized Kolmogorov Widths
- The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
- Theory of Reproducing Kernels
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
- Weak convergence and empirical processes. With applications to statistics
Cited in
(2)
This page was built for publication: From Gauss to Kolmogorov: localized measures of complexity for ellipses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199701)
