CONVERGENCE OF THE BACKFITTING ALGORITHM FOR ADDITIVE-MODELS

Authors
Citation
Cf. Ansley et R. Kohn, CONVERGENCE OF THE BACKFITTING ALGORITHM FOR ADDITIVE-MODELS, Journal of the Australian Mathematical Society. Series A. Pure mathematics and statistics, 57, 1994, pp. 316-329
Citations number
15
Categorie Soggetti
Mathematics, General","Statistic & Probability",Mathematics,"Statistic & Probability
ISSN journal
02636115
Volume
57
Year of publication
1994
Part
3
Pages
316 - 329
Database
ISI
SICI code
0263-6115(1994)57:<316:COTBAF>2.0.ZU;2-V
Abstract
The backfitting algorithm is an iterative procedure for fitting additi ve models in which, at each step, one component is estimated keeping t he other components fixed, the algorithm proceeding component by compo nent and iterating until convergence. Convergence of the algorithm has been studied by Buja, Hastie, and Tibshirani (1989). We give a simple , but more general, geometric proof of the convergence of the backfitt ing algorithm when the additive components are estimated by penalized least squares. Our treatment covers spline smoothers and structural ti me series models, and we give a full discussion of the degenerate case . Our proof is based on Halperin's (1962) generalization of von Neuman n's alternating projection theorem.