IDEAS home Printed from https://ideas.repec.org/p/aeg/report/2014-17.html
   My bibliography  Save this paper

A Class of Convergent Parallel Algorithms for SVMs Training

Author

Listed:
  • Andrea Manno

    (Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza")

  • Laura Palagi

    (Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza")

  • Simone Sagratella

    (Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza")

Abstract

The training of Support Vector Machines may be a very difficult task when dealing with very large datasets. The memory requirement and the time consumption of the SVMs algorithms grow rapidly with the increase of the data. To overcome these drawbacks a lot of parallel algorithms have been implemented, but they lack of convergence properties. In this work we propose a generic parallel algorithmic scheme for SVMs and we state its asymptotical global convergence under suitable conditions. We outline how these assumptions can be satisfied in practice and we suggest various specific implementations exploiting the adaptable structure of the algorithmic model.

Suggested Citation

  • Andrea Manno & Laura Palagi & Simone Sagratella, 2014. "A Class of Convergent Parallel Algorithms for SVMs Training," DIAG Technical Reports 2014-17, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    • Handle: RePEc:aeg:report:2014-17
    as

    Download full text from publisher

    File URL: http://www.dis.uniroma1.it/~bibdis/RePEc/aeg/report/2014-17.pdf
    File Function: First version, 2014
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Paul Tseng & Sangwoon Yun, 2010. "A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training," Computational Optimization and Applications, Springer, vol. 47(2), pages 179-206, October.
    2. Giampaolo Liuzzi & Laura Palagi & Mauro Piacentini, 2010. "On the convergence of a Jacobi-type algorithm for Singly Linearly-Constrained Problems Subject to simple Bounds," DIS Technical Reports 2010-01, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    3. Joachims, Thorsten, 1998. "Making large-scale SVM learning practical," Technical Reports 1998,28, Technische Universität Dortmund, Sonderforschungsbereich 475: Komplexitätsreduktion in multivariaten Datenstrukturen.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andrea Manno & Laura Palagi & Simone Sagratella, 2018. "Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training," Computational Optimization and Applications, Springer, vol. 71(1), pages 115-145, September.
    2. Amir Beck, 2014. "The 2-Coordinate Descent Method for Solving Double-Sided Simplex Constrained Minimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 162(3), pages 892-919, September.
    3. Andrea Cristofari, 2019. "An almost cyclic 2-coordinate descent method for singly linearly constrained problems," Computational Optimization and Applications, Springer, vol. 73(2), pages 411-452, June.
    4. Luca Zanni, 2006. "An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines," Computational Management Science, Springer, vol. 3(2), pages 131-145, April.
    5. Peng Han & Xinyue Yang & Yifei Zhao & Xiangmin Guan & Shengjie Wang, 2022. "Quantitative Ground Risk Assessment for Urban Logistical Unmanned Aerial Vehicle (UAV) Based on Bayesian Network," Sustainability, MDPI, vol. 14(9), pages 1-13, May.
    6. Weizhe Gu & Wei-Po Chen & Chun-Hsu Ko & Yuh-Jye Lee & Jein-Shan Chen, 2018. "Two smooth support vector machines for $$\varepsilon $$ ε -insensitive regression," Computational Optimization and Applications, Springer, vol. 70(1), pages 171-199, May.
    7. Andrej Čopar & Blaž Zupan & Marinka Zitnik, 2019. "Fast optimization of non-negative matrix tri-factorization," PLOS ONE, Public Library of Science, vol. 14(6), pages 1-15, June.
    8. Ion Necoara & Andrei Patrascu, 2014. "A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints," Computational Optimization and Applications, Springer, vol. 57(2), pages 307-337, March.
    9. Hoi-Ming Chi & Okan K. Ersoy & Herbert Moskowitz & Kemal Altinkemer, 2007. "Toward Automated Intelligent Manufacturing Systems (AIMS)," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 302-312, May.
    10. Kimon Fountoulakis & Rachael Tappenden, 2018. "A flexible coordinate descent method," Computational Optimization and Applications, Springer, vol. 70(2), pages 351-394, June.
    11. Tianrui Yin & Wei Chen & Bo Liu & Changzhen Li & Luyao Du, 2023. "Light “You Only Look Once”: An Improved Lightweight Vehicle-Detection Model for Intelligent Vehicles under Dark Conditions," Mathematics, MDPI, vol. 12(1), pages 1-19, December.
    12. Härdle, Wolfgang Karl & Prastyo, Dedy Dwi & Hafner, Christian, 2012. "Support vector machines with evolutionary feature selection for default prediction," SFB 649 Discussion Papers 2012-030, Humboldt University Berlin, Collaborative Research Center 649: Economic Risk.
    13. Prabowo, Rudy & Thelwall, Mike, 2009. "Sentiment analysis: A combined approach," Journal of Informetrics, Elsevier, vol. 3(2), pages 143-157.
    14. Fan Wu & Wei Bian, 2020. "Accelerated iterative hard thresholding algorithm for $$l_0$$l0 regularized regression problem," Journal of Global Optimization, Springer, vol. 76(4), pages 819-840, April.
    15. Luminita STATE & Catalina COCIANU & Cristian USCATU & Marinela MIRCEA, 2013. "Extensions of the SVM Method to the Non-Linearly Separable Data," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 17(2), pages 173-182.
    16. C. J. Lin & S. Lucidi & L. Palagi & A. Risi & M. Sciandrone, 2009. "Decomposition Algorithm Model for Singly Linearly-Constrained Problems Subject to Lower and Upper Bounds," Journal of Optimization Theory and Applications, Springer, vol. 141(1), pages 107-126, April.
    17. Tianxiang Liu & Ting Kei Pong, 2017. "Further properties of the forward–backward envelope with applications to difference-of-convex programming," Computational Optimization and Applications, Springer, vol. 67(3), pages 489-520, July.
    18. Wang, Guoliang & Zhu, Zhikang & Zhang, Yande, 2024. "Stabilization of continuous-time Markovian jump systems: A mode separation but optimization method," Applied Mathematics and Computation, Elsevier, vol. 472(C).
    19. Leonardo Galli & Alessandro Galligari & Marco Sciandrone, 2020. "A unified convergence framework for nonmonotone inexact decomposition methods," Computational Optimization and Applications, Springer, vol. 75(1), pages 113-144, January.
    20. Giampaolo Liuzzi & Laura Palagi & Mauro Piacentini, 2010. "On the convergence of a Jacobi-type algorithm for Singly Linearly-Constrained Problems Subject to simple Bounds," DIS Technical Reports 2010-01, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

    More about this item

    Keywords

    Support Vector Machines ; Machine Learning ; Parallel Computing ; Decomposition Techniques ; Huge Data;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:aeg:report:2014-17. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Antonietta Angelica Zucconi (email available below). General contact details of provider: https://edirc.repec.org/data/dirosit.html .

    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.