mlsanityData to 14 Oct 2026

Active Timepoint Selection for Learning Measure-Valued Trajectories

arXiv 2605.30625 ↗First posted 28 May 2026cs.LG cs.AI stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Inferring continuous probability paths from sparse snapshots is a fundamental challenge in domains like single-cell biology, where high-fidelity data acquisition is often destructive and constrained by prohibitive sequencing costs. This motivates the need for active learning strategies to strategically select optimal measurement times. However, designing active learning policies for this setting remains an open problem: the target objects reside on the infinite dimensional Wasserstein space where standard Euclidean metrics are ill-defined, and current interpolation methods lack epistemic uncertainty quantification. We introduce a framework which extends active experimentation to the space of measures. By leveraging Linearized Optimal Transport (LOT), we map distributional snapshots into a tangent space amenable to Gaussian Process modeling, allowing us to construct a tractable probabilistic surrogate for the underlying probability path. This yields an acquisition policy that iteratively selects measurement times to minimize uncertainty. Empirical results demonstrate that our strategy outperforms uncertainty-agnostic baselines on both synthetic and real-world datasets.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 33 references that are in the map. First posted on arXiv 28 May 2026.

Builds on

1 of 33 references.

References · 1

  1. 2025Linearized Optimal Transport for Analysis of High-Dimensional Point-Cloud and Single-Cell Datacited by 1

Built on by

Not cited yet.