Timezone: »
Active search is a learning paradigm where we seek to identify as many members of a rare, valuable class as possible given a labeling budget. Previous work on active search has assumed access to a faithful (and expensive) oracle reporting experimental results. However, some settings offer access to cheaper surrogates such as computational simulation that may aid in the search. We propose a model of multifidelity active search, as well as a novel, computationally efficient policy for this setting that is motivated by state-of-the-art classical policies. Our policy is nonmyopic and budget aware, allowing for a dynamic tradeoff between exploration and exploitation. We evaluate the performance of our solution on real-world datasets and demonstrate significantly better performance than natural benchmarks.
Author Information
Quan Nguyen (Washington University in St. Louis)
Arghavan Modiri (University of Toronto)
Roman Garnett (Washington University in St. Louis)
Related Events (a corresponding poster, oral, or spotlight)
-
2021 Poster: Nonmyopic Multifidelity Acitve Search »
Thu. Jul 22nd 04:00 -- 06:00 PM Room
More from the Same Authors
-
2020 Poster: BINOCULARS for efficient, nonmyopic sequential experimental design »
Shali Jiang · Henry Chai · Javier Gonzalez · Roman Garnett -
2019 Poster: Automated Model Selection with Bayesian Quadrature »
Henry Chai · Jean-Francois Ton · Michael A Osborne · Roman Garnett -
2019 Oral: Automated Model Selection with Bayesian Quadrature »
Henry Chai · Jean-Francois Ton · Michael A Osborne · Roman Garnett -
2017 Workshop: Automatic Machine Learning (AutoML 2017) »
Joaquin Vanschoren · Roman Garnett -
2017 Poster: Efficient Nonmyopic Active Search »
Shali Jiang · Luiz Gustavo Malkomes · Geoff Converse · Alyssa Shofner · Benjamin Moseley · Roman Garnett -
2017 Talk: Efficient Nonmyopic Active Search »
Shali Jiang · Luiz Gustavo Malkomes · Geoff Converse · Alyssa Shofner · Benjamin Moseley · Roman Garnett