Pith. sign in

REVIEW 3 cited by

Auto-Sklearn 2.0: Hands-free AutoML via Meta-Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.04074 v3 pith:JN4QBOT7 submitted 2020-07-08 cs.LG stat.ML

classification cs.LGstat.ML
keywords automlauto-sklearndatasetshands-freelearningmachinemeta-learningposh
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Automated Machine Learning (AutoML) supports practitioners and researchers with the tedious task of designing machine learning pipelines and has recently achieved substantial success. In this paper, we introduce new AutoML approaches motivated by our winning submission to the second ChaLearn AutoML challenge. We develop PoSH Auto-sklearn, which enables AutoML systems to work well on large datasets under rigid time limits by using a new, simple and meta-feature-free meta-learning technique and by employing a successful bandit strategy for budget allocation. However, PoSH Auto-sklearn introduces even more ways of running AutoML and might make it harder for users to set it up correctly. Therefore, we also go one step further and study the design space of AutoML itself, proposing a solution towards truly hands-free AutoML. Together, these changes give rise to the next generation of our AutoML system, Auto-sklearn 2.0. We verify the improvements by these additions in an extensive experimental study on 39 AutoML benchmark datasets. We conclude the paper by comparing to other popular AutoML frameworks and Auto-sklearn 1.0, reducing the relative error by up to a factor of 4.5, and yielding a performance in 10 minutes that is substantially better than what Auto-sklearn 1.0 achieves within an hour.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TabFlex: Scaling Tabular Learning to Millions with Linear Attention

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Linear attention lets a TabPFN-style model process millions of tabular samples in seconds with near-identical accuracy on small datasets.

  2. Is Inter-Seed Cross-Play Enough? Evaluating the Robustness of Zero-Shot Coordination Algorithms to Implementation Details

    cs.AI 2026-08 conditional novelty 5.0 of 10

    For Other-Play in Yokai, agents trained with different implementation details coordinate across implementations about as well as across seeds, supporting inter-seed cross-play as a proxy for cross-implementation evaluation.

  3. Automated Data Engineering and Feature Selection for the Case Study of Warpage Detection in Fused Deposition Modeling

    cs.LG 2026-07 reject novelty 4.0 of 10

    An ADP bandit+SHAP pipeline for FDM warpage detection claims AUC 0.9248→0.9731, but reported rewards exceed the stated reward function's possible range and k-selection uses the test set.

Pith tools