2000 character limit reached
Discovering General-Purpose Active Learning Strategies (1810.04114v2)
Published 9 Oct 2018 in cs.LG and stat.ML
Abstract: We propose a general-purpose approach to discovering active learning (AL) strategies from data. These strategies are transferable from one domain to another and can be used in conjunction with many machine learning models. To this end, we formalize the annotation process as a Markov decision process, design universal state and action spaces and introduce a new reward function that precisely model the AL objective of minimizing the annotation cost. We seek to find an optimal (non-myopic) AL strategy using reinforcement learning. We evaluate the learned strategies on multiple unrelated domains and show that they consistently outperform state-of-the-art baselines.
- Ksenia Konyushkova (16 papers)
- Raphael Sznitman (60 papers)
- Pascal Fua (176 papers)