Learning dynamic algorithm portfolios

DOI10.1007/S10472-006-9036-ZzbMath1113.68101OpenAlexW2038372264MaRDI QIDQ870809

Matteo Gagliolo, Jürgen Schmidhuber

Publication date: 15 March 2007

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/159132/2/IDSIA-02-07.pdf

zbMATH Keywords

survival analysisonline learningsatisfiabilityalgorithm portfoliosconstraint programmingbandit problemalgorithm selectionexpert advicelife-long learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (12)

Algorithm portfolios for noisy optimization ⋮ SATenstein: automatically building local search SAT solvers from components ⋮ DASH: dynamic approach for switching heuristics ⋮ Towards objective measures of algorithm performance across instance space ⋮ Learning dynamic algorithm portfolios ⋮ aspeed: Solver scheduling via answer set programming ⋮ Algorithm portfolio selection as a bandit problem with unbounded losses ⋮ Optimization of heuristic search using recursive algorithm selection and reinforcement learning ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• A meta-learning method to select the kernel width in support vector regression
• Optimal ordered problem solver
• Learning dynamic algorithm portfolios
• Nonparametric conditional hazard rate estimation: a local linear approach
• Embedding decision-analytic control in a learning architecture
• Principles of metareasoning
• Deliberation scheduling for problem solving in time-constrained environments
• Local search algorithms for SAT: an empirical evaluation
• Unified methods for censored longitudinal data and causality
• An approach to nonparametric regression for life history data using local linear fitting
• Kernel estimation in a nonparametric marker dependent hazard model
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Learning parallel portfolios of algorithms
• Nonparametric Estimation from Incomplete Observations
• Empirical hardness models
• Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
• A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
• The Nonstochastic Multiarmed Bandit Problem
• The Kolmogorov Lecture The Universal Distribution and Machine Learning
• Machine Learning: ECML 2004
• Algorithmic aspects in speech recognition
• Theory and Applications of Satisfiability Testing
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Some aspects of the sequential design of experiments
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004
• Bayesian survival analysis
• Algorithm portfolios
• Monitoring and control of anytime algorithms: A dynamic programming approach
• Estimation of the conditional distribution in regression with censored data: a comparative study.

This page was built for publication: Learning dynamic algorithm portfolios