On a conjecture of Huber concerning the convergence of projection pursuit regression
From MaRDI portal
Publication:1115065
DOI10.1214/aos/1176350382zbMath0664.62061OpenAlexW2033519565WikidataQ123142453 ScholiaQ123142453MaRDI QIDQ1115065
Publication date: 1987
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1176350382
Related Items
Results and questions on a nonlinear approximation approach for solving high-dimensional partial differential equations, A SINGLE-INDEX QUANTILE REGRESSION MODEL AND ITS ESTIMATION, Rescaled pure greedy algorithm for Hilbert and Banach spaces, Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm, Convergence of orthogonal greedy algorithm with errors in projectors, Remarks on projection pursuit regression and density estimation, Greedy expansions in Banach spaces, Estimation and hypothesis test for partial linear single-index multiplicative models, Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms, Finite sample behavior of a sieve profile estimator in the single index mode, A convergence rate estimate for remotest projections on three subspaces, Error estimates for orthogonal matching pursuit and random dictionaries, Greedy approximation by arbitrary sets, Model checking for multiplicative linear regression models with mixed estimators, Analysis of the rate of convergence of two regression estimates defined by neural features which are easy to implement, Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces., Alternating projections, remotest projections, and greedy approximation, Realizability of greedy algorithms, Vector greedy algorithms, Integrated conditional moment test for partially linear single index models incorporating dimension-reduction, On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression, Beyond sparsity: recovering structured representations by \({\ell}^1\) minimization and greedy algorithms, On the convergence of greedy algorithms for initial segments of the Haar basis, Analysis of the self projected matching pursuit algorithm, The weak Chebyshev X-greedy algorithm in the unweighted Bergman space, Simultaneous greedy approximation in Banach spaces, Approximation on anisotropic Besov classes with mixed norms by standard information, A counter-example to the general convergence of partially greedy algorithms, Simultaneous approximation by greedy algorithms, On performance of greedy algorithms, Adaptive greedy approximations, Example of divergence of a greedy algorithm with respect to an asymmetric dictionary, Weak convergence of greedy algorithms in Banach spaces, A Semiparametric Approach to Canonical Analysis, The regularized weak functional matching pursuit for linear inverse problems, Harmonic analysis of neural networks, On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1), Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, Local greedy approximation for nonlinear regression and neural network training., Generalized approximate weak greedy algorithms, On universal estimators in learning theory, Application of projection pursuit learning to boundary detection and deblurring in images, Duality gap estimates for a class of greedy optimization algorithms in Banach spaces, Nonlinear approximation by the trigonometric system in weighted \(L_\mu^p\) spaces
