Metric entropy of some classes of sets with differentiable boundaries
From MaRDI portal
Publication:2265602
DOI10.1016/0021-9045(74)90120-8zbMATH Open0275.41011OpenAlexW4248484045WikidataQ101069154 ScholiaQ101069154MaRDI QIDQ2265602FDOQ2265602
Authors: Richard M. Dudley
Publication date: 1974
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(74)90120-8
Multidimensional problems (41A63) Convexity of real functions in one variable, generalizations (26A51) Approximation by arbitrary linear expressions (41A45)
Cites Work
Cited In (78)
- Efficient representation in spaces of plane curves
- Set-indexed conditional empirical and quantile processes based on dependent data
- Contraction and expansion of convex sets
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Hausdorff approximation of 3D convex polytopes
- Estimates for the minimal width of polytopes inscribed in convex bodies
- Numerical methods for linear impulse feedback problems
- Umbrellas and polytopal approximation of the Euclidean ball
- Aligning two convex figures to minimize area or perimeter
- Smooth discrimination analysis
- Spikes, broken planes and the approximation of convex fuzzy sets
- Stochastical approximation of convex bodies
- Multipolar robust optimization
- Indexing moving points
- Adaptive estimation of convex polytopes and convex sets from noisy data
- Best and random approximation of a convex body by a polytope
- Convergence rates of generalization errors for margin-based classification
- Low distortion metric embedding into constant dimension
- Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation
- Polytopal approximation of elongated convex bodies
- Probability tails of Gaussian extrema
- Kolmogorov entropy for classes of convex functions
- On two finite covering problems of Bambah, Rogers, Woods and Zassenhaus
- Greedy approximation of characteristic functions
- Weak convergence of an empirical process indexed by the closed convex subsets ofI 2
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- On \(Y M_ 2\) measures and area-preserving diffeomorphisms
- Empirical and Poisson processes on classes of sets or functions too large for central limit theorems
- Über die j-ten Überdeckungsdichten konvexer Körper. (On the j-th covering densities of convex bodies)
- Approximation of convex sets by polytopes
- Accuracy of the approximation of an empirical process by a Brownian bridge
- Optimal aggregation of classifiers in statistical learning.
- Volume approximation of convex bodies by inscribed polytopes
- Covering numbers of \(L_{p}\)-balls of convex functions and sets
- Concentration and goodness-of-fit in higher dimensions: (Asymptotically) distribution-free methods
- epsilon-entropy of convex sets and functions
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
- Central limit theorems for stochastic processes under random entropy conditions
- On the combinatorial complexity of approximating polytopes
- The Haar-function construction of brownian motion indexed by sets
- About the Prohorov distance between the uniform distribution over the unit cube in \(R^ d\) and its empirical measure
- The existence of set-indexed L�vy processes
- Entropy of convex functions on \(\mathbb R^d\)
- On minimum sum of radii and diameters clustering
- Local invariance principles and their application to density estimation
- Invariance principles for sums of Banach space valued random elements and empirical processes
- Simultaneous adaptation to the margin and to complexity in classification
- Triangulating smooth submanifolds with light scaffolding
- A quantitative version of the isoperimetric inequality: the anisotropic case
- Isometries of the space of convex bodies contained in a Euclidean ball
- Approximating a planar convex set using a sparse grid
- Approximate congruence in nearly linear time
- A better approximation for balls
- Correction to metric entropy of some classes of sets with differentiable boundaries
- Approximation of convex bodies by polytopes
- Quantitative combinatorial geometry for continuous parameters
- More flexible curve matching via the partial Fréchet similarity
- Title not available (Why is that?)
- Metric entropy of classes of sets with positive reach
- Spectral clustering based on local linear approximations
- Adaptive sampling for geometric problems over data streams
- Title not available (Why is that?)
- Economical convex coverings and applications
- Stability analysis of a class of sparse optimization problems
- Approximate polytope membership queries
- Spectrahedral Regression
- Optimal non-adaptive approximation of convex bodies by polytopes
- Economical Delone sets for approximating convex bodies
- Approximate convex intersection detection with applications to width and Minkowski sums
- Polytope approximation and the Mahler volume
- Asymptotic geometric analysis: achievements and perspective
- Active-learning a convex body in low dimensions
- Minimax rates for conditional density estimation via empirical entropy
- Optimal convergence rates of deep neural networks in a classification setting
- Epsilon entropy and the packing of balls in Euclidean space
- A deep learning method for pricing high-dimensional American-style options via state-space partition
- Title not available (Why is that?)
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
This page was built for publication: Metric entropy of some classes of sets with differentiable boundaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265602)