Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T07:53:44.349Z Has data issue: false hasContentIssue false

Convergence of the backfitting algorithm for additive models

Published online by Cambridge University Press:  09 April 2009

Craig F. Ansley
Affiliation:
Department of Accounting and Finance, University of Auckland, Private Bag, Auckland, New Zealand
Robert Kohn
Affiliation:
Australian Graduate School of Management, University of NSW, Kensington, New South Wales, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The backfitting algorithm is an iterative procedure for fitting additive models in which, at each step, one component is estimated keeping the other components fixed, the algorithm proceeding component by component 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 backfitting algorithm when the additive components are estimated by penalized least squares. Our treatment covers spline smoothers and structural time series models, and we give a full discussion of the degenerate case. Our proof is based on Halperin's (1962) generalization of von Neumann's alternating projection theorem.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1994