Active Multitask Learning with Committees
Jingxi Xu, Da Tang, Tony Jebara

TL;DR
This paper introduces an active multitask learning algorithm that uses committees to share information across related tasks, reducing labeling costs while maintaining high accuracy.
Contribution
It proposes a novel committee-based approach for active multitask learning that enhances knowledge transfer and reduces annotation efforts.
Findings
Significant reduction in query requests during training
Maintains high test accuracy with fewer labels
Improves performance on benchmark datasets
Abstract
The cost of annotating training data has traditionally been a bottleneck for supervised learning approaches. The problem is further exacerbated when supervised learning is applied to a number of correlated tasks simultaneously since the amount of labels required scales with the number of tasks. To mitigate this concern, we propose an active multitask learning algorithm that achieves knowledge transfer between tasks. The approach forms a so-called committee for each task that jointly makes decisions and directly shares data across similar tasks. Our approach reduces the number of queries needed during training while maintaining high accuracy on test data. Empirical results on benchmark datasets show significant improvements on both accuracy and number of query requests.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Advanced Bandit Algorithms Research · Data Stream Mining Techniques
