mlsanityData to 14 Oct 2026

A Survey on Active Feature Acquisition Strategies

arXiv 2502.11067 ↗First posted 16 Feb 2025cs.LGcited by 17

Not on the map. Why?

Abstract (arXiv)

Active feature acquisition (AFA) studies how to sequentially acquire features for each data instance to trade off predictive performance against acquisition cost. This survey offers the first unified treatment of AFA via an explicit partially observable Markov decision process (POMDP) formulation. We place this formulation in the broader literature on optimal information acquisition and, more specifically, in a family of structured POMDPs (for example, information-gathering and sensing POMDPs) whose assumptions and algorithmic tools directly apply to AFA. This connection provides a common language for comparing problem settings and methods, and it highlights where AFA can leverage established results in structured POMDP planning and approximation. Building on this perspective, we present an up-to-date taxonomy of AFA methods that (roughly) mirrors standard approaches to solving POMDPs: (i) embedded cost-aware predictors (notably cost-sensitive decision trees and ensembles), (ii) model-based methods that plan using learned probabilistic components, (iii) model-free methods that learn acquisition policies from simulated episodes, and (iv) hybrid methods that combine the strengths of model-based and model-free approaches. We argue that this POMDP-centric view clarifies connections among existing methods and motivates more principled algorithm design. Since much prior work is heuristic and lacks formal guarantees, we also outline routes to guarantees by connecting AFA to adaptive stochastic optimization. We conclude by highlighting open challenges and promising directions for future research.

Key facts. Cited by 17 papers in the map (data through 14 Oct 2026). Builds on 47 of its 153 references that are in the map. First posted on arXiv 16 Feb 2025.

Builds on

47 of 153 references.

References · 47

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,248
  3. 2020A Survey of Deep Active Learningcited by 554
  4. 2018Learning to Explain: An Information-Theoretic Perspective on Model Interpretationcited by 248
  5. 2015Order Matters: Sequence to sequence for setscited by 237
  6. 2018Multimodal Generative Models for Scalable Weakly-Supervised Learningcited by 200
  7. 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 87
  8. 2022Partially Observable Markov Decision Processes in Robotics: A Surveycited by 86
  9. 2022Tutorial on amortized optimizationcited by 83
  10. 2018Variational Autoencoder with Arbitrary Conditioningcited by 68
  11. 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 56
  12. 2020Active Feature Acquisition with Generative Surrogate Modelscited by 54
35 more
  1. 2020Near-optimal Regret Bounds for Stochastic Shortest Pathcited by 50
  2. 2014Online Planning Algorithms for POMDPscited by 45
  3. 2024Optimal experimental design: Formulations and computationscited by 45
  4. 2017Classification with Costly Features using Deep Reinforcement Learningcited by 34
  5. 2019Flow Models for Arbitrary Conditional Likelihoodscited by 30
  6. 2022Interpretable by Design: Learning Predictors by Composing Interpretable Queriescited by 28
  7. 2019SPFlow: An Easy and Extensible Library for Deep Probabilistic Learning using Sum-Product Networkscited by 26
  8. 2023Variational Information Pursuit for Interpretable Predictionscited by 25
  9. 2019Classification with Costly Features as a Sequential Decision-Making Problemcited by 23
  10. 2021Arbitrary Conditional Distributions with Energycited by 22
  11. 2020Reinforcement Learning with Efficient Active Feature Acquisitioncited by 21
  12. 2023Estimating Conditional Mutual Information for Dynamic Feature Selectioncited by 21
  13. 2019Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streamscited by 20
  14. 2023Acquisition Conditioned Oracle for Nongreedy Active Feature Acquisitioncited by 19
  15. 2017Adaptive Classification for Prediction Under a Budgetcited by 15
  16. 2023Lower Bounds for Learning in Revealing POMDPscited by 15
  17. 2016Pruning Random Forests for Prediction on a Budgetcited by 14
  18. 2020BSODA: A Bipartite Scalable Framework for Online Disease Diagnosiscited by 14
  19. 2019ASAC: Active Sensing using Actor-Critic modelscited by 13
  20. 2019Learning about an exponential amount of conditional distributionscited by 12
  21. 2020Inverse Active Sensing: Modeling and Understanding Timely Decision-Makingcited by 12
  22. 2021A Probabilistic Hard Attention Model For Sequentially Observed Scenescited by 12
  23. 2016Active Information Acquisitioncited by 11
  24. 2023Evaluation of Active Feature Acquisition Methods for Time-varying Feature Settingscited by 9
  25. 2017Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshootingcited by 8
  26. 2014Optimal Value of Information in Graphical Modelscited by 7
  27. 2015Feature-Budgeted Random Forestcited by 6
  28. 2019Efficient estimation of optimal regimes under a no direct effect assumptioncited by 5
  29. 2021Costly Features Classification using Monte Carlo Tree Searchcited by 4
  30. 2023Evaluation of Active Feature Acquisition Methods for Static Feature Settingscited by 4
  31. 2024Distribution Guided Active Feature Acquisitioncited by 3
  32. 2023Efficient Online Decision Tree Learning with Active Feature Acquisitioncited by 2
  33. 2023Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approachcited by 2
  34. 2023Generator Assisted Mixture of Experts For Feature Acquisition in Batchcited by 2
  35. 2023Fast Classification with Sequential Feature Selection in Test Phasecited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 12.

17 papers.

Sort:

By area: