cs.LGJul 16, 2025

Contrastive Nonmyopic Objective Cost-Tradeoff Acquisition for Longitudinal Data

Authors: Dzung Dinh, Boqi Chen, Yunni Qu, Marc Niethammer, Junier Oliva

Organizations: Department of Computer Science, UNC Chapel Hill · Department of Computer Science and Engineering, University of California San Diego

Abstract

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 measurements missed at earlier timepoints may become permanently unavailable. We propose CAPE (Contrastive Acquisition-Plan Embeddings), a partitioning acquisition policy for longitudinal active feature acquisition. CAPE first defines NOCT, an oracle-based objective that scores a set of future feature-time acquisitions by its expected predictive loss together with its acquisition cost. Based on NOCT, CAPE learns a contrastive acquisition-utility manifold of masked partial observations, where proximity reflects the expected utility of future acquisitions. Offline, training states are embedded and partitioned at each rollout timepoint; candidate future plans are scored within each partition using plug-in NOCT, and the best partition-level acquisition plans are cached. During inference, CAPE retrieves the cached plan via nearest-centroid lookup, enabling low-latency adaptive acquisitions. Experiments on synthetic and real-world healthcare datasets demonstrate that CAPE outperforms nonparametric, greedy, and RL-based alternatives, achieving higher accuracy at lower acquisition costs. Code is publicly available at https://github.com/dzungdinhh/CAPE.

Figures & tables

Appendix figures & tables16 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Relaxed Efficient Acquisition of Context and Temporal Features

    Mar 11, 2026Yunni Qu, Dzung Dinh, Grant King +5Active Feature AcquisitionFeature Selection

  2. Non-Myopic Active Feature Acquisition via Pathwise Policy Gradients

    May 6, 2026Linus Aronsson, Morteza Haghir ChehreghaniPolicy GradientActive Learning

  3. Active Feature Acquisition With Incomplete Training Data

    Sep 26, 2026Reza Rezvan, Valter Schütz, Han Wu +2Active Feature AcquisitionLearning with Missing Data