Measure Less, Know More: Self-Supervised Test-Time Feature Acquisition
Organizations: School of Computer and Communication Sciences, EPFL · School of Life Sciences, EPFL
Abstract
Recent progress in multimodal, high-dimensional learning has enabled foundation models to process heterogeneous, large-scale data. However, at test time, acquiring all features or modalities can be prohibitively costly and often redundant. Sequentially selecting informative modalities is therefore critical, yet challenging when the downstream task or prediction target is unknown. To this end, we introduce ECHO-, a task-agnostic and self-supervised learning principle for modality acquisition: we use a deep model's internal pretrained representations (e.g., from a foundation model) as proxy targets that summarize cross-modal information. We provide theoretical guarantees in a stylized linear setting that motivate a reinforcement learning (RL) policy for sequential modality selection. Across task-agnostic and label-free acquisition baselines, ECHO- consistently improves budgeted downstream performance across diverse foundation-model backends. Our method provides a principled route to cost-aware test-time deployment, with implications for any multimodal system where measurements are expensive or time-constrained, and downstream tasks unknown a priori.
Figures & tables
Appendix figures & tables11 assets
Supplementary material from the paper’s appendix.
Appendix
| Notation | Meaning |
|---|---|
| Representation-acquisition setup | |
| Number of i.i.d. samples. | |
| Number of possible views in the general acquisition problem. | |
| The -th view of sample . A view may be a modality or a jointly acquired feature group. | |
| Space of possible values for view . | |
| View-specific encoder for view . | |
| Name | Model Driven? | Selection Criterion | Adaptive? | Source |
|---|---|---|---|---|
| Oracle | ✓ | 1-step Oracle knowledge | ✓ | —- |
| GIR | ✓ | Average contribution to latent state | ✗ | —- |
| Random | ✗ | Uniform distribution over unseen features | ✗ | —- |
| Laplacian Score † | ✗ | Locality preservation | ✗ | He et al. (2005) |
| spec - † | ✗ | Graph-based ranking | ✗ | Zhao and Liu (2007) |
| UDFS † | ✗ | Local discriminative structure | ✗ | Yang et al. (2011) |
| Parameter | MNIST/Fashion-MNIST | MiniBooNE | hPancreas | NSCLC | MMEarth-Bench | Synthetic |
|---|---|---|---|---|---|---|
| Acquisition budget | 10 | 7 | 25 | 10 | 5 | varies |
| Step threshold | ||||||
| Gain factor | 1.5 | 1.5 | 1.5 | 1.5 | 1.5 | 1.5 |
| Discount factor | 0.98 | 0.98 | 0.99 | 0.98 | 0.98 | 0.98 |
| Training steps | 300k | 300k | 500k | 300k | 200k | 300k |
| Method | 10% | 20% | 40% | 60% |
|---|---|---|---|---|
| DIME | ||||
| GDFS | ||||
| SEFA | ||||
| GSMRL | ||||
| EDDI | ||||
Efficient Multimodal Inference
Efficient multimodal inference reduces the compute, memory, latency, and energy needed to process image, video, audio, text, and sensor inputs.
See all 231 papersQiYao-M: Multimodal Time Series Foundation Model with Role-Aware Modeling of Endogenous and Exogenous Modalities
Modular Multimodal Classification Without Fine-Tuning: A Simple Compositional Approach
CLS tokens of the foundation model align poorly with downstream tasks, we propose PALPooling, a lightweight adaptive token pooler that consistently improves representation quality. By composing strong frozen representation learning backbones with TFMs, our approach achieves state-of-the-art results across diverse multimodal benchmarks without any training. On hierarchical tasks with large fine-grained class spaces, our approach enables fast and scalable classification, handling datasets with over 500,000 samples and 2,000 classes without any fine-tuning. Overall, our results show that the composition of foundation models is a simple, yet powerful, out-of-the-box solution for multimodal learning, challenging the necessity of complex, end-to-end training pipelines for new problems.