Learning-To-Measure: In-Context Active Feature Acquisition
Not on the map. Why?
Abstract (arXiv)
Active feature acquisition (AFA) is a sequential decision-making problem where the goal is to improve model performance for test instances by adaptively selecting which features to acquire. In practice, AFA methods often learn from retrospective data with systematic missingness in the features and limited task-specific labels. Most prior work addresses acquisition for a single predetermined task, limiting scalability. To address this limitation, we formalize the meta-AFA problem, where the goal is to learn acquisition policies across various tasks. We introduce Learning-to-Measure (L2M), which consists of i) reliable uncertainty quantification over unseen tasks, and ii) an uncertainty-guided greedy feature acquisition agent that maximizes conditional mutual information. We demonstrate a sequence-modeling or autoregressive pre-training approach that underpins reliable uncertainty quantification for tasks with arbitrary missingness. L2M operates directly on datasets with retrospective missingness and performs the meta-AFA task in-context, eliminating per-task retraining. Across synthetic and real-world tabular benchmarks, L2M matches or surpasses task-specific baselines, particularly under scarce labels and high missingness.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 39 of its 62 references that are in the map. First posted on arXiv 14 Oct 2025.
Builds on
39 of 62 references.
References · 39
- 2017Attention Is All You Needcited by 60,361
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
- 2021On the Opportunities and Risks of Foundation Modelscited by 4,033
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2015Dueling Network Architectures for Deep Reinforcement Learningcited by 785
- 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 674
- 2018Conditional Neural Processescited by 426
- 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 389
- 2021Transformers Can Do Bayesian Inferencecited by 360
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
- 2023Supervised Pretraining Can Learn In-Context Reinforcement Learningcited by 139
- 2022Transformer Neural Processes: Uncertainty-Aware Meta Learning Via Sequence Modelingcited by 127
27 more
- 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 87
- 2023Transformers as Decision Makers: Provable In-Context Reinforcement Learning via Supervised Pretrainingcited by 83
- 2024Large Scale Transfer Learning for Tabular Data via Language Modelingcited by 76
- 2023Statistical Foundations of Prior-Data Fitted Networkscited by 65
- 2020Identifying Causal-Effect Inference Failure with Uncertainty-Aware Modelscited by 57
- 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 56
- 2020Active Feature Acquisition with Generative Surrogate Modelscited by 54
- 2025Real-TabPFN: Improving Tabular Foundation Models via Continued Pre-training With Real-World Datacited by 41
- 2017Classification with Costly Features using Deep Reinforcement Learningcited by 34
- 2021Identifiable Generative Models for Missing Not at Random Data Imputationcited by 30
- 2022Interpretable by Design: Learning Predictors by Composing Interpretable Queriescited by 28
- 2020Full Law Identification In Graphical Models Of Missing Data: Completeness Resultscited by 26
- 2023Variational Information Pursuit for Interpretable Predictionscited by 25
- 2023Estimating Conditional Mutual Information for Dynamic Feature Selectioncited by 21
- 2019Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streamscited by 20
- 2020Empirical Frequentist Coverage of Deep Learning Uncertainty Quantification Procedurescited by 19
- 2022Missing Data Imputation and Acquisition with Deep Hierarchical Models and Hamiltonian Monte Carlocited by 19
- 2024Meta-DT: Offline Meta-RL as Conditional Sequence Modeling with World Model Disentanglementcited by 17
- 2023Evaluation of Active Feature Acquisition Methods for Time-varying Feature Settingscited by 9
- 2024Active Exploration via Autoregressive Generation of Missing Datacited by 9
- 2025Stochastic Encodings for Active Feature Acquisitioncited by 9
- 2024Exchangeable Sequence Models Quantify Uncertainty Over Latent Conceptscited by 7
- 2022Imputation Strategies Under Clinical Presence: Impact on Algorithmic Fairnesscited by 6
- 2023Evaluation of Active Feature Acquisition Methods for Static Feature Settingscited by 4
- 2024Distribution Guided Active Feature Acquisitioncited by 3
- 2024Access to care improves EHR reliability and clinical risk prediction model performancecited by 3
- 2025Architectural and Inferential Inductive Biases For Exchangeable Sequence Modelingcited by 2
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Zero-Shot Active Feature Acquisition via LLM-Elicitationcited by 0
- 2026Wide Learning: Learning to Reach Evidencecited by 0
- 2026When Does Test-Time Physical Diagnosis Pay? A Frozen Policy Buys Evidence It Never Readscited by 0
- 2026Active Feature Acquisition With Incomplete Training Datacited by 0
- 2026Measure Less, Know More: Self-Supervised Test-Time Feature Acquisitioncited by 0
- 2026Measure Less, Know More: Self-Supervised Test-Time Feature Acquisition2 Oct 2026
- 2026Active Feature Acquisition With Incomplete Training Data26 Sep 2026
- 2026When Does Test-Time Physical Diagnosis Pay? A Frozen Policy Buys Evidence It Never Reads14 Sep 2026
- 2026Wide Learning: Learning to Reach Evidence30 Aug 2026
- 2026Zero-Shot Active Feature Acquisition via LLM-Elicitation17 Jun 2026