mlsanityData to 14 Oct 2026

Non-Myopic Active Feature Acquisition via Pathwise Policy Gradients

arXiv 2605.05511 ↗First posted 6 May 2026cs.LG stat.MLcited by 1

On the map: Deep reinforcement learning methods → RL theory and sample complexity

Abstract (arXiv)

Active feature acquisition (AFA) considers prediction problems in which features are costly to obtain and the learner adaptively decides which feature values to acquire for each instance and when to stop and predict. In this paper, we introduce a continuous relaxation of the acquisition process that enables non-myopic pathwise policy gradients (NM-PPG) through the full acquisition trajectory, avoiding the high variance of standard score-function policy gradients while allowing end-to-end optimization of the acquisition policy. To better align training with deployment, we develop a straight-through rollout that follows discrete feature acquisitions in the forward pass while backpropagating through the corresponding soft relaxation. We derive an AFA-specific average-case upper bound on the variance of this gradient estimator, which characterizes instability and motivates staged temperature sharpening. Experiments on both synthetic and real-world datasets demonstrate that NM-PPG yields superior performance relative to state-of-the-art AFA baselines.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 30 of its 63 references that are in the map. First posted on arXiv 6 May 2026.

Builds on

30 of 63 references.

Closest ancestors · 2

Same direction, newest first

  1. 2025AFABench: A Generic Framework for Benchmarking Active Feature Acquisition20 Aug
  2. 2025Relative Entropy Pathwise Policy Optimization15 Jul

Other references · 28

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  4. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  5. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  6. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  7. 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
  8. 2021PonderNet: Learning to Pondercited by 168
  9. 2015Learning Continuous Control Policies by Stochastic Value Gradientscited by 162
  10. 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 87
  11. 2022Partially Observable Markov Decision Processes in Robotics: A Surveycited by 86
  12. 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 56
16 more
  1. 2020Active Feature Acquisition with Generative Surrogate Modelscited by 54
  2. 2014Online Planning Algorithms for POMDPscited by 45
  3. 2020Learning to Stop While Learning to Predictcited by 31
  4. 2023Variational Information Pursuit for Interpretable Predictionscited by 25
  5. 2019Classification with Costly Features as a Sequential Decision-Making Problemcited by 23
  6. 2023Estimating Conditional Mutual Information for Dynamic Feature Selectioncited by 21
  7. 2019Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streamscited by 20
  8. 2023Acquisition Conditioned Oracle for Nongreedy Active Feature Acquisitioncited by 19
  9. 2025A Survey on Active Feature Acquisition Strategiescited by 17
  10. 2025Stochastic Encodings for Active Feature Acquisitioncited by 9
  11. 2017Efficient Online Learning for Optimizing Value of Information: Theory and Application to Interactive Troubleshootingcited by 8
  12. 2014Optimal Value of Information in Graphical Modelscited by 7
  13. 2023Model-Based Reparameterization Policy Gradient Methods: Theory and Practical Algorithmscited by 7
  14. 2025The Curious Language Model: Strategic Test-Time Information Acquisitioncited by 5
  15. 2021Bias-Variance Tradeoffs in Single-Sample Binary Gradient Estimatorscited by 4
  16. 2024Distribution Guided Active Feature Acquisitioncited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025Information Templates: A New Paradigm for Intelligent Active Feature Acquisition
  2. 2026AFA-BANDIT: Provably Near-Optimal Online Multi-Feature Classification Under Budget Constraints
  3. 2023Evaluation of Active Feature Acquisition Methods for Time-varying Feature Settings
  4. 2023Evaluation of Active Feature Acquisition Methods for Static Feature Settings
  5. 2026Performance-guided Reinforced Active Learning for Object Detection
  6. 2025Optimizing Active Learning in Vision-Language Models via Parameter-Efficient Uncertainty Calibration
  7. 2025Greedy Alignment Principle for Optimizer Selection
  8. 2026Active Data Acquisition with Side Information via Discrete Diffusion Priors