CAAL: Contextual Bandits based Online Hand-Craft Active Learning Strategy Selection

• URL: http://arxiv.org/abs/2606.07910v1
• Date: Sat, 06 Jun 2026 00:20:11 GMT
• Title: CAAL: Contextual Bandits based Online Hand-Craft Active Learning Strategy Selection
• Abstract summary: We introduce Contextual Adaptive Active Learning (CAAL)<n>In CAAL, each "arm" represents a hand-crafted strategy.<n>We experimentally show that CAAL outperforms the existing baseline adaptive strategy on public datasets.
• Score: 1.3187061540651615
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The challenge with active learning algorithms is the uncertainty of the statistical distribution of unlabeled data, making it difficult to choose the best hand-crafted strategy. To address this, we introduced Contextual Adaptive Active Learning (CAAL). In CAAL, each "arm" represents a hand-crafted strategy. Unlike existing frameworks that select strategies based only on feedback from labeled data, we dynamically choose strategies for labeling batches of data using reward prediction with external context information. This general framework allows for customization with domain knowledge to design more effective rewards and context candidates. In addition, we experimentally show that CAAL outperforms the existing baseline adaptive strategy on public datasets using our reward and context design. Our results are consistent regardless of batch size in each iteration.

Related papers

• Strategic Feature Selection [62.74494413516484]
  We study strategic classification through feature selection and its interaction with ridge regularization.<n>We provide a fine-grained characterization of the performance of a feature subset under optimal regularization.<n>Motivated by this characterization, we develop a practical algorithm for jointly choosing the feature set and the level of ridge regularization.
  arXiv  Detail & Related papers  (2026-06-17T09:47:15Z)
• Automating aggregation strategy selection in federated learning [0.0]
  We present an end-to-end framework that automates, streamlines, and adapts aggregation strategy selection for federated learning.<n>Our approach enhances robustness and generalisation under non-IID conditions while reducing the need for manual intervention.
  arXiv  Detail & Related papers  (2026-04-09T10:08:28Z)
• Strategy Executability in Mathematical Reasoning: Leveraging Human-Model Differences for Effective Guidance [86.46794021499511]
  We show a previously underexplored gap between strategy usage and strategy executability.<n>We propose Selective Strategy Retrieval (SSR), a test-time framework that explicitly models executability.<n> SSR yields reliable and consistent improvements over direct solving, in-context learning, and single-source guidance.
  arXiv  Detail & Related papers  (2026-02-26T03:34:23Z)
• Plan before Solving: Problem-Aware Strategy Routing for Mathematical Reasoning with LLMs [49.995906301946]
  Existing methods usually leverage a fixed strategy to guide Large Language Models (LLMs) to perform mathematical reasoning.<n>Our analysis reveals that the single strategy cannot adapt to problem-specific requirements and thus overlooks the trade-off between effectiveness and efficiency.<n>We propose Planning and Routing through Instance-Specific Modeling (PRISM), a novel framework that decouples mathematical reasoning into two stages: strategy planning and targeted execution.
  arXiv  Detail & Related papers  (2025-09-29T07:22:41Z)
• Exploring Selective Layer Fine-Tuning in Federated Learning [48.470385357429215]
  Federated learning (FL) has emerged as a promising paradigm for fine-tuning foundation models using distributed data. We study selective layer fine-tuning in FL, emphasizing a flexible approach that allows the clients to adjust their selected layers according to their local data and resources.
  arXiv  Detail & Related papers  (2024-08-28T07:48:39Z)
• Learning to Learn for Few-shot Continual Active Learning [9.283518682371756]
  Continual learning strives to ensure stability in solving previously seen tasks while demonstrating plasticity in a novel domain. Recent advances in continual learning are mostly confined to a supervised learning setting, especially in NLP domain. We exploit meta-learning and propose a method, called Meta-Continual Active Learning.
  arXiv  Detail & Related papers  (2023-11-07T05:22:11Z)
• Budget-aware Few-shot Learning via Graph Convolutional Network [56.41899553037247]
  This paper tackles the problem of few-shot learning, which aims to learn new visual concepts from a few examples. A common problem setting in few-shot classification assumes random sampling strategy in acquiring data labels. We introduce a new budget-aware few-shot learning problem that aims to learn novel object categories.
  arXiv  Detail & Related papers  (2022-01-07T02:46:35Z)
• Knowledge-driven Active Learning [70.37119719069499]
  Active learning strategies aim at minimizing the amount of labelled data required to train a Deep Learning model. Most active strategies are based on uncertain sample selection, and even often restricted to samples lying close to the decision boundary. Here we propose to take into consideration common domain-knowledge and enable non-expert users to train a model with fewer samples.
  arXiv  Detail & Related papers  (2021-10-15T06:11:53Z)
• Efficient Reinforced Feature Selection via Early Stopping Traverse Strategy [36.890295071860166]
  We propose a single-agent Monte Carlo based reinforced feature selection (MCRFS) method. We also propose two efficiency improvement strategies, i.e., early stopping (ES) strategy and reward-level interactive (RI) strategy.
  arXiv  Detail & Related papers  (2021-09-29T03:51:13Z)
• ImitAL: Learning Active Learning Strategies from Synthetic Data [14.758287202278918]
  Active Learning is a well-known standard method for efficiently obtaining labeled data. We propose ImitAL, a novel query strategy, which encodes AL as a learning-to-rank problem. We show that our approach is more runtime performant than most other strategies, especially on very large datasets.
  arXiv  Detail & Related papers  (2021-08-17T15:03:31Z)
• An EM Framework for Online Incremental Learning of Semantic Segmentation [37.94734474090863]
  We propose an incremental learning strategy that can adapt deep segmentation models without catastrophic forgetting, using a streaming input data with pixel annotations on the novel classes only. We validate our approach on the PASCAL VOC 2012 and ADE20K datasets, and the results demonstrate its superior performance over the existing incremental methods.
  arXiv  Detail & Related papers  (2021-08-08T11:30:09Z)
• Background Knowledge in Schema Matching: Strategy vs. Data [1.2891210250935146]
  We exploit six general-purpose graphs as sources of background knowledge for the matching task. We find that explicit strategies still outperform latent ones and that the choice of the strategy has a greater impact on the alignment than the actual background dataset. Our best matcher configuration with BabelNet performs very competitively when compared to other matching systems.
  arXiv  Detail & Related papers  (2021-06-29T19:16:33Z)

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.