Label Budget Allocation in Multi-Task Learning

• URL: http://arxiv.org/abs/2308.12949v1
• Date: Thu, 24 Aug 2023 17:38:14 GMT
• Title: Label Budget Allocation in Multi-Task Learning
• Abstract summary: In multi-task learning, related tasks provide information to each other and improve overall performance. How should the label budget be allocated among different tasks to achieve optimal multi-task performance? We are the first to propose and formally define the label budget allocation problem in multi-task learning.
• Score: 61.12008399759143
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The cost of labeling data often limits the performance of machine learning systems. In multi-task learning, related tasks provide information to each other and improve overall performance, but the label cost can vary among tasks. How should the label budget (i.e. the amount of money spent on labeling) be allocated among different tasks to achieve optimal multi-task performance? We are the first to propose and formally define the label budget allocation problem in multi-task learning and to empirically show that different budget allocation strategies make a big difference to its performance. We propose a Task-Adaptive Budget Allocation algorithm to robustly generate the optimal budget allocation adaptive to different multi-task learning settings. Specifically, we estimate and then maximize the extent of new information obtained from the allocated budget as a proxy for multi-task learning performance. Experiments on PASCAL VOC and Taskonomy demonstrate the efficacy of our approach over other widely used heuristic labeling strategies.

Related papers

• Instruction Matters: A Simple yet Effective Task Selection for Optimized Instruction Tuning of Specific Tasks [51.15473776489712]
  We introduce a simple yet effective task selection method that leverages instruction information alone to identify relevant tasks. Our method is significantly more efficient than traditional approaches, which require complex measurements of pairwise transferability between tasks or the creation of data samples for the target task. Experimental results demonstrate that training on a small set of tasks, chosen solely on the instructions, results in substantial improvements in performance on benchmarks such as P3, Big-Bench, NIV2, and Big-Bench Hard.
  arXiv  Detail & Related papers  (2024-04-25T08:49:47Z)
• Task Selection and Assignment for Multi-modal Multi-task Dialogue Act Classification with Non-stationary Multi-armed Bandits [11.682678945754837]
  Multi-task learning (MTL) aims to improve the performance of a primary task by jointly learning with related auxiliary tasks. Previous studies suggest that such a random selection of tasks may not be helpful, and can even be harmful to performance. This paper proposes a method for selecting and assigning tasks based on non-stationary multi-armed bandits.
  arXiv  Detail & Related papers  (2023-09-18T14:51:51Z)
• Multi-Task Consistency for Active Learning [18.794331424921946]
  Inconsistency-based active learning has proven to be effective in selecting informative samples for annotation. We propose a novel multi-task active learning strategy for two coupled vision tasks: object detection and semantic segmentation. Our approach achieves 95% of the fully-trained performance using only 67% of the available data.
  arXiv  Detail & Related papers  (2023-06-21T17:34:31Z)
• How to Select Which Active Learning Strategy is Best Suited for Your Specific Problem and Budget [17.62242617965356]
  We propose a practical derivative-based method that dynamically identifies the best strategy for a given budget. We then introduce a method to dynamically select an AL strategy, which takes into account the unique characteristics of the problem and the available budget. Empirical results showcase the effectiveness of our approach across diverse budgets and computer vision tasks.
  arXiv  Detail & Related papers  (2023-06-06T09:44:56Z)
• Multi-Task Differential Privacy Under Distribution Skew [36.770164806995204]
  We study the problem of multi-task learning under user-level differential privacy. One important aspect of the problem, that can significantly impact quality, is the distribution skew among tasks.
  arXiv  Detail & Related papers  (2023-02-15T22:44:43Z)
• Multi-task Bias-Variance Trade-off Through Functional Constraints [102.64082402388192]
  Multi-task learning aims to acquire a set of functions that perform well for diverse tasks. In this paper we draw intuition from the two extreme learning scenarios -- a single function for all tasks, and a task-specific function that ignores the other tasks. We introduce a constrained learning formulation that enforces domain specific solutions to a central function.
  arXiv  Detail & Related papers  (2022-10-27T16:06:47Z)
• Variational Multi-Task Learning with Gumbel-Softmax Priors [105.22406384964144]
  Multi-task learning aims to explore task relatedness to improve individual tasks. We propose variational multi-task learning (VMTL), a general probabilistic inference framework for learning multiple related tasks.
  arXiv  Detail & Related papers  (2021-11-09T18:49:45Z)
• How to distribute data across tasks for meta-learning? [59.608652082495624]
  We show that the optimal number of data points per task depends on the budget, but it converges to a unique constant value for large budgets. Our results suggest a simple and efficient procedure for data collection.
  arXiv  Detail & Related papers  (2021-03-15T15:38:47Z)
• Multi-task Learning by Leveraging the Semantic Information [14.397128692867799]
  We propose to leverage the label information in multi-task learning by exploring the semantic conditional relations among tasks. Our analysis also leads to a concrete algorithm that jointly matches the semantic distribution and controls label distribution divergence.
  arXiv  Detail & Related papers  (2021-03-03T17:36:35Z)
• Small Towers Make Big Differences [59.243296878666285]
  Multi-task learning aims at solving multiple machine learning tasks at the same time. A good solution to a multi-task learning problem should be generalizable in addition to being Pareto optimal. We propose a method of under- parameterized self-auxiliaries for multi-task models to achieve the best of both worlds.
  arXiv  Detail & Related papers  (2020-08-13T10:45:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.