NOCTA: Non-Greedy Objective Cost-Tradeoff Acquisition for Longitudinal Data
Not on the map. Why?
Abstract (arXiv)
In many critical domains, features are not freely available at inference time: each measurement may come with a cost of time, money, and risk. Longitudinal prediction further complicates this setting because both features and labels evolve over time, and missing measurements at earlier timepoints may become permanently unavailable. We propose NOCTA, a Non-Greedy Objective Cost-Tradeoff Acquisition framework that sequentially acquires the most informative features at inference time while accounting for both temporal dynamics and acquisition cost. NOCTA is driven by a novel objective, NOCT, which evaluates a candidate set of future feature-time acquisitions by its expected predictive loss together with its acquisition cost. Since NOCT depends on unobserved future trajectories at inference time, we develop two complementary estimators: (i) NOCT-Contrastive, which learns an embedding of partial observations utilizing the induced distribution over future acquisitions, and (ii) NOCT-Amortized, which directly predicts NOCT for candidate plans with a neural network. Experiments on synthetic and real-world medical datasets demonstrate that both NOCTA estimators outperform existing baselines, achieving higher accuracy at lower acquisition costs.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 33 references that are in the map. First posted on arXiv 16 Jul 2025.
Builds on
16 of 33 references.
References · 16
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Neural Controlled Differential Equations for Irregular Time Seriescited by 506
- 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 87
- 2018Variational Autoencoder with Arbitrary Conditioningcited by 68
- 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 56
- 2020Active Feature Acquisition with Generative Surrogate Modelscited by 54
- 2019Classification with Costly Features as a Sequential Decision-Making Problemcited by 23
- 2020Reinforcement Learning with Efficient Active Feature Acquisitioncited by 21
- 2023Estimating Conditional Mutual Information for Dynamic Feature Selectioncited by 21
- 2023Acquisition Conditioned Oracle for Nongreedy Active Feature Acquisitioncited by 19
- 2025A Survey on Active Feature Acquisition Strategiescited by 17
- 2019ASAC: Active Sensing using Actor-Critic modelscited by 13
4 more
- 2022Active Acquisition for Multimodal Temporal Data: A Challenging Decision-Making Taskcited by 13
- 2015Feature-Budgeted Random Forestcited by 6
- 2024A Unified Model for Longitudinal Multi-Modal Multi-View Prediction with Missingnesscited by 6
- 2023SoundSieve: Seconds-Long Audio Event Recognition on Intermittently-Powered Systemscited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.