Early-Stopping Regularized Least-Squares Classification | SpringerLink
Skip to main content

Early-Stopping Regularized Least-Squares Classification

  • Conference paper
  • First Online:
Advances in Neural Networks – ISNN 2014 (ISNN 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8866))

Included in the following conference series:

Abstract

We study optimization of the regularized least-squares classification algorithm, and proposes an early-stopping training procedure. Different from previous empirical training methods which separate model selection and parameter learning into two stages, the proposed method performs the two processes simultaneously and thus reduces the training time significantly. We carried out a series of evaluations on text categorization tasks. The experimental results verified the effectiveness of our training method, with comparable classification accuracy and significantly improved running speed over conventional training methods.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • Compact, lightweight 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.

Similar content being viewed by others

References

  1. Bishop, C.: Pattern Recognition and Machine Learning. Springer (2008)

    Google Scholar 

  2. Vapnik, V.: Statistical Learning Theory. John Wiley and Sons (1998)

    Google Scholar 

  3. Schölkopf, B., Smola, A.: Learning with Kernels. MIT Press (2002)

    Google Scholar 

  4. Tikhonov, A., Arsenin, V.: Solutions of Ill-Posed Problems. Winston and Sons (1977)

    Google Scholar 

  5. Poggio, T., Girosi, F.: Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks. Science 247, 978–982 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Platt, J.: Fast Training of Support Vector Machines Using Sequential Minimal Optimization. In: Advances in Kernel Methods – Support Vector Learning. MIT Press (1999)

    Google Scholar 

  7. Kimeldorf, G., Wahba, G.: Some Results on Thebycheffian Spline Functions. J. Math. Anal. Appl. 33, 82–95 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  8. Girosi, F., Jones, M., Poggio, T.: Regularization Theory and Neural Networks Architectures. Neural Comput. 7, 219–269 (1995)

    Article  Google Scholar 

  9. Schölkopf, B., Herbrich, R., Smola, A.J.: A Generalized Representer Theorem. In: Helmbold, D.P., Williamson, B. (eds.) COLT 2001 and EuroCOLT 2001. LNCS (LNAI), vol. 2111, pp. 416–426. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Fung, G., Mangasarian, O.: Proximal Support Vector Machine Classifiers. In: Proceedings of KDD 2001 (2001)

    Google Scholar 

  11. Rifkin, R.: Everything Old is New Again: A Fresh Look at Historical Approaches in Machine Learning. PhD thesis. MIT (2002)

    Google Scholar 

  12. Suykens, J., Gestel, T., Brabanter, J., B.D.Moor, Vandewalle, J.: Least Squares Support Vector Machines. World Scientific Publishing (2002)

    Google Scholar 

  13. Golub, G., Loan, C.V.: Matrix Computations. John Hopkins Press (1996)

    Google Scholar 

  14. Engl, H., Hanke, M., Neubauer, A.: Regularization of Inverse Problems. Kluwer Academic Publishers (1996)

    Google Scholar 

  15. Bauer, F., Pereverzev, S., Rosasco, L.: On Regularization Algorithms in Learning Theory. Journal of Complexity 23, 52–72 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Li, W., Lee, K.H., Leung, K.S.: Large-scale RLSC Learning Without Agony. In: Proceedings of the 24th Annual International Conference on Machine Learning, pp. 529–536. ACM (2007)

    Google Scholar 

  17. Sun, X., Pitsianis, N.: A Matrix Version of the Fast Multipole Method. SIAM Review 43, 289–300 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  18. Joachims, T.: Training Linear SVMs in Linear Time. In: Proceedings of SIGKDD 2006. ACM (2006)

    Google Scholar 

  19. Li, W., Lee, K.H., Leung, K.S.: Generalized Regularized Least-Squares Learning with Predefined Features in a Hilbert Space. In: Advances in Neural Information Processing Systems, vol. 19, pp. 881–888. MIT Press (2006)

    Google Scholar 

  20. Li, W., Leung, K.S., Lee, K.H.: Generalizing the Bias Term of Support Vector Machines. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 919–924. AAAI (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenye Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Li, W. (2014). Early-Stopping Regularized Least-Squares Classification. In: Zeng, Z., Li, Y., King, I. (eds) Advances in Neural Networks – ISNN 2014. ISNN 2014. Lecture Notes in Computer Science(), vol 8866. Springer, Cham. https://doi.org/10.1007/978-3-319-12436-0_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12436-0_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12435-3

  • Online ISBN: 978-3-319-12436-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics