Skip to main content

An Adaptive Algorithm for Quantile Regression

  • Conference paper
Theory and Applications of Recent Robust Methods

Part of the book series: Statistics for Industry and Technology ((SIT))

Abstract

In this article, we introduce an algorithm to compute the regression quantile functions. This algorithm combines three algorithms — the simplex, interior point, and smoothing algorithm. The simplex and interior point algorithms come from the background of linear programming (Portnoy and Koenker, 1997). While the simplex method can handle small to middle sized data sets, the interior point method can handle large to huge data sets efficiently. The smoothing algorithm is specially designed for the L 1 or quantile regression type of problems (Chen, 2002), and it outperforms the other two algorithms for fat data sets. Combining these three algorithms produces an algorithm, which is adaptive in the sense that it can intelligently detect the input data sets and select one of the three algorithms to efficiently compute the regression quantile functions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Barrodale and F. D. K. Roberts, An Improved Algorithm for Discrete l 1 Linear Approximation. SIAM J. Numer. Anal. 10 (1973), 839–848.

    Article  MathSciNet  MATH  Google Scholar 

  2. D. I. Clark and M. R. Osborne, Finite Algorithms for Huber’s M-estimator. SIAM J. Sci. Statist. Comput. 6 (1986), 72–85.

    MathSciNet  Google Scholar 

  3. C. Chen, A Finite Smoothing Algorithm for Quantile Regression. Submitted, 2002.

    Google Scholar 

  4. P. J. Huber, Robust Statistics. John Wiley & Sons, New York, 1981.

    Book  MATH  Google Scholar 

  5. N. Karmarkar, A New Polynomial-time Algorithm for Linear Programming. Combinatorica 4 (1984), 373–395.

    Article  MathSciNet  MATH  Google Scholar 

  6. R. Koenker and G. Bassett, Jr, Regression Quantiles. Econometrica 46 (1978), 33–50.

    Article  MathSciNet  MATH  Google Scholar 

  7. R. Koenker and V. d’Orey, Computing Regression Quantiles. Appl. Statist. 43 (1993), 410–414.

    Article  Google Scholar 

  8. K. Madsen and H. B. Nielsen, A Finite Smoothing Algorithm for Linear L 1 Estimation. SIAM J. Optim. 3 (1993), 223–235.

    Article  MathSciNet  MATH  Google Scholar 

  9. S. Portnoy and R. Koenker, The Gaussian Hare and the Laplacian Tortoise: Computation of Squared-error vs. Absolute-error Estimators. Statist. Sci. 12 (1997), 279–300.

    Article  MathSciNet  MATH  Google Scholar 

  10. S. J. Wright, Primal-Dual Interior Point Algorithms. SIAM, Philadelphia, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Basel AG

About this paper

Cite this paper

Chen, C. (2004). An Adaptive Algorithm for Quantile Regression. In: Hubert, M., Pison, G., Struyf, A., Van Aelst, S. (eds) Theory and Applications of Recent Robust Methods. Statistics for Industry and Technology. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7958-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-7958-3_4

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9636-8

  • Online ISBN: 978-3-0348-7958-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics