arXiv paper· evolutionary computation (surrogate-assisted expensive optimization)· benchmark (empirical study)

Benchmarking Tabular Foundation Models as Surrogates in Expensive Evolutionary Optimization

Lu Han, Jin Wang, Yuchen Li, Haoran Gu, Shulei Liu, Ziyang Shi, Wenao Lu, Handing Wang

cs.NE · cs.LG

Quick verdict

Benchmark finds TabPFN a selective, not universal, SAEA surrogate; the substitution study is broad and diagnostic but uses one baseline framework per scenario.

Summary

The paper benchmarks TabPFN v2 as a drop-in replacement for conventional surrogates (GP, RBFN) in surrogate-assisted evolutionary algorithms (SAEAs) for expensive optimization. Offline prediction tests on Ellipsoid, Rastrigin, and CEC2017 (Tables I, S-I..S-III) show TabPFN winning most RMSE and Kendall's tau comparisons. The authors then substitute TabPFN into one representative framework per scenario: TT-DDEA (offline, tied 37-37), MGP-SLPSO (online single-objective, 82-5 for TabPFN), LSEO-S3 (1000D, loses 0-5 despite better subspace accuracy - traced to conservative mean-regression extrapolation vs RBFN's unbounded cubic kernel, Table VII), DSI (constrained, loses 8/10 due to predicted-range compression blurring feasibility, Table IX), KTA2/KTS (multi-objective: replacing objective surrogates degrades CF results, replacing constraint surrogates is safe), SAEAPRG (feature selection, 2/0/10 comparable), SHEALED (mixed-variable, loses 3/21/6), and an EvoGym soft-robot case (wins offline with 100-300 samples, loses online with ~20). Conclusions: TabPFN is highly problem-dependent - strong with abundant data and complex landscapes, weak for extrapolation-heavy, complex-constraint, mixed-variable, and data-scarce online settings. Limitations: a single baseline framework per scenario, no comparison with other learned surrogates, no code release, and the abstract's promised 'in-depth theoretical analysis' is absent.

Review complete

Assessment at a glance

evolutionary computation (surrogate-assisted expensive optimization)

6

risk flags identified

● high 0

● medium 4

● low 2

Reproducibility readinessmedium
Code & data availablenot stated
Review confidencehigh

5 strengths · 5 weaknesses · 5 author questions

Levels reflect verification complexity — not a quality score. Evolve never rates your paper.

