his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Effect Of Network Topology On The Performance Of ADMM-based SVMs
Information Technology, University of Borås, Borås, Sweden.ORCID iD: 0000-0003-0669-9978
Computer Science and Engineering, University of Gothenburg, Gothenburg, Sweden.ORCID iD: -
2018 (English)In: Proceedings 2018 30th International Symposium on Computer Architecture and High Performance Computing SBAC-PAD 2018: Lyon, France 24-27 September 2018, IEEE Computer Society, 2018, p. 388-393Conference paper, Published paper (Other academic)
Abstract [en]

Alternating Direction Method Of Multipliers(ADMM) is one of the promising frameworks for training Support Vector Machines (SVMs) on large-scale data in adistributed manner. In a consensus-based ADMM, nodes may only communicate with one-hop neighbors and this may cause slow convergence. In this paper, we investigate the impact of network topology on the convergence speed of ADMM-basedSVMs using expander graphs. In particular, we investigate how much the expansion property of the network influence the convergence and which topology is preferable. Besides, we supply an implementation making these theoretical advances practically available. The results of the experiments show that graphs with large spectral gaps and higher degrees exhibit accelerated convergence.

Place, publisher, year, edition, pages
IEEE Computer Society, 2018. p. 388-393
Series
International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD), ISSN 1550-6533
Keywords [en]
ADMM, SVMs, Expander Graphs, Distributed Optimization, Convergence
National Category
Engineering and Technology Computer and Information Sciences Information Systems Computer Sciences
Identifiers
URN: urn:nbn:se:his:diva-16555DOI: 10.1109/CAHPC.2018.8645857Scopus ID: 2-s2.0-85063145524ISBN: 978-1-5386-7769-8 (electronic)ISBN: 978-1-5386-7770-4 (print)OAI: oai:DiVA.org:his-16555DiVA, id: diva2:1278480
Conference
High Performance Machine Learning (HPML2018) workshop, September 24, 2018, Lyon, France
Available from: 2019-01-14 Created: 2019-01-14 Last updated: 2019-04-10Bibliographically approved
In thesis
1. High-Performance Computing For Support Vector Machines
Open this publication in new window or tab >>High-Performance Computing For Support Vector Machines
2018 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Machine learning algorithms are very successful in solving classification and regression problems, however the immense amount of data created by digitalization slows down the training and predicting processes, if solvable at all. High-Performance Computing(HPC) and particularly parallel computing are promising tools for improving the performance of machine learning algorithms in terms of time. Support Vector Machines(SVM) is one of the most popular supervised machine learning techniques that enjoy the advancement of HPC to overcome the problems regarding big data, however, efficient parallel implementations of SVM is a complex endeavour. While there are many parallel techniques to facilitate the performance of SVM, there is no clear roadmap for every application scenario. This thesis is based on a collection of publications. It addresses the problems regarding parallel implementations of SVM through four research questions, all of which are answered through three research articles. In the first research question, the thesis investigates important factors such as parallel algorithms, HPC tools, and heuristics on the efficiency of parallel SVM implementation. This leads to identifying the state of the art parallel implementations of SVMs, their pros and cons, and suggests possible avenues for future research. It is up to the user to create a balance between the computation time and the classification accuracy. In the second research question, the thesis explores the impact of changes in problem size, and the value of corresponding SVM parameters that lead to significant performance. This leads to addressing the impact of the problem size on the optimal choice of important parameters. Besides, the thesis shows the existence of a threshold between the number of cores and the training time. In the third research question, the thesis investigates the impact of the network topology on the performance of a network-based SVM. This leads to three key contributions. The first contribution is to show how much the expansion property of the network impact the convergence. The next is to show which network topology is preferable to efficiently use the computing powers. Third is to supply an implementation making the theoretical advances practically available. The results show that graphs with large spectral gaps and higher degrees exhibit accelerated convergence. In the last research question, the thesis combines all contributions in the articles and offers recommendations towards implementing an efficient framework for SVMs regarding large-scale problems.

Place, publisher, year, edition, pages
Skövde: University of Skövde, 2018. p. 115
Series
Dissertation Series ; 26 (2018)
National Category
Computer Sciences
Research subject
Skövde Artificial Intelligence Lab (SAIL); INF301 Data Science
Identifiers
urn:nbn:se:his:diva-16556 (URN)978-91-984187-8-1 (ISBN)
Presentation
2019-01-28, G207, Skövde, 13:15 (English)
Opponent
Supervisors
Available from: 2019-01-22 Created: 2019-01-14 Last updated: 2019-02-14Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Tavara, Shirin

Search in DiVA

By author/editor
Tavara, ShirinSchliep, Alexander
Engineering and TechnologyComputer and Information SciencesInformation SystemsComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 60 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf