Towards distributed algorithm portfolios

Matteo Gagliolo; Jürgen Schmidhuber

doi:10.1007/978-3-540-85863-8_75

Towards distributed algorithm portfolios

Matteo Gagliolo, Jürgen Schmidhuber

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

Abstract

In recent work we have developed an online algorithm selection technique, in which a model of algorithm performance is learned incrementally while being used. The resulting exploration-exploitation trade-off is solved as a bandit problem. The candidate solvers are run in parallel on a single machine, as an algorithm portfolio, and computation time is shared among them according to their expected performances. In this paper, we extend our technique to the more interesting and practical case of multiple CPUs. © 2009 Springer-Verlag Berlin Heidelberg.

Original language	English (US)
Title of host publication	Advances in Soft Computing
Pages	634-643
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-540-85863-8_75
State	Published - Jan 9 2009
Externally published	Yes

ASJC Scopus subject areas

Computational Mechanics
Computer Science (miscellaneous)
Computer Science Applications

Access to Document

10.1007/978-3-540-85863-8_75

Cite this

@inproceedings{a61d34698b4c4286a662199ea6cd4ffb,

title = "Towards distributed algorithm portfolios",

abstract = "In recent work we have developed an online algorithm selection technique, in which a model of algorithm performance is learned incrementally while being used. The resulting exploration-exploitation trade-off is solved as a bandit problem. The candidate solvers are run in parallel on a single machine, as an algorithm portfolio, and computation time is shared among them according to their expected performances. In this paper, we extend our technique to the more interesting and practical case of multiple CPUs. {\textcopyright} 2009 Springer-Verlag Berlin Heidelberg.",

author = "Matteo Gagliolo and J{\"u}rgen Schmidhuber",

note = "Generated from Scopus record by KAUST IRTS on 2022-09-14",

year = "2009",

month = jan,

day = "9",

doi = "10.1007/978-3-540-85863-8_75",

language = "English (US)",

isbn = "9783540858621",

pages = "634--643",

booktitle = "Advances in Soft Computing",

}

TY - GEN

T1 - Towards distributed algorithm portfolios

AU - Gagliolo, Matteo

AU - Schmidhuber, Jürgen

N1 - Generated from Scopus record by KAUST IRTS on 2022-09-14

PY - 2009/1/9

Y1 - 2009/1/9

N2 - In recent work we have developed an online algorithm selection technique, in which a model of algorithm performance is learned incrementally while being used. The resulting exploration-exploitation trade-off is solved as a bandit problem. The candidate solvers are run in parallel on a single machine, as an algorithm portfolio, and computation time is shared among them according to their expected performances. In this paper, we extend our technique to the more interesting and practical case of multiple CPUs. © 2009 Springer-Verlag Berlin Heidelberg.

AB - In recent work we have developed an online algorithm selection technique, in which a model of algorithm performance is learned incrementally while being used. The resulting exploration-exploitation trade-off is solved as a bandit problem. The candidate solvers are run in parallel on a single machine, as an algorithm portfolio, and computation time is shared among them according to their expected performances. In this paper, we extend our technique to the more interesting and practical case of multiple CPUs. © 2009 Springer-Verlag Berlin Heidelberg.

UR - http://link.springer.com/10.1007/978-3-540-85863-8_75

UR - http://www.scopus.com/inward/record.url?scp=58149185412&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85863-8_75

DO - 10.1007/978-3-540-85863-8_75

M3 - Conference contribution

SN - 9783540858621

SP - 634

EP - 643

BT - Advances in Soft Computing

ER -

Towards distributed algorithm portfolios

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this