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.
A novel agent-based approach that can autonomously search over combinations of variable sets, temporal windows and longitudinal aggregation functions, and identify candidates with promising predictive performance, and utilises a history memory of previous searches and numerical evidence to guide subsequent exploration...
Si-Yao Wang, Florian Guitton, Shuo-Jie Fu et al.· 0 citations
We consider online binary prediction with paid stochastic features, where the learner can spend resources to obtain better observations of the underlying features. This setting is motivated by applications such as medical testing, where additional cost can provide more precise measurements of patient's features for pre...
Sanghwan Kim, Kyoungseok Jang, Seyoung Yun· 0 citations
Theoretically, it is proved that when the auxiliary outcomes satisfy a set of surrogacy conditions and the representation retains relevant covariate information, the original CATE is identified when the high-dimensional covariates are replaced by the learned representation.
Maitreyi Swaroop, Shikha Bhat, Samantha Rodriguez et al.· 0 citations
AFA with Incomplete Training Data is studied, showing that under missing completely at random (MCAR) data, one-step acquisition values remain unchanged, whereas multi-step values can decrease and that generative restoration is able to recover lost performance in many experiments.
Reza Rezvan, Valter Schütz, Han Wu et al.· 0 citations
Active feature acquisition learns policies that sequentially acquire features to maximize information about a target variable. We study how to learn and evaluate such policies from finite offline data using prior-data fitted networks (PFNs), which are off-the-shelf models that output posterior predictive distributions...
Y. Kobayashi, Divyam Madaan, Shalmali Joshi· 0 citations
ECHO-$k$ is introduced, a task-agnostic and self-supervised learning principle for modality acquisition that uses a deep model's internal pretrained representations as proxy targets that summarize cross-modal information and consistently improves budgeted downstream performance across diverse foundation-model backends.
Eeshaan Jain, L. Bleistein, B. Deplancke et al.· 0 citations