mlsanityData to 14 Oct 2026

BRiG-AFA: Bellman Risk-to-Go Learning for Non-Myopic Active Feature Acquisition

arXiv 2608.02305 ↗First posted 3 Aug 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Active feature acquisition (AFA) asks which unobserved feature to measure next for each test instance under a budget. Greedy rules are easy to train but can overlook context features whose value is realized only through later acquisitions, while reinforcement-learning and generative approaches introduce difficult optimization or conditional-density estimation. We introduce method, a deployable, supervised alternative that learns a separate candidate-conditioned risk-to-go function for every remaining budget. Starting from the one-step terminal classification risk, the functions are fitted backward with Bellman targets; inference greedily minimizes the learned terminal risk using only observed values, the mask, candidate identity, and remaining budget. A controlled non-myopic benchmark shows the expected mechanism: at budgets two and three, method improves accuracy over its one-step ablation by 4.84±2.17 and 4.39±1.10 percentage points (mean ± standard error over five seeds). On Fashion-MNIST with 20 candidate pixels, it improves accuracy at every nontrivial reported budget on average, including 10.20±0.74 points at four acquisitions; its mean paired gain across budgets 2,4,8,12,16 is 3.50±0.37 points. A three-seed MiniBooNE study is mixed at small budgets but positive at 8 and 16 acquisitions, identifying a current boundary rather than supporting a universal claim. These results establish a reproducible mechanism-level case for direct Bellman risk regression and delimit the experiments still needed for state-of-the-art comparison.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 12 references that are in the map. First posted on arXiv 3 Aug 2026.

Builds on

9 of 12 references.

References · 9

  1. 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 87
  2. 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 56
  3. 2020Active Feature Acquisition with Generative Surrogate Modelscited by 54
  4. 2023Estimating Conditional Mutual Information for Dynamic Feature Selectioncited by 21
  5. 2019Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streamscited by 20
  6. 2023Acquisition Conditioned Oracle for Nongreedy Active Feature Acquisitioncited by 19
  7. 2023Evaluation of Active Feature Acquisition Methods for Time-varying Feature Settingscited by 9
  8. 2025Stochastic Encodings for Active Feature Acquisitioncited by 9
  9. 2017Learning to Acquire Informationcited by 4

Built on by

Not cited yet.