Abstract
We generalize the projection pursuit procedure of Friedman and Stuetzle (abstract version) and prove strong convergence. This answers a question of Huber.
Keywords
Related Publications
Projection reconstruction MR imaging using FOCUSS
Abstract The focal underdetermined system solver (FOCUSS) was originally designed to obtain sparse solutions by successively solving quadratic optimization problems. This articl...
Projection-Based Approximation and a Duality with Kernel Methods
Projection pursuit regression and kernel regression are methods for estimating a smooth function of several variables from noisy data obtained at scattered sites. Methods based ...
On Sparse Representations in Arbitrary Redundant Bases
The purpose of this contribution is to generalize some recent results on sparse representations of signals in redundant bases. The question that is considered is the following: ...
An Equivalence Between Sparse Approximation and Support Vector Machines
This article shows a relationship between two different approximation techniques: the support vector machines (SVM), proposed by V. Vapnik (1995) and a sparse approximation sche...
Stable recovery of sparse overcomplete representations in the presence of noise
Overcomplete representations are attracting interest in signal processing theory, particularly due to their potential to generate sparse representations of signals. However, in ...
Publication Info
- Year
- 1987
- Type
- article
- Volume
- 15
- Issue
- 2
- Citations
- 187
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1214/aos/1176350382