Almost surely consistent nonparametric regression from recursive partitioning schemes (Q795439)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Almost surely consistent nonparametric regression from recursive partitioning schemes
scientific article

    Statements

    Almost surely consistent nonparametric regression from recursive partitioning schemes (English)
    0 references
    0 references
    0 references
    1984
    0 references
    The authors investigate the almost sure convergence of within box means estimators of a regression function \(h(x)={\mathbb{E}}(Y| X=x)\) under a weak moment assumption on Y. For sample size n, the boxes form a finite partition \(Q^{(n)}\) of the X-space generated by a learning sample \((X_ 1,Y_ 1),...,(X_ n,Y_ n)\) such that \(Q^{(n+1)}\) is a refinement of \(Q^{(n)}\). The method of proof uses martingale arguments and sharp bounds for the deviation between the empirical and the true distribution uniformly over boxes.
    0 references
    recursive partitioning schemes
    0 references
    almost sure convergence
    0 references
    within box means estimators
    0 references
    regression function
    0 references
    martingale arguments
    0 references

    Identifiers