- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This article introduces TabEvo, which represents table learning models as a graph. Each part of the graph can learn data changes or make predictions on new datasets. It also uses nested cross-fitting to pass predictions between parts and then combines them for the final output. The first program is built by a LLM, and then it's improved through evolutionary search based on scores on development data. The final model combines several Gaussian process models, a residual learner, a module for handling duplicates, and CatBoost. The authors tested TabEvo on 95 datasets and compared it with 45 benchmark settings. They also ran extra tests to study the different parts of the method, analyzed failure cases, and tested the function that automatically removes unnecessary parts of the program.
Critical strengths
1.TabEvo turns tabular learning into a program that can be changed and checked. It also clearly separates the steps used to train and test the model. 2.TabEvo performs well without pretraining on finished tasks. It also allows tests under different conditions and removes parts of the program that are not needed.
Critical weaknesses
1.TabEvo doesn't show how much the search method improves results beyond the strong starting program and manual changes. 2.TabEvo doesn't show a clear advantage over standard stacking when we consider failed runs, training costs, and similar Gaussian process models.
Questions for authors
- Compared to the first program and manual tweaks, what extra improvements can search find?
- When both use similar components, can a meta-DAG do better than regular stacking?
- Considering failed runs and training costs, does this advantage still hold for new tasks?
Thank you for the careful reading and precise questions. We address each with results and paper references.
Q1. What does search add beyond the seed and manual changes?
The seed is itself produced by TabEvo's first stage: an LLM agent grows a minimal genome through accepted edits (Sec. 2.3). The separate construction experiment places the final program +2.22 points [0.84, 3.82] above a single exact GP with the same head on 15 development tables (Table 20).
Evolution then adds a direct CatBoost lane and its fitting rule. The final program shares the seed's head, nodes and other edges (Table 18). On 23 completed fresh regression tables, this addition yields +0.60 R2 points [0.12, 1.44], with 20 wins, 2 ties and 1 loss. On all 24 tables, failures scored as worst, the gain remains +0.58 [0.12, 1.40]; both Holm p<.001 (Table 60). Fresh classification accuracy changes by +0.06 [−0.05, +0.17] (Sec. 4).
The manual intervention restored the seed's non-negative head after a ridge-headed candidate transferred poorly; the CatBoost lane came from evolution. These results come from one evolutionary run with 51 evaluated children (Sec. 2.3).
Q2. Can a meta-DAG outperform stacking with similar components?
Stack-TD combines tuned CatBoost, LightGBM, and RealMLP using the same stacking head as TabEvo. On fresh tables both methods completed, TabEvo was within on regression led by +0.64 points [+0.09, +1.26]. Adding an exact ARD GP to the stack narrowed the gap to +0.24 points [−0.28, +0.63] on 17 common completed tables. The GP alone trailed TabEvo by 3.54 points and lost on all 23 paired tables. Stack-TD + GP uses similar components, but it is not a flat stack of every TabEvo block (Tables 1 and 60).
The advantage was clearer in the controlled noise-feature experiment. With 500 training rows, 2,000 features (only five informative), and three data seeds, TabEvo retained R2=0.86, versus 0.75 for Stack-TD, 0.67 for CatBoost, and 0.33–0.39 for tabular foundation models (§5.1).
In short, TabEvo was close to a strong stack on real tables and retained more predictive accuracy when most features were noise
Q3. Do gains survive failures and training costs on new tasks?
Regression quality gains survive failure accounting. Across all 24 fresh regression tables, TabEvo leads bagged CatBoost by +1.36 [0.29, 2.47], Holm p=.028, and bagged LightGBM by +1.37 [0.52, 2.21], Holm p=.001 (Table 60).
Against Stack-TD + GP, the failure-inclusive margin is +2.14 [0.21, 4.79], Holm p=.035: TabEvo completes 23/24 tables versus 18/24 for the stack. This reflects better completion alongside comparable quality on common completed tables. Against plain Stack-TD, +0.40 [−0.31, +1.10] does not meet the pre-registered practical-advantage criterion. On classification, failures give Stack-TD a 1.06-point lead [0.09, 2.56] (Table 59).
The full program is expensive: median fit+predict is 646 s over 46 completed TabArena fits on an H100 slot, versus 20 s for TabICLv2 and 21 s for bagged CatBoost on 8 CPU threads (Table 62; different completed-table sets). The evolutionary run used an estimated 46 GPU-hours and 18.6 M LLM tokens, excluding seed development but the frozen graph is then reused without rerunning search (App. D.6).
Program editability provides a measured cost–quality trade-off. The profile–edit–test loop cuts 23 edges to 12 and achieves 6.5× speed-up on development tables, at score 0.7894 versus 0.7896. On fresh classification, the pruned program completes 23/26 tables, takes a median 49 s, and loses 0.3 accuracy points with no detected change in ROC-AUC or log-loss (Sec. 5.3, App. F.5).
Without pretraining, TabEvo is within one point of seven of nine foundation models on completed fresh classification tables and level with the strongest trained models. On 23 fresh regression tables it averages R2=0.713, ahead of individual trained models on average and ~one point behind the newest foundation models. Its interpretability is that of an explicit, inspectable and editable program: gates explain repeated-row behavior (Sec. 5.1), blocks can be ablated (Table 2), and edit-and-test halved the graph without changing development score. We hope this addresses your questions.