IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v56y2013i3p599-617.html
   My bibliography  Save this article

New smoothing SVM algorithm with tight error bound and efficient reduced techniques

Author

Listed:
  • Shuisheng Zhou
  • Jiangtao Cui
  • Feng Ye
  • Hongwei Liu
  • Qiang Zhu

Abstract

The quadratically convergent algorithms for training SVM with smoothing methods are discussed in this paper. By smoothing the objective function of an SVM formulation, Lee and Mangasarian [Comput. Optim. Appl. 20(1):5-22, 2001 ] presented one such algorithm called SSVM and proved that the error bound between the new smooth problem and the original one was $O(\frac{1}{p})$ for large positive smoothing parameter p. We derive a new method by smoothing the optimality conditions of the SVM formulation, and we prove that the error bound is $O(\frac{1}{p^{2}})$ , which is better than Lee and Mangasarian’s result. Based on SMW identity and updating Hessian iteratively, some boosting skills are proposed to solve Newton equation with lower computational complexity for reduced smooth SVM algorithms. Many experimental results show that the proposed smoothing method has the same accuracy as SSVM, whose error bound is also tightened to $O(\frac{1}{p^{2}})$ in this paper, and the proposed boosting skills are efficient for solving large-scale problems by RSVM. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Shuisheng Zhou & Jiangtao Cui & Feng Ye & Hongwei Liu & Qiang Zhu, 2013. "New smoothing SVM algorithm with tight error bound and efficient reduced techniques," Computational Optimization and Applications, Springer, vol. 56(3), pages 599-617, December.
  • Handle: RePEc:spr:coopap:v:56:y:2013:i:3:p:599-617
    DOI: 10.1007/s10589-013-9571-6
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-013-9571-6
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10589-013-9571-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gonghao Duan & Ruiqing Niu, 2018. "Lake Area Analysis Using Exponential Smoothing Model and Long Time-Series Landsat Images in Wuhan, China," Sustainability, MDPI, vol. 10(1), pages 1-16, January.
    2. N. Loukeris & I. Eleftheriadis & E. Livanis, 2016. "The Portfolio Heuristic Optimisation System (PHOS)," Computational Economics, Springer;Society for Computational Economics, vol. 48(4), pages 627-648, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:56:y:2013:i:3:p:599-617. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.