Iteratively reweighted least squares

Part of a series on

Regression analysis
Models

* Linear regression
* Simple regression
* Polynomial regression
* General linear model

* Generalized linear model
* Discrete choice
* Binomial regression
* Binary regression
* Logistic regression
* Multinomial logit
* Mixed logit
* Probit
* Multinomial probit
* Ordered logit
* Ordered probit
* Poisson

* Multilevel model
* Fixed effects
* Random effects
* Linear mixed-effects model
* Nonlinear mixed-effects model

* Nonlinear regression
* Nonparametric
* Semiparametric
* Robust
* Quantile
* Isotonic
* Principal components
* Least angle
* Local
* Segmented

* Errors-in-variables

Estimation

* Least squares
* Linear
* Non-linear

* Ordinary
* Weighted
* Generalized

* Partial
* Total
* Non-negative
* Ridge regression
* Regularized

* Least absolute deviations
* Iteratively reweighted
* Bayesian
* Bayesian multivariate

Background

* Regression validation
* Mean and predicted response
* Errors and residuals
* Goodness of fit
* Studentized residual
* Gauss–Markov theorem

* v
* t
* e

The method of iteratively reweighted least squares (IRLS) is used to solve certain optimization problems with objective functions of the form of a p-norm:

[math]\displaystyle{ \mathop{\operatorname{arg\,min}}_{\boldsymbol\beta} \sum_{i=1}^n \big| y_i - f_i (\boldsymbol\beta) \big|^p, }[/math]

by an iterative method in which each step involves solving a weighted least squares problem of the form:[1]

[math]\displaystyle{ \boldsymbol\beta^{(t+1)} = \underset{\boldsymbol\beta} {\operatorname{arg\,min}} \sum_{i=1}^n w_i (\boldsymbol\beta^{(t)}) \big| y_i - f_i (\boldsymbol\beta) \big|^2. }[/math]

IRLS is used to find the maximum likelihood estimates of a generalized linear model, and in robust regression to find an M-estimator, as a way of mitigating the influence of outliers in an otherwise normally-distributed data set, for example, by minimizing the least absolute errors rather than the least square errors.

One of the advantages of IRLS over linear programming and convex programming is that it can be used with Gauss–Newton and Levenberg–Marquardt numerical algorithms.

## Contents

* 1 Examples
* 1.1 L1 minimization for sparse recovery
* 2 See also
* 3 Notes
* 4 References
* 5 External links

## Examples

### L1 minimization for sparse recovery

IRLS can be used for ℓ1 minimization and smoothed ℓp minimization, p < 1, in compressed sensing problems. It has been proved that the algorithm has a linear rate of convergence for ℓ1 norm and superlinear for ℓt with t < 1, under the restricted isometry property, which is generally a sufficient condition for sparse solutions.Cite error: Closing `</ref>` missing for `<ref>` tag

[math]\displaystyle{ \boldsymbol\beta^{(t+1)} = \underset{\boldsymbol\beta}{ \operatorname{arg\,min} } \sum_{i=1}^n w_i^{(t)} \left| y_i - X_i \boldsymbol\beta \right|^2 = (X^{\rm T} W^{(t)} X)^{-1} X^{\rm T} W^{(t)} \mathbf{y}, }[/math]

where W(t) is the diagonal matrix of weights, usually with all elements set initially to:

[math]\displaystyle{ w_i^{(0)} = 1 }[/math]

and updated after each iteration to:

[math]\displaystyle{ w_i^{(t)} = \big|y_i - X_i \boldsymbol \beta ^{(t)} \big|^{p-2}. }[/math]

In the case p = 1, this corresponds to least absolute deviation regression (in this case, the problem would be better approached by use of linear programming methods,[2] so the result would be exact) and the formula is:

[math]\displaystyle{ w_i^{(t)} = \frac{1}{\big|y_i - X_i \boldsymbol \beta ^{(t)} \big|}. }[/math]

To avoid dividing by zero, regularization must be done, so in practice the formula is:

[math]\displaystyle{ w_i^{(t)} = \frac 1 {\max\left\\{\delta, \left|y_i - X_i \boldsymbol \beta ^{(t)} \right|\right\\} }. }[/math]

where [math]\displaystyle{ \delta }[/math] is some small value, like 0.0001.[2] Note the use of [math]\displaystyle{ \delta }[/math] in the weighting function is equivalent to the Huber loss function in robust estimation. [3]

## See also

* Feasible generalized least squares
* Weiszfeld's algorithm (for approximating the geometric median), which can be viewed as a special case of IRLS

## Notes

1. ↑ C. Sidney Burrus, Iterative Reweighted Least Squares
2. ↑ 2.0 2.1 William A. Pfeil, Statistical Teaching Aids, Bachelor of Science thesis, Worcester Polytechnic Institute, 2006
3. ↑ Fox, J.; Weisberg, S. (2013),Robust Regression, Course Notes, University of Minnesota

## References

* Numerical Methods for Least Squares Problems by Åke Björck (Chapter 4: Generalized Least Squares Problems.)
* Practical Least-Squares for Computer Graphics. SIGGRAPH Course 11

## External links

* Solve under-determined linear systems iteratively

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Iteratively reweighted least squares. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Iteratively_reweighted_least_squares&oldid=3148624"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template