Active Feature Acquisition for Cost-Efficient Temporal Prediction with Reduced Participant Burden
Not on the map. Why?
Abstract (arXiv)
Accurate forecasting of pathological outcomes is a central problem in psychology. To do so, psychologists often collect intensive longitudinal data. However, in such studies, the desire to acquire a large number of variables for the sake of accurate prediction is often counteracted by the need to minimize participant burden. Acquiring more variables per occasion can yield better predictions, but having too many acquisitions increase the risk of non-response and attrition. Longitudinal Active Feature Acquisition (LAFA) is a principled approach to resolve this conundrum. Instead of requiring responses to every item at every acquisition occasion, LAFA produces a policy that seeks to optimally select dynamic subsets of items to be acquired at each timepoint while preserving our ability to forecast a specific outcome. However, existing LAFA methods are mostly based on Neural Networks (NN) that are difficult to interpret in practice. In this work, we introduce a tree distillation method for learning an interpretable policy from NN-based LAFA networks. We validated our method through both a simulation and an empirical EMA dataset on forecasting daily alcohol consumption. In both cases, we find that we can meaningfully reduce the number of items acquired at each occasion with minimal loss in accuracy. Networks (NN) that are difficult to interpret in practice. In this work, we introduce a tree distillation method for learning an interpretable policy from NN-based LAFA networks. We validated our method through both a simulation and an empirical EMA dataset on forecasting daily alcohol consumption. In both cases, we find that we can meaningfully reduce the number of items acquired at each occasion with minimal loss in accuracy.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 36 references that are in the map. First posted on arXiv 5 Oct 2026.
Builds on
6 of 36 references.
References · 6
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2021Interpretable Machine Learning: Fundamental Principles and 10 Grand Challengescited by 367
- 2017Distilling a Neural Network Into a Soft Decision Treecited by 236
- 2022Active Acquisition for Multimodal Temporal Data: A Challenging Decision-Making Taskcited by 13
- 2019The Price of Interpretabilitycited by 10
Built on by
Not cited yet.