Methods for Estimation of Convex Sets

@article{Brunel2018MethodsFE,
  title={Methods for Estimation of Convex Sets},
  author={Victor-Emmanuel Brunel},
  journal={Statistical Science},
  year={2018}
}
In the framework of shape constrained estimation, we review methods and works done in convex set estimation. Some methods are standard in statistics, coming especially from the theory of empirical processes, but we more geometric methods that are specific to convex set estimation. The statistical problems that we review include density support estimation, estimation of the level sets of densities or depth functions, nonparametric regression, etc. We focus on the estimation of convex sets under… 
High-dimensional nonparametric density estimation via symmetry and shape constraints
TLDR
This work proves that the estimator is adaptive in the sense that if the data generating density admits a special form, then a nearly parametric rate may be attained and provides worst-case and adaptive risk bounds in cases where $K$ is only known up to a positive definite transformation, and where it is completely unknown and must be estimated nonparametrically.
Editorial: Special Issue on “Nonparametric Inference Under Shape Constraints”
Shape-constrained inference usually refers to nonparametric function estimation and uncertainty quantification under qualitative shape restrictions such as monotonicity, convexity, log-concavity and
Bracketing numbers of convex and m-monotone functions on polytopes
A scalable estimator of sets of integral operators
TLDR
This work proposes a scalable method to find a subspace of low-rank tensors that simultaneously approximates a set of integral operators that can be seen as a generalization of tensor decomposition models.
Cube Root Weak Convergence of Empirical Estimators of a Density Level Set
Given $n$ independent random vectors with common density $f$ on $\mathbb{R}^d$, we study the weak convergence of three empirical-measure based estimators of the convex $\lambda$-level set $L_\lambda$
On Statistical Learning of Simplices: Unmixing Problem Revisited
TLDR
It is theoretically shown that a sufficient sample complexity for reliable learning of a high-dimensional simplex up to a total-variation error of $\epsilon$ is O\left(\frac{K^2}{\ep silon}\log\frac{ K}{\ epsilon}\right)$, which yields a substantial improvement over existing bounds.
Near-optimal sample complexity bounds for learning Latent k-polytopes and applications to Ad-Mixtures
TLDR
O∗ (dk/m) samples are sufficient to learn each of k− topic vectors of LDA, a popular Ad-mixture model, with vocabulary size d and m ∈ Ω(1) words per document, to any constant error in L1 norm, which is the first sample complexity upper bound for the problem of learning the vertices of a Latent k− Polytope in Rd.
A scalable estimator of space varying blurs Application in super-resolution
TLDR
A scalable method to find a low dimensional subspace of spatially varying blur operators, given a set of noisy observations, and how to use this subspace estimator to train deep learning architectures for solving super-resolution problems in single molecule localization microscope is proposed.

References

SHOWING 1-10 OF 107 REFERENCES
Unbiased estimation of the volume of a convex body
On nonparametric estimation of density level sets
Let X 1 ,...,X n be independent identically distributed observations from an unknown probability density f(.). Consider the problem of estimating the level set G = G f (λ) = {x ∈ R 2 : f(x) ≥ λ} from
Non parametric estimation of convex bodies and convex polytopes
In this thesis, we are interested in statistical inference on convex bodies in the Euclidean space $\R^d$. Two models are investigated. The first one consists of the observation of $n$ independent
Adaptive estimation of convex and polytopal density support
We estimate the support of a uniform density, when it is assumed to be a convex polytope or, more generally, a convex body in $${\mathbb {R}}^d$$Rd. In the polytopal case, we construct an estimator
Asymptotical minimax recovery of sets with smooth boundaries
In this paper optimal rates of convergence are derived for estimates of sets in N-dimensional black and white pictures under smoothness conditions. It is assumed that the boundaries of the black
Set estimation: another bridge between statistics and geometry
Set estimation has to do with the statistical reconstruction of sets from random set of points. This theory is closely related with nonparametric functional estimation as well as with stochastic
Convergence of algorithms for reconstructing convex bodies and directional measures
We investigate algorithms for reconstructing a convex body K in R n from noisy measurements of its support function or its brightness function in k directions u 1 ,..., u k . The key idea of these
Adaptive estimation of convex polytopes and convex sets from noisy data
: We estimate convex polytopes and general convex sets in R d , d ≥ 2 in the regression framework. We measure the risk of our estimators using a L 1 -type loss function and prove upper bounds on
On Statistical Properties of Sets Fulfilling Rolling-Type Conditions
Motivated by set estimation problems, we consider three closely related shape conditions for compact sets: positive reach, r-convexity, and the rolling condition. First, the relations between these
...
...