Learning robust search strategies using a bandit-based approach

25Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

Effective solving of constraint problems often requires choosing good or specific search heuristics. However, choosing or designing a good search heuristic is non-trivial and is often a manual process. In this paper, rather than manually choosing/designing search heuristics, we propose the use of bandit-based learning techniques to automatically select search heuristics. Our approach is online where the solver learns and selects from a set of heuristics during search. The goal is to obtain automatic search heuristics which give robust performance. Preliminary experiments show that our adaptive technique is more robust than the original search heuristics. It can also outperform the original heuristics.

Cite

CITATION STYLE

APA

Xia, W., & Yap, R. H. C. (2018). Learning robust search strategies using a bandit-based approach. In 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 (pp. 6657–6664). AAAI press. https://doi.org/10.1609/aaai.v32i1.12211

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free