Active Learning by Learning
Hsuan-Tien Lin
-
Members: FreeCIS
IEEE Members: Free
Non-members: FreeLength: 00:54:21
20 Apr 2021
Abstract:
Active learning is an important technique that helps reduce labeling efforts in machine learning applications. Previously, most active learning strategies are constructed based on some human-designed philosophy; that is, they reflect what human beings assume to be "good labeling questions." However, given that a single human-designed philosophy is unlikely to work on all scenarios, choosing and blending those strategies under different scenarios is an important but challenging practical task. This paper tackles this task by letting the machines adaptively "learn" from the performance of a set of given strategies on a particular data set. More specifically, we design a learning algorithm that connects active learning with the well-known multi-armed bandit problem. Further, we postulate that, given an appropriate choice for the multi-armed bandit learner, it is possible to estimate the performance of different strategies on the fly. Extensive empirical studies of the resulting algorithm confirm that it performs better than strategies that are based on human-designed philosophy. We release an open-source package libact that includes the algorithm to make active learning more realistic for general users.
Biography:
Prof. Hsuan-Tien Lin received a B.S. in Computer Science and Information Engineering from National Taiwan University in 2001, an M.S. and a Ph.D. in Computer Science from California Institute of Technology in 2005 and 2008, respectively. He joined the Department of Computer Science and Information Engineering at National Taiwan University as an assistant professor in 2008, and was promoted to an associate professor in 2012, and has been a professor since August 2017. Between 2016 and 2019, he worked as the Chief Data Scientist of Appier, a startup company that specializes in making AI easier in various domains, such as digital marketing and business intelligence. Currently, he keeps growing with Appier as its Chief Data Science Consultant.
Active learning is an important technique that helps reduce labeling efforts in machine learning applications. Previously, most active learning strategies are constructed based on some human-designed philosophy; that is, they reflect what human beings assume to be "good labeling questions." However, given that a single human-designed philosophy is unlikely to work on all scenarios, choosing and blending those strategies under different scenarios is an important but challenging practical task. This paper tackles this task by letting the machines adaptively "learn" from the performance of a set of given strategies on a particular data set. More specifically, we design a learning algorithm that connects active learning with the well-known multi-armed bandit problem. Further, we postulate that, given an appropriate choice for the multi-armed bandit learner, it is possible to estimate the performance of different strategies on the fly. Extensive empirical studies of the resulting algorithm confirm that it performs better than strategies that are based on human-designed philosophy. We release an open-source package libact that includes the algorithm to make active learning more realistic for general users.
Biography:
Prof. Hsuan-Tien Lin received a B.S. in Computer Science and Information Engineering from National Taiwan University in 2001, an M.S. and a Ph.D. in Computer Science from California Institute of Technology in 2005 and 2008, respectively. He joined the Department of Computer Science and Information Engineering at National Taiwan University as an assistant professor in 2008, and was promoted to an associate professor in 2012, and has been a professor since August 2017. Between 2016 and 2019, he worked as the Chief Data Scientist of Appier, a startup company that specializes in making AI easier in various domains, such as digital marketing and business intelligence. Currently, he keeps growing with Appier as its Chief Data Science Consultant.
