- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Theses and Dissertations /
- Advances in meta-algorithmic software libraries for...
Open Collections
UBC Theses and Dissertations
UBC Theses and Dissertations
Advances in meta-algorithmic software libraries for distributed automated algorithm configuration Ramage, Stephen Edward Andrew
Abstract
A meta-algorithmic procedure is a computer procedure that operates upon another algorithm and its associated design space to produce another algorithm with desirable properties (e.g., faster runtime, better solution quality, ...; see e.g., Hoos [2008]). Many meta-algorithmic procedures have runtimes that are dominated by the runtime of the algorithm being operated on. This holds in particular for automatic algorithm configurators, such as ParamILS, SMAC, and GGA, which serve to optimize the design (expressed through user settable parameters) of an algorithm under certain use cases. Consequently, one can gain improved performance of the meta-algorithm if evaluations of the algorithm under study can be done in parallel. In this thesis, we explore a distributed version of the automatic configurator, SMAC, called pSMAC, and the library, AEATK, that it was built upon, which has proved general and versatile enough to support many other meta-algorithmic procedures.
Item Metadata
Title |
Advances in meta-algorithmic software libraries for distributed automated algorithm configuration
|
Creator | |
Publisher |
University of British Columbia
|
Date Issued |
2015
|
Description |
A meta-algorithmic procedure is a computer procedure that operates upon another
algorithm and its associated design space to produce another algorithm with desirable
properties (e.g., faster runtime, better solution quality, ...; see e.g., Hoos [2008]). Many
meta-algorithmic procedures have runtimes that are dominated by the runtime of
the algorithm being operated on. This holds in particular for automatic algorithm
configurators, such as ParamILS, SMAC, and GGA, which serve to optimize the design
(expressed through user settable parameters) of an algorithm under certain use cases.
Consequently, one can gain improved performance of the meta-algorithm if evaluations
of the algorithm under study can be done in parallel. In this thesis, we explore a
distributed version of the automatic configurator, SMAC, called pSMAC, and the
library, AEATK, that it was built upon, which has proved general and versatile enough
to support many other meta-algorithmic procedures.
|
Genre | |
Type | |
Language |
eng
|
Date Available |
2015-04-16
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivs 2.5 Canada
|
DOI |
10.14288/1.0167184
|
URI | |
Degree | |
Program | |
Affiliation | |
Degree Grantor |
University of British Columbia
|
Graduation Date |
2015-05
|
Campus | |
Scholarly Level |
Graduate
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivs 2.5 Canada