Isotonic regression

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In numerical analysis, isotonic regression (IR) involves finding a weighted least-squares fit x\in \Bbb{R}^n to a vector a\in \Bbb{R}^n with weights vector w\in \Bbb{R}^n subject to a set of monotonicity constraints giving a simple or partial order over the variables. The monotonicity constraints define a directed acyclic graph G = (C,P) over the nodes N={1,2,\ldots,n} corresponding to the variables x={x_1,x_2,\ldots,x_n}. Thus, the IR problem where a simple order is defined corresponds to the following quadratic program (QP):

\min \sum_{i=1}^n w_i (x_i - a_i)^2 \mathrm{subject~to~}x_i\ge x_j~ \text{ for all } (i,j)\in E.

In the case when G = (N,E) is a total order, a simple iterative algorithm for solving this QP is called the pool adjacent violators algorithm (PAVA). Best and Chakravarti (1990)[1] have studied the problem as an active set identification problem, and have proposed a primal algorithm in O(n), the same complexity as the PAVA, which can be seen as a dual algorithm.

IR has applications in statistical inference, for example, computing the cost at the minimum of the above goal function, gives the "stress" of the fit of an isotonic curve to mean experimental results when an order is expected.

Another application is nonmetric multidimensional scaling (Kruskal, 1964), where a low-dimensional embedding for data points is sought such that order of distances between points in the embedding matches order of dissimilarity between points. Isotonic regression is used iteratively to fit ideal distances to preserve relative dissimilarity order.

Isotonic regression is also sometimes referred to as monotonic regression. Correctly speaking, isotonic is used when the direction of the trend is strictly increasing, while monotonic could imply a trend that is either strictly increasing or strictly decreasing.

Isotonic Regression under the Lp for p > 0 is defined as follows:

\min \sum_{i=1}^n w_i |x_i - a_i|^p \mathrm{subject~to~}x_i\ge x_j~ \text{ for all } (i,j)\in E.

[edit] Simply ordered case

To illustrate the above, let x_1 \leq x_2 \leq \ldots \leq x_n, and f(x_1) \leq f(x_2) \leq \ldots \leq f(x_n), and w_i \geq 0 .

The isotonic estimator, g * , minimizes the weighted least squares-like condition:

\min_g \sum_{i=1}^n w_i (g(x_i) - f(x_i))^2

Where g is the unknown function we are estimating, and f is a known function.

Software has been developed in the R statistical package for computing isotone (monotonic) regression.[2]

[edit] References

  1. ^ Best, M.J.; & Chakravarti N. (1990). "Active set algorithms for isotonic regression; a unifying framework". Mathematical Programming 47: 425–439. doi:10.1007/BF01580873. 
  2. ^ De Leeuw, Jan; K. Hornik, P. Mair (2009). "Isotone Optimization in R: Pool-Adjacent-Violators Algorithm (PAVA) and Active Set Methods". Journal of statistical software 32 (5): 1. 
  • Robertson, T.; Wright, F.T.; & Dykstra, R.L. (1988). Order restricted statistical inference. New York: Wiley, 1988. ISBN 0-471-91787-7
  • Barlow, R. E.; Bartholomew, D.J.; Bremner, J. M.; & Brunk, H. D. (1972). Statistical inference under order restrictions; the theory and application of isotonic regression. New York: Wiley, 1972. ISBN 0-471-04970-0.
  • Shively, T.S., Sager, T.W., Walker, S.G. (2009). "A Bayesian approach to non-parametric monotone function estimation". J.R.Statist.Soc. B 71 (1): 159–175. doi:10.1111/j.1467-9868.2008.00677.x. 
  • Wu, W. B.; Woodroofe, M.; & Mentz, G. (2001). "Isotonic regression: Another look at the changepoint problem". Biometrika 88 (3): 793–804. doi:10.1093/biomet/88.3.793. 
Personal tools
Namespaces
Variants
Actions
Navigation
Interaction
Toolbox
Print/export
Languages