Dual SVM Training on a Budget

Sahar Qaadan; Merlin Schüler; Tobias Glasmachers

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Dual SVM Training on a Budget

Topics: Classification and Clustering; Machine Learning Methods

In Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods ICPRAM - Volume 1, 94-106, 2019 , Prague, Czech Republic

Authors: Sahar Qaadan ; Merlin Schüler and Tobias Glasmachers

Affiliation: Department of Neural Computing, Ruhr University Bochum, 44801, Bochum and Germany

Keyword(s): Dual Subspace Algorithm, Kernel SVM, Budget Maintenance, Merging Method.

Abstract: We present a dual subspace ascent algorithm for support vector machine training that respects a budget constraint limiting the number of support vectors. Budget methods are effective for reducing the training time of kernel SVM while retaining high accuracy. To date, budget training is available only for primal (SGD-based) solvers. Dual subspace ascent methods like sequential minimal optimization are attractive for their good adaptation to the problem structure, their fast convergence rate, and their practical speed. By incorporating a budget constraint into a dual algorithm, our method enjoys the best of both worlds. We demonstrate considerable speed-ups over primal budget training methods.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.144.221.151

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Qaadan, S., Schüler, M. and Glasmachers, T. (2019). Dual SVM Training on a Budget. In Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods - ICPRAM; ISBN 978-989-758-351-3; ISSN 2184-4313, SciTePress, pages 94-106. DOI: 10.5220/0007346400940106

@conference{icpram19,
author={Sahar Qaadan and Merlin Schüler and Tobias Glasmachers},
title={Dual SVM Training on a Budget},
booktitle={Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods - ICPRAM},
year={2019},
pages={94-106},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007346400940106},
isbn={978-989-758-351-3},
issn={2184-4313},
}

TY - CONF

JO - Proceedings of the 8th International Conference on Pattern Recognition Applications and Methods - ICPRAM
TI - Dual SVM Training on a Budget
SN - 978-989-758-351-3
IS - 2184-4313
AU - Qaadan, S.
AU - Schüler, M.
AU - Glasmachers, T.
PY - 2019
SP - 94
EP - 106
DO - 10.5220/0007346400940106
PB - SciTePress