mlsanityData to 7 Oct 2026

AFABench: A Generic Framework for Benchmarking Active Feature Acquisition

arXiv 2508.14734 ↗First posted 20 Aug 2025cs.LG cs.AIcited by 7

Not on the map. Why?

Abstract (arXiv)

In many real-world scenarios, acquiring all features of a data instance can be expensive or impractical due to monetary cost, latency, or privacy concerns. Active Feature Acquisition (AFA) addresses this challenge by dynamically selecting a subset of informative features for each data instance, trading predictive performance against acquisition cost. While numerous methods have been proposed for AFA, ranging from myopic information-theoretic strategies to non-myopic reinforcement learning approaches, fair and systematic evaluation of these methods has been hindered by a lack of standardized benchmarks. In this paper, we introduce AFABench, the first benchmark framework for AFA. Our benchmark includes a diverse set of synthetic and real-world datasets, supports a wide range of acquisition policies, and provides a modular design that enables easy integration of new methods and tasks. We implement and evaluate representative algorithms from all major categories, including static, myopic, and reinforcement learning-based approaches. To test the lookahead capabilities of AFA policies, we introduce a novel synthetic dataset, CUBE-NM, designed to expose the limitations of myopic selection. Our results highlight key trade-offs between different AFA strategies and provide actionable insights for future research. The benchmark code is available at: https://github.com/Linusaronsson/AFA-Benchmark.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 18 of its 48 references that are in the map. First posted on arXiv 20 Aug 2025.

Builds on

18 of 48 references.

References · 18

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2017Proximal Policy Optimization Algorithmscited by 14,441
  5. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  6. 2015Order Matters: Sequence to sequence for setscited by 236
  7. 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 85
  8. 2022Partially Observable Markov Decision Processes in Robotics: A Surveycited by 81
  9. 2023TorchRL: A data-driven decision-making library for PyTorchcited by 59
  10. 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 54
  11. 2016Feature Selection: A Data Perspectivecited by 50
  12. 2023Variational Information Pursuit for Interpretable Predictionscited by 25
6 more
  1. 2019Classification with Costly Features as a Sequential Decision-Making Problemcited by 23
  2. 2023Estimating Conditional Mutual Information for Dynamic Feature Selectioncited by 20
  3. 2019Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streamscited by 18
  4. 2023Acquisition Conditioned Oracle for Nongreedy Active Feature Acquisitioncited by 17
  5. 2025A Survey on Active Feature Acquisition Strategiescited by 16
  6. 2014Optimal Value of Information in Graphical Modelscited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 7.

7 papers.