- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper explores the problem of context optimization within tabular foundation models. The paper proposes the use of compiled task memory, which are task-specific context vectors optimized offline and reused through a frozen predictor. Experiments appear to show improvement over baseline methods evaluated across a range of tabular classification and regression tasks. The current submission has significant issues in clarity which presents issues in parsing the submission and evaluating the core scientific contribution.
Critical strengths
The core problem being examined by the paper (context optimization to improve the efficiency of tabular foundation models) is an important problem of interest to the research community. Experimental results show that the proposed method may lead to improvements relative to baseline methods. Evaluation has been performed on an appropriate array of classification and regression tasks.
Critical weaknesses
The critical weakness in this paper is clarity. Much of the paper employs LLM phrasing, which is unclear and contains unusual phrasing that is difficult to parse and contains extraneous information. Overall, this is the most significant issue with the submission.
The contributions details are not clear and largely relate to experimental results rather than proposing a conceptual contribution. This makes it difficult to evaluate the proposed scientific contribution. For example:
- L050 "Optimized256 improves over its exact Unoptimized256 initialization on two backbones. That initialization is already a stratified frozen-encoding baseline. At the same K256 budget, cluster/PCA representatives and fixed-anchor Hopfield pooling provide additional construction controls on all 48 tasks; the K1024 construction follow-up is in Appendix B.6."
- L059 "Slot counts of 64/256/512/1024 expose the accuracy, state and latency tradeoff. Larger memories improve regression but retain a mean gap to full context. Offline preparation is accounted for separately from repeated query serving."
This is an issue throughout the submission. For example in the related works:
- "The TuneTables entries use adapted single prompts on TabPFN-v1, without its full search/ensembles; ICD is related work, not a reproduced baseline. The paired λ = 0 arm instead provides supervised context optimization on each evaluated backbone."
Overall the paper is written more as an experimental report rather than as a self-contained conference paper. The method section would be difficult to replicate based on the text contained within the submission. The Appendix contains references to the project README.md, requirements.txt, and python scripts in the supplementary materials. L615"reproduce.py verifies both input checksums and implements their aggregation, rank ties and the figure’s 10,000-draw bootstrap. ctm.py pins the TabDPT/TabICLv2 checkpoint filenames, download revisions; requirements.txt and requirements-model.txt pin the corresponding dependencies. README.md maps these files to Appendices A.1 and A.2."
Questions for authors
The critical issue with the current submission is clarity, which has made it difficult to evaluate the scientific contribution. While experimental results show that the implementation may show promise, it would be useful to understand the core contribution as the authors see it and how this relates to prior literature. Expressing this in the author's own words would be useful to understand the proposed contribution.