Skip to main content

A Continuous-Time Iteratively Reweighted Least Squares Algorithm for \(L_\infty \) Estimation

  • Conference paper
  • First Online:
  • 1140 Accesses

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 294))

Abstract

\(L_\infty \) estimation is not part of the traditional canon in applied regression analysis; its use presupposes noise whose distribution has bounded support. However, there are applications where controlling the \(L_\infty \)-norm of residuals is very useful and thus including an \(L_\infty \) penalty on the residuals is warranted. In this paper, we will describe a method for computing such estimates using an iteratively reweighted least squares approach where the weights are defined by differential equations. An application of this method is given for total variation denoising, which is a commonly used method in signal and image processing for preserving sharp discontinuities in the underlying signal.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

Learn about institutional subscriptions

References

  1. Condat, L.: A direct algorithm for 1D total variation denoising. IEEE Signal Process. Lett. 20, 1054–1057 (2013)

    Article  Google Scholar 

  2. Davies, P.L., Kovac, A.: Local extremes, runs, strings and multiresolution (with discussion). Ann. Stat. 29, 1–65 (2001)

    Article  Google Scholar 

  3. Lawson, C.L.: Contributions to the theory of linear least maximum approximation. Doctoral Dissertation, University of California, Los Angeles (1961)

    Google Scholar 

  4. Qin, Z., Goldfarb, D., Ma, S.: An alternating direction method for total variation denoising. Optim. Methods Softw. 30, 594–615 (2015)

    Article  MathSciNet  Google Scholar 

  5. Rice, J.R., Usow, K.H.: The Lawson algorithm and extensions. Math. Comput. 22, 118–127 (1968)

    Article  MathSciNet  Google Scholar 

  6. Rinaldo, A.: Properties and refinements of the fused lasso. Ann. Stat. 37, 2922–2952 (2009)

    Article  MathSciNet  Google Scholar 

  7. Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D: Nonlinear Phenom. 60, 259–268 (1992)

    Article  MathSciNet  Google Scholar 

  8. Selesnick, I.: Total variation denoising (an MM algorithm). NYU Polytechnic School of Engineering Lecture Notes (2012)

    Google Scholar 

  9. Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., Knight, K.: Sparsity and smoothness via the fused lasso. J. R. Stat. Soc.: Ser. B 67, 91–108 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Keith Knight .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Knight, K. (2019). A Continuous-Time Iteratively Reweighted Least Squares Algorithm for \(L_\infty \) Estimation. In: Steland, A., Rafajłowicz, E., Okhrin, O. (eds) Stochastic Models, Statistics and Their Applications. SMSA 2019. Springer Proceedings in Mathematics & Statistics, vol 294. Springer, Cham. https://doi.org/10.1007/978-3-030-28665-1_4

Download citation

Publish with us

Policies and ethics