Schmidhuber, Jürgen Gagliolo, Matteo 2010-03-24 This thesis presents methods for minimizing the computational effort of problem solving. Rather than looking at a particular algorithm, we consider the issue of computational complexity at a higher level, and propose techniques that, given a set of candidate algorithms, of unknown performance, learn to use these algorithms while solving a sequence of problem instances, with the aim of solving all instances in a minimum time. An analogous meta-level approach to problem solving has been adopted in many different fields, with different aims and terminology. A widely accepted term to describe it is algorithm selection. Algorithm portfolios represent a more general framework, in which computation time is allocated to a set of algorithms running on one or more processors. Automating algorithm selection is an old dream of the AI community, which has been brought closer to reality in the last decade. Most available selection techniques are based on a model of algorithm performance, assumed to be available, or learned during a separate offline training sequence, which is often prohibitively expensive. The model is used to perform a static allocation of resources, with no feedback from the actual execution of the algorithms. There is a trade-off between the performance of model-based selection, and the cost of learning the model. In this thesis, we formulate this trade-off as a bandit problem. We propose GambleTA, a fully dynamic and online algorithm portfolio selection technique, with no separate training phase: all candidate algorithms are run in parallel, while a model incrementally learns their runtime distributions. A redundant set of time allocators uses the partially trained model to optimize machine time shares for the algorithms, in order to minimize runtime. A bandit problem solver picks the allocator to use on each instance, gradually increasing the impact of the best time allocators as the model improves. A similar approach is adopted for learning restart strategies online (GambleR). In both cases, the runtime distributions are modeled using survival analysis techniques; unsuccessful runs are correctly considered as censored runtime observations, allowing to save further computation time. The methods proposed are validated with several experiments, mostly based on data from solver competitions, displaying a robust performance in a variety of settings, and showing that rough performance models already allow to allocate resources efficiently, reducing the risk of wasting computation time. application/pdf https://localhost:5000/ark:/12658/srd1318404 https://susi.usi.ch/global/documents/318404 https://susi.usi.ch/documents/318404/files/2010INFO004.pdf eng info:eu-repo/semantics/altIdentifier/urn/urn:nbn:ch:rero-006-109226 info:eu-repo/semantics/altIdentifier/ark/12658/srd1318404 info:eu-repo/semantics/openAccess License undefined Algorithm selection Algorithm portfolios Restart strategies Meta learning Online learning Multi-armed bandit problem Survival analysis Las Vegas algorithms Computational complexity Combinatorial optimization Constraint programming Satisfiability info:eu-repo/classification/udc/004 Online Dynamic Algorithm Portfolios : minimizing the computational cost of problem solving http://purl.org/coar/resource_type/c_db06