mlsanityData to 7 Oct 2026

Relaxed Efficient Acquisition of Context and Temporal Features

arXiv 2603.11370 ↗First posted 11 Mar 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In many biomedical applications, measurements are not freely available at inference time: each laboratory test, imaging modality, or assessment incurs financial cost, time burden, or patient risk. Longitudinal active feature acquisition (LAFA) seeks to optimize predictive performance under such constraints by adaptively selecting measurements over time, yet the problem remains inherently challenging due to temporally coupled decisions (missed early measurements cannot be revisited, and acquisition choices influence all downstream predictions). Moreover, real-world clinical workflows typically begin with an initial onboarding phase, during which relatively stable contextual descriptors (e.g., demographics or baseline characteristics) are collected once and subsequently condition longitudinal decision-making. Despite its practical importance, the efficient selection of onboarding context has not been studied jointly with temporally adaptive acquisition. We therefore propose REACT (Relaxed Efficient Acquisition of Context and Temporal features), an end-to-end differentiable framework that simultaneously optimizes (i) selection of onboarding contextual descriptors and (ii) adaptive feature--time acquisition plans for longitudinal measurements under cost constraints. REACT employs a Gumbel--Sigmoid relaxation with straight-through estimation to enable gradient-based optimization over discrete acquisition masks, allowing direct backpropagation from prediction loss and acquisition cost. Across real-world longitudinal health and behavioral datasets, REACT achieves improved predictive performance at lower acquisition costs compared to existing longitudinal acquisition baselines, demonstrating the benefit of modeling onboarding and temporally coupled acquisition within a unified optimization framework.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 41 references that are in the map. First posted on arXiv 11 Mar 2026.

Builds on

13 of 41 references.

References · 13

  1. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  2. 2020Neural Controlled Differential Equations for Irregular Time Seriescited by 501
  3. 2017Learning Active Learning from Datacited by 100
  4. 2018EDDI: Efficient Dynamic Discovery of High-Value Information with Partial VAEcited by 85
  5. 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 54
  6. 2020Active Feature Acquisition with Generative Surrogate Modelscited by 53
  7. 2019Classification with Costly Features as a Sequential Decision-Making Problemcited by 23
  8. 2020Reinforcement Learning with Efficient Active Feature Acquisitioncited by 20
  9. 2023Estimating Conditional Mutual Information for Dynamic Feature Selectioncited by 20
  10. 2023Acquisition Conditioned Oracle for Nongreedy Active Feature Acquisitioncited by 17
  11. 2019ASAC: Active Sensing using Actor-Critic modelscited by 13
  12. 2025Stochastic Encodings for Active Feature Acquisitioncited by 8
1 more
  1. 2024A Unified Model for Longitudinal Multi-Modal Multi-View Prediction with Missingnesscited by 6

Built on by

Not cited yet.