{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JN4QBOT7PPRW7PKUR3HIS2PLBV","short_pith_number":"pith:JN4QBOT7","schema_version":"1.0","canonical_sha256":"4b7900ba7f7be36fbd548ece8969eb0d6631faeff76bb0ba93a1dbf9bd543b8b","source":{"kind":"arxiv","id":"2007.04074","version":3},"attestation_state":"computed","paper":{"title":"Auto-Sklearn 2.0: Hands-free AutoML via Meta-Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Frank Hutter, Katharina Eggensperger, Marius Lindauer, Matthias Feurer, Stefan Falkner","submitted_at":"2020-07-08T12:41:03Z","abstract_excerpt":"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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2007.04074","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-07-08T12:41:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7f58966c0f74f408d225ae411d799015884c42348b437f11206c3c91d65a9844","abstract_canon_sha256":"8896f6fad428cde155e1b7924023ced2011ffc5f2e3e4128c842e5015c6af67e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:52.058866Z","signature_b64":"/3yOmYtl3AvuoN8Jl8bynfDeXjjizLcl2CJxZ55Zt+q4J7RVz8p5A+nJlEF+57rMJQmdb4tMxctuhaQz1SUpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b7900ba7f7be36fbd548ece8969eb0d6631faeff76bb0ba93a1dbf9bd543b8b","last_reissued_at":"2026-07-05T05:02:52.058387Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:52.058387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Auto-Sklearn 2.0: Hands-free AutoML via Meta-Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Frank Hutter, Katharina Eggensperger, Marius Lindauer, Matthias Feurer, Stefan Falkner","submitted_at":"2020-07-08T12:41:03Z","abstract_excerpt":"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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04074","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.04074/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2007.04074","created_at":"2026-07-05T05:02:52.058452+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.04074v3","created_at":"2026-07-05T05:02:52.058452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04074","created_at":"2026-07-05T05:02:52.058452+00:00"},{"alias_kind":"pith_short_12","alias_value":"JN4QBOT7PPRW","created_at":"2026-07-05T05:02:52.058452+00:00"},{"alias_kind":"pith_short_16","alias_value":"JN4QBOT7PPRW7PKU","created_at":"2026-07-05T05:02:52.058452+00:00"},{"alias_kind":"pith_short_8","alias_value":"JN4QBOT7","created_at":"2026-07-05T05:02:52.058452+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.07236","citing_title":"Counting voids and filaments: Betti Curves as a Powerful Probe for Cosmology","ref_index":75,"is_internal_anchor":false},{"citing_arxiv_id":"2207.01848","citing_title":"TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Second","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14526","citing_title":"DiffPhD: A Unified Differentiable Solver for Projective Heterogeneous Materials in Elastodynamics with Contact-Rich GPU-Acceleration","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06290","citing_title":"Data Language Models: A New Foundation Model Class for Tabular Data","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09791","citing_title":"Pioneer Agent: Continual Improvement of Small Language Models in Production","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JN4QBOT7PPRW7PKUR3HIS2PLBV","json":"https://pith.science/pith/JN4QBOT7PPRW7PKUR3HIS2PLBV.json","graph_json":"https://pith.science/api/pith-number/JN4QBOT7PPRW7PKUR3HIS2PLBV/graph.json","events_json":"https://pith.science/api/pith-number/JN4QBOT7PPRW7PKUR3HIS2PLBV/events.json","paper":"https://pith.science/paper/JN4QBOT7"},"agent_actions":{"view_html":"https://pith.science/pith/JN4QBOT7PPRW7PKUR3HIS2PLBV","download_json":"https://pith.science/pith/JN4QBOT7PPRW7PKUR3HIS2PLBV.json","view_paper":"https://pith.science/paper/JN4QBOT7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.04074&json=true","fetch_graph":"https://pith.science/api/pith-number/JN4QBOT7PPRW7PKUR3HIS2PLBV/graph.json","fetch_events":"https://pith.science/api/pith-number/JN4QBOT7PPRW7PKUR3HIS2PLBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JN4QBOT7PPRW7PKUR3HIS2PLBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JN4QBOT7PPRW7PKUR3HIS2PLBV/action/storage_attestation","attest_author":"https://pith.science/pith/JN4QBOT7PPRW7PKUR3HIS2PLBV/action/author_attestation","sign_citation":"https://pith.science/pith/JN4QBOT7PPRW7PKUR3HIS2PLBV/action/citation_signature","submit_replication":"https://pith.science/pith/JN4QBOT7PPRW7PKUR3HIS2PLBV/action/replication_record"}},"created_at":"2026-07-05T05:02:52.058452+00:00","updated_at":"2026-07-05T05:02:52.058452+00:00"}