pith. sign in

arxiv: 1102.2818 · v2 · pith:UTDMJYMInew · submitted 2011-02-14 · 🧮 math.ST · stat.TH

Estimating composite functions by model selection

classification 🧮 math.ST stat.TH
keywords functionsapproachcirccompositeestimatingleadsmodelproblem
0
0 comments X
read the original abstract

We consider the problem of estimating a function $s$ on $[-1,1]^{k}$ for large values of $k$ by looking for some best approximation by composite functions of the form $g\circ u$. Our solution is based on model selection and leads to a very general approach to solve this problem with respect to many different types of functions $g,u$ and statistical frameworks. In particular, we handle the problems of approximating $s$ by additive functions, single and multiple index models, neural networks, mixtures of Gaussian densities (when $s$ is a density) among other examples. We also investigate the situation where $s=g\circ u$ for functions $g$ and $u$ belonging to possibly anisotropic smoothness classes. In this case, our approach leads to a completely adaptive estimator with respect to the regularity of $s$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.