Academic Journal
On the Robustness of the Successive Projection Algorithm.
| Τίτλος: | On the Robustness of the Successive Projection Algorithm. |
|---|---|
| Συγγραφείς: | Barbarino, Giovanni1 (AUTHOR) giovanni.barbarino@umons.ac.be, Gillis, Nicolas1 (AUTHOR) nicolas.gillis@umons.ac.be |
| Πηγή: | SIAM Journal on Matrix Analysis & Applications. 2025, Vol. 46 Issue 3, p2140-2170. 31p. |
| Θεματικοί όροι: | *Data science, *Fault tolerance (Engineering), *Algorithms, Simplex algorithm, Reproducible research, Robust statistics |
| Περίληψη: | The successive projection algorithm (SPA) is a workhorse algorithm to learn the \(r\) vertices of the convex hull of a set of \((r-1)\) -dimensional data points, a.k.a. a latent simplex, which has numerous applications in data science. In this paper, we revisit the robustness to noise of SPA and several of its variants. In particular, when \(r \geq 3\) , we prove the tightness of the existing error bounds for SPA and for two more robust preconditioned variants of SPA. We also provide significantly improved error bounds for SPA, by a factor proportional to the conditioning of the \(r\) vertices, in two special cases: for the first extracted vertex and when \(r \leq 2\). We then provide further improvements for the error bounds of a translated version of SPA proposed by Arora et al. [Proceedings of the International Conference on Machine Learning, 2013, pp. 280–288] in two special cases: for the first two extracted vertices and when \(r \leq 3\). Finally, we propose a new more robust variant of SPA that first shifts and lifts the data points in order to minimize the conditioning of the problem. We illustrate our results on synthetic data. Reproducibility of computational results. This paper has been awarded the "SIAM Reproducibility Badge: Code and data available" as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at . [ABSTRACT FROM AUTHOR] |
| Copyright of SIAM Journal on Matrix Analysis & Applications is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Business Source Index |
καταχωρήστε σχόλιο πρώτοι!