VIP-COP: Context Optimization for Tabular Foundation Models
cs.LG
Submitted: 2026-05-13
Updated: 2026-09-29
Code: https://github.com/LAMDA-Tabular/TALENT5https:
License: http://creativecommons.org/licenses/by/4.0/
The gist: Tabular foundation models (TFMs) have emerged as a powerful paradigm for in-context learning on structured data, enabling direct prediction on new tabular tasks without task-specific training.
Terminology
Abstract
Tabular foundation models (TFMs) have emerged as a powerful paradigm for in-context learning on structured data, enabling direct prediction on new tabular tasks without task-specific training. However, their effectiveness is constrained by context length limits, restricting application to medium-scale data and degrading performance when inference-time data exceed pretraining size distributions. Our work introduces VIP-COP, estimating the Value of Importance for Prediction of training examples and features for hard Context OPtimization for TFMs. Its explicit selection mechanism suppresses noise and isolates influential data, enabling the model to also benefit from data augmentation by prioritizing high-value augmented samples and features. VIP-COP is (i) fast, boosting performance often within minutes of optimization, based on an online KernelSHAP-based regression with iterative refinement, value-guided context sampling, and multi-fidelity pruning; (ii) budget-aware and any-time, improving with additional test-time compute unlike heuristics that produce fixed contexts; (iii) model-aware yet fully black-box, requiring no access to model internals, making it compatible with both proprietary and open-source TFMs; (iv) interpretable, identifying discrete ``Very Important Predictors'' (samples and features) that maximize signal-to-noise, which makes it (v) robust, isolating high-value data from noise. In contrast, soft-prompt optimization requires model gradients, produces abstract latent tokens, and lacks explicit signal discrimination. Extensive experiments show that VIP-COP consistently outperforms heuristic and optimized baselines across large-scale high-dimensional testbeds, including data augmentation and data-noise settings, establishing a new state of the art in test-time context refinement for TFMs.
Sources
- Extending Context Window of Large Language Models via Positional Interpolation
- LongLoRA: Efficient Fine-tuning of Long-Context Large Language Models
- TabPFN-Wide: Continued Pre-Training for Extreme Feature Counts
- TabPFN Unleashed: A Scalable and Effective Solution to Tabular Classification Problems
- TabDPT: Scaling Tabular Foundation Models on Real Data
- In-Context Data Distillation with TabPFN
- A Survey of Context Engineering for Large Language Models
- YaRN: Efficient Context Window Extension of Large Language Models
- TabICL: A Tabular Foundation Model for In-Context Learning on Large Data
- A Systematic Survey of Prompt Engineering in Large Language Models: Techniques and Applications
- An Explanation of In-context Learning as Implicit Bayesian Inference
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks