{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/analysis-of-the-automl-challenge-series-2015","title":"Analysis of the AutoML Challenge Series 2015–2018","arxiv_id":null,"date":"2019-05-18","proceeding":"Springer Cham 2019 5","authors":["Isabelle Guyon","Lisheng Sun-Hosoya","Marc Boullé","Hugo Jair Escalante","Sergio Escalera","Zhengying Liu","Damir Jajetic","Bisakha Ray","Mehreen Saeed","Michèle Sebag","Alexander Statnikov","WeiWei Tu","Evelyne Viegas"],"abstract":"The ChaLearn AutoML Challenge (The authors are in alphabetical order of last name, except the first author who did most of the writing and the second author who produced most of the numerical analyses and plots.) (NIPS 2015 – ICML 2016) consisted of six rounds of a machine learning competition of progressive difficulty, subject to limited computational resources. It was followed by a one-round AutoML challenge (PAKDD 2018). The AutoML setting differs from former model selection/hyper-parameter selection challenges, such as the one we previously organized for NIPS 2006: the participants aim to develop fully automated and computationally efficient systems, capable of being trained and tested without human intervention, with code submission. This chapter analyzes the results of these competitions and provides details about the datasets, which were not revealed to the\r\nparticipants. The solutions of the winners are systematically benchmarked over all datasets of all rounds and compared with canonical machine learning algorithms available in scikit-learn. All materials discussed in this chapter (data and code) have\r\nbeen made publicly available at http://automl.chalearn.org/.","url_abs":"https://link.springer.com/chapter/10.1007/978-3-030-05318-5_10","url_pdf":"https://www.automl.org/wp-content/uploads/2019/05/AutoML_Book_Chapter10.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"automl","task_name":"AutoML"},{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"model-selection","task_name":"Model Selection"}],"methods":[],"datasets_introduced":[{"slug":"madeline","name":"Chalearn-AutoML-1","full_name":"Chalearn-AutoML-1"}],"methods_introduced":[],"results":[{"leaderboard":"/sota/automl-on-madeline","task":"AutoML","dataset":"Chalearn-AutoML-1","model":"aad_freiburg","rank_in_archive_order":1,"of":8,"metrics":{"Duration":"5942.22","Rank (AutoML5)":"1.60","Set1 (F1)":"0.7947","Set2 (PAC)":"0.4061","Set3 (AUC)":"0.5543","Set4 (ABS)":"0.2957","Set5 (BAC)":"0.5900"},"uses_additional_data":false},{"leaderboard":"/sota/automl-on-madeline","task":"AutoML","dataset":"Chalearn-AutoML-1","model":"djajetic","rank_in_archive_order":2,"of":8,"metrics":{"Duration":"5842.12","Rank (AutoML5)":"3.00","Set1 (F1)":"0.7531","Set2 (PAC)":"0.3905","Set3 (AUC)":"0.6875","Set4 (ABS)":"0.3067","Set5 (BAC)":"0.5517"},"uses_additional_data":false},{"leaderboard":"/sota/automl-on-madeline","task":"AutoML","dataset":"Chalearn-AutoML-1","model":"reference_ls","rank_in_archive_order":3,"of":8,"metrics":{"Duration":"5879.88","Rank (AutoML5)":"4.00","Set1 (F1)":"0.7062","Set2 (PAC)":"0.3708","Set3 (AUC)":"0.5384","Set4 (ABS)":"0.2856","Set5 (BAC)":"0.5580"},"uses_additional_data":false},{"leaderboard":"/sota/automl-on-madeline","task":"AutoML","dataset":"Chalearn-AutoML-1","model":"reference","rank_in_archive_order":4,"of":8,"metrics":{"Duration":"4416.40","Rank (AutoML5)":"4.40","Set1 (F1)":"0.7556","Set2 (PAC)":"0.0343","Set3 (AUC)":"0.2927","Set4 (ABS)":"0.2790","Set5 (BAC)":"0.5601"},"uses_additional_data":false},{"leaderboard":"/sota/automl-on-madeline","task":"AutoML","dataset":"Chalearn-AutoML-1","model":"abhishek4","rank_in_archive_order":5,"of":8,"metrics":{"Duration":"4353.45","Rank (AutoML5)":"4.60","Set1 (F1)":"0.7565","Set2 (PAC)":"0.0172","Set3 (AUC)":"0.2911","Set4 (ABS)":"0.2791","Set5 (BAC)":"0.5595"},"uses_additional_data":false},{"leaderboard":"/sota/automl-on-madeline","task":"AutoML","dataset":"Chalearn-AutoML-1","model":"postech.mlg_exbrain","rank_in_archive_order":6,"of":8,"metrics":{"Duration":"3343.64","Rank (AutoML5)":"5.20","Set1 (F1)":"0.7542","Set2 (PAC)":"0.2802","Set3 (AUC)":"0.3333","Set4 (ABS)":"0.1507","Set5 (BAC)":"0.5564"},"uses_additional_data":false},{"leaderboard":"/sota/automl-on-madeline","task":"AutoML","dataset":"Chalearn-AutoML-1","model":"reference_mb","rank_in_archive_order":7,"of":8,"metrics":{"Duration":"4889.14","Rank (AutoML5)":"5.20","Set1 (F1)":"0.7005","Set2 (PAC)":"0.3698","Set3 (AUC)":"0.6776","Set4 (ABS)":"0.2507","Set5 (BAC)":"0.4618"},"uses_additional_data":false},{"leaderboard":"/sota/automl-on-madeline","task":"AutoML","dataset":"Chalearn-AutoML-1","model":"marc.boulle","rank_in_archive_order":8,"of":8,"metrics":{"Duration":"4603.81","Rank (AutoML5)":"6.40","Set1 (F1)":"0.7005","Set2 (PAC)":"0.3698","Set3 (AUC)":"-1.0000","Set4 (ABS)":"0.2507","Set5 (BAC)":"0.4618"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"782acc3a4524b4bfdb3ae38a8adcfc991e44e3088cdf368a1b74d8188801566f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}