Adaptive Active Learning for Regression via Reinforcement Learning

Simon D. Nguyen, Troy Russo, Kentaro Hoffman, Tyler H. McCormick
3/11/2026
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

Active learning for regression reduces labeling costs by selecting the most informative samples. Improved Greedy Sampling is a prominent method that balances feature-space diversity and output-space uncertainty using a static, multiplicative rule. We propose Weighted improved Greedy Sampling (WiGS), which replaces this framework with a dynamic, additive criterion. We formulate weight selection as a reinforcement learning problem, enabling an agent to adapt the exploration-investigation balance throughout learning. Experiments on 18 benchmark datasets and a synthetic environment show WiGS outperforms iGS and other baseline methods in both accuracy and labeling efficiency, particularly in domains with irregular data density where the baseline's multiplicative rule ignores high-error samples in dense regions.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{nguyen2026adaptive,
  title  = {Adaptive Active Learning for Regression via Reinforcement Learning},
  author = {Simon D. Nguyen and Troy Russo and Kentaro Hoffman and Tyler H. McCormick},
  year   = {2026},
  eprint = {2603.10435},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.10435v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.10435.svg)](https://codeofpaper.com/paper/2603.10435)

Discussion