Remarks on projection pursuit regression and density estimation
From MaRDI portal
Publication:4005831
DOI10.1080/07362999208809264zbMath0763.62034OpenAlexW1980165899MaRDI QIDQ4005831
Gilbert G. Walter, Lídia Rejtő
Publication date: 27 September 1992
Published in: Stochastic Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07362999208809264
strong convergenceSobolev spacesHilbert spacedensity approximationalmost greedy algorithmgeneralization of the projection pursuit regression algorithm
Related Items (9)
Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm ⋮ Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms ⋮ Convergence of the weak dual greedy algorithm in \(L_{p}\)-spaces. ⋮ Vector greedy algorithms ⋮ The weak Chebyshev X-greedy algorithm in the unweighted Bergman space ⋮ A counter-example to the general convergence of partially greedy algorithms ⋮ Simultaneous approximation by greedy algorithms ⋮ Local greedy approximation for nonlinear regression and neural network training. ⋮ Generalized approximate weak greedy algorithms
Cites Work
This page was built for publication: Remarks on projection pursuit regression and density estimation