- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes using general-purpose tabular foundation models (TFMs) such as TabPFN, TabFM, and TabICL for sequential recommendation, bypassing the need for recommendation-specific pretraining. The central contribution is a feature construction pipeline that converts each user history and candidate item pair into a tabular row. These rows encode semantic IDs built via residual K-means on Sentence-T5 embeddings, structured item attributes, cosine similarities to recent items, and an average similarity feature capturing long-term preferences. Labeled rows (positive and negative candidates) serve as in-context examples for a frozen TFM, which then scores test candidates in a single forward pass. Experiments on five benchmarks show that TabPFN-v3.5-SR and TabFM-SR outperform dedicated sequential recommenders on four of the five datasets, and ablations confirm that each feature group contributes meaningfully.
Critical strengths
The paper introduces a genuinely novel framing. The idea that frozen general-purpose tabular models can serve as drop-in backbones for recommendation, with no domain-specific pretraining at all, is clean and surprising. The fact that it actually works competitively on four of five datasets makes this more than a thought experiment. If the interface generalizes, improvements in TFMs would automatically translate to better recommendations, which is an appealing property.
The feature construction is thoughtful and the ablation study is thorough. The authors test single and joint feature removals across all five datasets, revealing interpretable patterns: short-term features matter more on short-sequence datasets while long-term features matter more on LastFM with its longer histories. The comparison against three alternative feature construction pipelines from prior work (Table 3) is a useful addition that goes beyond the usual ablation.
Critical weaknesses
The paper never discusses how the method scales. TFMs ingest labeled context rows in a single forward pass, so there is a hard limit on how much training data can be used. For the five benchmarks studied here, D_train could range from roughly 200K to 600K rows, yet TFMs like TabPFN handle at most a few thousand context rows. The paper is silent on how this is managed, whether rows are subsampled, how many context rows are actually used, and how results change as that number varies. Without this information it is impossible to assess whether the approach extends beyond small academic benchmarks, which undercuts the reusable pitch. This feels like a missing section rather than a minor omission.
The experimental comparison is not fully apples-to-apples. The TFM variants consume rich content features (Sentence-T5 embeddings, text-derived semantic IDs, handcrafted similarity scores) that several baselines never see. GRU4Rec, SASRec, CoSeRec, and SRPFN all operate on item ID sequences without text. The strongest baselines that do use text, UniSRec and RecFormer, come closest to the TFM variants. Meanwhile the tree-based models (XGBoost-SR and LGBM-SR) use exactly the same features and land close to the TFMs on most datasets, which raises the question of how much of the improvement comes from the TFM backbone versus the feature construction itself. The paper acknowledges this partially but does not disentangle the two contributions cleanly enough.
Questions for authors
-
How many context rows does each TFM backbone actually receive at inference time, and how are they selected? This is a critical missing detail. I would like to see a sensitivity analysis of performance versus context size.
-
Given that XGBoost-SR and LGBM-SR already perform competitively using the same features, what is the practical argument for preferring a frozen TFM over a fitted tree ensemble? The TFMs avoid training, but the feature construction itself (Sentence-T5 encoding, K-means clustering) already requires nontrivial compute. Could you quantify the end-to-end cost comparison?
-
On Yelp, removing semantic IDs improves performance (Table 12). Have you investigated this further? Does it suggest the method needs some mechanism to decide when semantic IDs help, and is there a risk of similar degradation on other domains with noisy or generic item text?