Key claims under review

  • TabPFN v2 outperforms GP and RBFN in prediction accuracy (RMSE) and rank correlation (Kendall's tau) on most CEC2017 functions at D=10, 30, 100 (Table I).
  • Higher predictive accuracy does not imply better optimization: at 1000D, TabPFN-based LSEO-S3 loses 0-5 to the RBFN version despite better subspace predictions, because RBFN's unbounded extrapolation provides implicit exploration while TabPFN regresses to the training mean (Tables V-VII).
  • On complex constraint landscapes absent from its pretraining prior, TabPFN suffers severe prediction-range compression that blurs feasible/infeasible boundaries, making it unreliable as a direct constraint surrogate (Tables VIII-IX).
  • TabPFN's usefulness as a surrogate is highly problem-dependent: it helps in offline settings with complex landscapes and sufficient data and in online small/medium-scale single-objective optimization, but hurts in mixed-variable, complex-constraint, large-scale extrapolation-heavy, and data-scarce online settings.
  • Direct surrogate substitution is insufficient; TabPFN requires customized model management (e.g., exploration-oriented infill criteria) and role-specific algorithm design.

Strengths

  • Unusually broad scenario coverage under a controlled substitution protocol

    Section IV swaps TabPFN into representative frameworks across offline (TT-DDEA), online single-objective (MGP-SLPSO), 1000D large-scale (LSEO-S3), constrained (DSI), multi/many-objective (KTA2, KTS), combinatorial (SAEAPRG, 12 datasets up to D=10,000), mixed-variable (SHEALED), and an EvoGym engineering case, mostly with 25 independent runs (Tables II-XV).

  • Diagnosis beyond predictive accuracy yields the paper's most valuable insight

    Table VI vs V shows TabPFN has better RMSE/tau in 100D subspaces yet loses 0-5 at 1000D; Table VII quantifies the mechanism - RBFN's cubic kernel extrapolates without bound (implicit exploration) while TabPFN anchors to the training-label mean under distribution shift. This cleanly explains why accuracy alone does not predict optimization success.

  • Quantified failure mode for constraint surrogates

  • Role-specific ablation isolates where TabPFN fails within one framework

  • Actionable, operational guidelines

Weaknesses

  • Exactly one baseline framework per scenario limits external validity

  • Baseline surrogate set is narrow

  • Theoretical analysis promised but absent

  • Inconsistent multiple-comparison control

  • Reproducibility and cost-analysis gaps

Full Review Report

$1.99 · one-time

Unlock the complete preliminary analysis Evolve produced for this paper.

  • All 5 strengths & 5 weaknesses, analyzed in detail
  • 6 risk flags with severity, section & reviewer questions
  • Methods & statistical evidence assessment
  • 5 questions a peer reviewer would ask
  • Full six-dimension evaluation report & recommendations

One-time purchase · this paper only

One-time purchase, this paper only. AI-generated preliminary analysis — not peer review.

Frequently asked questions

Does TabPFN work better than Gaussian processes as a surrogate for expensive evolutionary optimization?

Not universally. This benchmark finds TabPFN v2 predicts better than GP and RBFN on most CEC2017 functions and strongly improves an online single-objective surrogate-assisted algorithm (82 vs 5 wins), but it loses badly in 1000-dimensional large-scale optimization (0/5), on complex nonlinear constraints (8/10 losses), and in mixed-variable problems (3/21 losses), and underperforms in online runs starting from only ~20 evaluated samples. The authors recommend using it selectively based on data availability, landscape complexity, and the surrogate's role in the algorithm.

Why can a more accurate surrogate model lead to worse optimization results?

The paper demonstrates this concretely: in 1000D optimization, TabPFN is more accurate than RBFN in the low-dimensional subspaces being modeled, yet the RBFN-based algorithm wins all 5 test problems. The mechanism (Table VII) is that when query points move far from the training data, RBFN's cubic kernel extrapolates without bound - producing extreme (sometimes implausibly good) predictions that implicitly drive exploration - while TabPFN stays anchored near the mean of the training labels. Under candidate selection that picks minimum predicted values, the 'inaccurate' extrapolation acts as a free exploration mechanism, so better accuracy does not translate into better search.

When should you avoid using TabPFN as a surrogate model?

According to this study, avoid TabPFN when: (1) constraints are highly irregular or strongly nonlinear, because its predicted range collapses (down to 1.63% of the training range on problem c08), blurring feasible/infeasible boundaries; (2) the problem is mixed-variable, where a Gower-distance RBFN variant predicts better; (3) optimization requires strong extrapolation far from training data (e.g., very large-scale problems); (4) the surrogate must be rebuilt extremely frequently (its fit cost exceeds RBFN's); and (5) online optimization starts with very few (tens of) evaluated samples.

Is code or data available for this TabPFN surrogate benchmark?

The paper text contains no code or data availability statement. It does specify hardware (GTX 1650, RTX 4090, RTX A6000 for timing), benchmark suites (CEC2017, CEC2013, CEC2006/2010, DTLZ1-4, CF1-10, EvoGym), run counts (25, or 5 for the robotics case), and the surrogate being TabPFN v2, but reproducing the many framework-integration experiments would require reimplementing the substitutions from scratch.

About this review

This is an AI-generated preliminary review by Evolve.Pub, produced from the openly available text of the paper. It is not peer review and does not represent the authors' views. The canonical record of the paper is at the publisher link above.

  • Figures 1-8 (architecture, 2D landscapes, convergence curves, time curves, robot pipeline) could not be inspected numerically from extracted text; related claims rely on captions and in-text descriptions.
  • Supplementary Table S-IV's layout is garbled in extraction, so per-function offline win counts were cross-checked against the main-text Table II totals rather than re-derived.
  • The abstract is truncated at the end of the extracted text (cut off mid-sentence after 'design ar').
  • GPU timing conclusions depend on Fig. 5 curves, whose exact values are not in the text.

Go deeper on this paper

Reproduce ResultsNot feasible for this paper — the core results cannot be re-derived by sandboxed code simulation.

Wrote a paper? Stress-test it before reviewers do.

Upload your manuscript for the same structured scrutiny — reasoning, statistics, evidence, figures, and reproducibility.

Scan your paper
Benchmarking Tabular Foundation Models as Surrogates in Expensive Evolutionary Optimization | Evolve.Pub