Bracketing numbers of convex and \(m\)-monotone functions on polytopes
DOI10.1016/j.jat.2020.105425zbMath1439.52009arXiv1506.00034OpenAlexW3018057538WikidataQ114164919 ScholiaQ114164919MaRDI QIDQ2182917
Publication date: 26 May 2020
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.00034
convergence ratesconvex polytopeconvex functionscovering numbersnonparametric estimationbracketing entropyKolmogorov metric entropy
Asymptotic properties of nonparametric inference (62G20) (n)-dimensional polytopes (52B11) Convex functions and convex programs in convex geometry (52A41) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Approximation by convex sets (52A27) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bandwidth selection for kernel density estimators of multivariate level sets and highest density regions
- Global rates of convergence of the MLEs of log-concave and \(s\)-concave densities
- Faithful variable screening for high-dimensional convex regression
- Global rates of convergence in log-concave density estimation
- Quasi-concave density estimation
- Nonparametric estimation of multivariate convex-transformed densities
- Nonparametric least squares estimation of a multivariate convex regression function
- Global risk bounds and adaptation in univariate convex regression
- Multiply monotone functions and their Laplace transforms
- Kolmogorov entropy for classes of convex functions
- Entropy estimate for \(k\)-monotone functions via small ball probability of integrated Brownian motions
- On the rate of convergence of the maximum likelihood estimator of a \(k\)-monotone density
- On triangulations of the convex hull of n points
- Ellipsoids of maximal volume in convex bodies
- epsilon-entropy of convex sets and functions
- Central limit theorems for empirical measures
- Rates of convergence for minimum contrast estimators
- Extremal problems for geometric hypergraphs
- Methods for estimation of convex sets
- Weak convergence and empirical processes. With applications to statistics
- Multivariate extensions of isotonic regression and total variation denoising via entire monotonicity and Hardy-Krause variation
- Estimation of a \(k\)-monotone density: limit distribution theory and the spline connection
- Entropy estimate for high-dimensional monotonic functions
- Covering Numbers for Convex Functions
- Uniform Central Limit Theorems
- Maximum Likelihood Estimation of a Multi-Dimensional Log-Concave Density
- Approximation and regularization of Lipschitz functions: Convergence of the gradients
- Convex Analysis
This page was built for publication: Bracketing numbers of convex and \(m\)-monotone functions on polytopes
