{"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":"/task/automl","name":"AutoML","slug":"automl","description_markdown":"Automated Machine Learning (**AutoML**) is a general concept which covers diverse techniques for automated model learning including automatic data preprocessing, architecture search, and model selection.\nSource: Evaluating recommender systems for AI-driven data science (1905.09205)\n\n\n<span class=\"description-source\">Source: [CHOPT : Automated Hyperparameter Optimization Framework for Cloud-Based Machine Learning Platforms ](https://arxiv.org/abs/1810.03527)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":641,"papers_with_code":295,"benchmarks":4,"benchmark_tables_in_archive":4,"benchmark_tables_shown":4,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":9,"subtasks":3,"parent_tasks":0},"benchmarks":[{"leaderboard":"/sota/automl-on-madeline","slug":"automl-on-madeline","dataset":"Chalearn-AutoML-1","dataset_url":"/dataset/madeline","rows_in_archive":8,"metrics":["Rank (AutoML5)","Set1 (F1)","Set2 (PAC)","Set3 (AUC)","Set4 (ABS)","Set5 (BAC)","Duration"],"first_row_in_archive_order":{"model":"aad_freiburg","paper_title":"Analysis of the AutoML Challenge Series 2015–2018","paper_url":"/paper/analysis-of-the-automl-challenge-series-2015","paper_date":"2019-05-18","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/automl-on-breast-cancer-coimbra-data-set","slug":"automl-on-breast-cancer-coimbra-data-set","dataset":"Breast Cancer Coimbra Data Set","dataset_url":null,"rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Logistic Regression","paper_title":"OptiMindTune: A Multi-Agent Framework for Intelligent Hyperparameter Optimization","paper_url":"/paper/optimindtune-a-multi-agent-framework-for","paper_date":"2025-05-25","arxiv_id":"2505.19205","code_links":[{"title":"MeherBhaskar/OptiMindTune","url":"https://github.com/MeherBhaskar/OptiMindTune"}],"syntology":null}},{"leaderboard":"/sota/automl-on-ordinaldataset","slug":"automl-on-ordinaldataset","dataset":"OrdinalDataset","dataset_url":"/dataset/ordinaldataset","rows_in_archive":1,"metrics":["1:1 Accuracy"],"first_row_in_archive_order":{"model":"Zero-shot-BERT-SORT","paper_title":"BERT-Sort: A Zero-shot MLM Semantic Encoder on Ordinal Features for AutoML","paper_url":"/paper/bert-sort-a-zero-shot-mlm-semantic-encoder-on","paper_date":"2022-06-01","arxiv_id":null,"code_links":[{"title":"marscod/BERT-Sort","url":"https://github.com/marscod/BERT-Sort"}],"syntology":null}},{"leaderboard":"/sota/automl-on-wine","slug":"automl-on-wine","dataset":"Wine","dataset_url":"/dataset/wine","rows_in_archive":1,"metrics":["accuracy"],"first_row_in_archive_order":{"model":"Logistic Regression","paper_title":"OptiMindTune: A Multi-Agent Framework for Intelligent Hyperparameter Optimization","paper_url":"/paper/optimindtune-a-multi-agent-framework-for","paper_date":"2025-05-25","arxiv_id":"2505.19205","code_links":[{"title":"MeherBhaskar/OptiMindTune","url":"https://github.com/MeherBhaskar/OptiMindTune"}],"syntology":null}}],"datasets":[{"url":"/dataset/nas-bench-101","name":"NAS-Bench-101","full_name":"","num_papers_in_archive":152},{"url":"/dataset/medmnist","name":"MedMNIST","full_name":"","num_papers_in_archive":59},{"url":"/dataset/pmlb","name":"PMLB","full_name":"Penn Machine Learning Benchmarks","num_papers_in_archive":42},{"url":"/dataset/nas-bench-1shot1","name":"NAS-Bench-1Shot1","full_name":"","num_papers_in_archive":24},{"url":"/dataset/css10","name":"CSS10","full_name":"","num_papers_in_archive":22},{"url":"/dataset/wine","name":"Wine","full_name":"Wine Data Set","num_papers_in_archive":11},{"url":"/dataset/madeline","name":"Chalearn-AutoML-1","full_name":"Chalearn-AutoML-1","num_papers_in_archive":1},{"url":"/dataset/genotex","name":"GenoTEX","full_name":"An LLM Agent Benchmark for Automated Gene Expression Data Analysis","num_papers_in_archive":1},{"url":"/dataset/ordinaldataset","name":"OrdinalDataset","full_name":"Ordinal Encoding Data set","num_papers_in_archive":1}],"subtasks":[{"url":"/task/architecture-search","name":"Neural Architecture Search"},{"url":"/task/automated-feature-engineering","name":"Automated Feature Engineering"},{"url":"/task/hyperparameter-optimization","name":"Hyperparameter Optimization"}],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":7,"rows_per_page":100,"shown":100,"of":641,"of_with_code":295,"tagged_in_all":641,"counts":{"archive_papers_tagged":641,"with_a_code_link":295,"where_syntology_ran_a_sample":71,"not_listed_spam_title":0,"listed":641,"listed_where_code_ran":71,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":59,"every_run_a_failure_of_syntologys_instrument":12,"listed_with_a_run_with_no_instrument_failure":59,"listed_every_run_a_failure_of_syntologys_instrument":12,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/efficientdet-scalable-and-efficient-object","slug":"efficientdet-scalable-and-efficient-object","title":"EfficientDet: Scalable and Efficient Object Detection","date":"2019-11-20","arxiv_id":"1911.09070","repositories_listed":64,"syntology":{"n":70,"n_ran":55,"n_constructed":1,"n_ran_checked":48,"n_instrument":7,"n_unverified":15,"n_honours":4,"n_violates":0,"n_no_contract":44,"n_pointer_only":7,"phrase":"55 ran (of which 1 constructed an object rather than computing a result; 48 with no instrument failure: 4 honoured, 0 violated, 44 with no contract checked; 7 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/efficientdet-scalable-and-efficient-object#ran","syntology_url":"https://syntology.ai/paper/1911.09070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09070"}},"official":{"repos":["google/automl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/efficientnetv2-smaller-models-and-faster","slug":"efficientnetv2-smaller-models-and-faster","title":"EfficientNetV2: Smaller Models and Faster Training","date":"2021-04-01","arxiv_id":"2104.00298","repositories_listed":26,"syntology":{"n":79,"n_ran":55,"n_constructed":14,"n_ran_checked":43,"n_instrument":12,"n_unverified":24,"n_honours":11,"n_violates":0,"n_no_contract":32,"n_pointer_only":13,"phrase":"55 ran (of which 14 constructed an object rather than computing a result; 43 with no instrument failure: 11 honoured, 0 violated, 32 with no contract checked; 12 where Syntology's instrument failed) · 24 unverified","sample_list":"/paper/efficientnetv2-smaller-models-and-faster#ran","syntology_url":"https://syntology.ai/paper/2104.00298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.00298"}},"official":{"repos":["google/automl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"url":"/paper/mixnet-mixed-depthwise-convolutional-kernels","slug":"mixnet-mixed-depthwise-convolutional-kernels","title":"MixConv: Mixed Depthwise Convolutional Kernels","date":"2019-07-22","arxiv_id":"1907.09595","repositories_listed":13,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mixnet-mixed-depthwise-convolutional-kernels#ran","syntology_url":"https://syntology.ai/paper/1907.09595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.09595"}},"official":{"repos":["tensorflow/tpu"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/auto-keras-efficient-neural-architecture","slug":"auto-keras-efficient-neural-architecture","title":"Auto-Keras: An Efficient Neural Architecture Search System","date":"2018-06-27","arxiv_id":"1806.10282","repositories_listed":13,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/auto-keras-efficient-neural-architecture#ran","syntology_url":"https://syntology.ai/paper/1806.10282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.10282"}},"official":null}},{"url":"/paper/amc-automl-for-model-compression-and","slug":"amc-automl-for-model-compression-and","title":"AMC: AutoML for Model Compression and Acceleration on Mobile Devices","date":"2018-02-10","arxiv_id":"1802.03494","repositories_listed":12,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/amc-automl-for-model-compression-and#ran","syntology_url":"https://syntology.ai/paper/1802.03494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03494"}},"official":{"repos":["mit-han-lab/amc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/once-for-all-train-one-network-and-specialize","slug":"once-for-all-train-one-network-and-specialize","title":"Once-for-All: Train One Network and Specialize it for Efficient Deployment","date":"2019-08-26","arxiv_id":"1908.09791","repositories_listed":10,"syntology":{"n":34,"n_ran":24,"n_constructed":0,"n_ran_checked":19,"n_instrument":5,"n_unverified":10,"n_honours":1,"n_violates":1,"n_no_contract":17,"n_pointer_only":8,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 1 violated, 17 with no contract checked; 5 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/once-for-all-train-one-network-and-specialize#ran","syntology_url":"https://syntology.ai/paper/1908.09791","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09791"}},"official":{"repos":["mit-han-lab/once-for-all"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/the-machine-learning-bazaar-harnessing-the-ml","slug":"the-machine-learning-bazaar-harnessing-the-ml","title":"The Machine Learning Bazaar: Harnessing the ML Ecosystem for Effective System Development","date":"2019-05-22","arxiv_id":"1905.08942","repositories_listed":8,"syntology":null},{"url":"/paper/meta-learning-a-real-time-tabular-automl","slug":"meta-learning-a-real-time-tabular-automl","title":"TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Second","date":"2022-07-05","arxiv_id":"2207.01848","repositories_listed":7,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-learning-a-real-time-tabular-automl#ran","syntology_url":"https://syntology.ai/paper/2207.01848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.01848"}},"official":null}},{"url":"/paper/autogluon-tabular-robust-and-accurate-automl","slug":"autogluon-tabular-robust-and-accurate-automl","title":"AutoGluon-Tabular: Robust and Accurate AutoML for Structured Data","date":"2020-03-13","arxiv_id":"2003.06505","repositories_listed":7,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/autogluon-tabular-robust-and-accurate-automl#ran","syntology_url":"https://syntology.ai/paper/2003.06505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.06505"}},"official":{"repos":["Innixma/autogluon-benchmarking"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["listed"]}}},{"url":"/paper/retrieve-merge-predict-augmenting-tables-with","slug":"retrieve-merge-predict-augmenting-tables-with","title":"Retrieve, Merge, Predict: Augmenting Tables with Data Lakes","date":"2024-02-09","arxiv_id":"2402.06282","repositories_listed":5,"syntology":null},{"url":"/paper/mfes-hb-efficient-hyperband-with-multi","slug":"mfes-hb-efficient-hyperband-with-multi","title":"MFES-HB: Efficient Hyperband with Multi-Fidelity Quality Measurements","date":"2020-12-05","arxiv_id":"2012.03011","repositories_listed":5,"syntology":null},{"url":"/paper/auto-sklearn-2-0-the-next-generation","slug":"auto-sklearn-2-0-the-next-generation","title":"Auto-Sklearn 2.0: Hands-free AutoML via Meta-Learning","date":"2020-07-08","arxiv_id":"2007.04074","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/auto-sklearn-2-0-the-next-generation#ran","syntology_url":"https://syntology.ai/paper/2007.04074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04074"}},"official":{"repos":["automl/ASKL2.0_experiments"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/safe-ml-surrogate-assisted-feature-extraction","slug":"safe-ml-surrogate-assisted-feature-extraction","title":"SAFE ML: Surrogate Assisted Feature Extraction for Model Learning","date":"2019-02-28","arxiv_id":"1902.11035","repositories_listed":4,"syntology":null},{"url":"/paper/benchmarking-automatic-machine-learning","slug":"benchmarking-automatic-machine-learning","title":"Benchmarking Automatic Machine Learning Frameworks","date":"2018-08-17","arxiv_id":"1808.06492","repositories_listed":4,"syntology":null},{"url":"/paper/lemur-neural-network-dataset-towards-seamless","slug":"lemur-neural-network-dataset-towards-seamless","title":"LEMUR Neural Network Dataset: Towards Seamless AutoML","date":"2025-04-14","arxiv_id":"2504.10552","repositories_listed":3,"syntology":null},{"url":"/paper/tabrepo-a-large-scale-repository-of-tabular","slug":"tabrepo-a-large-scale-repository-of-tabular","title":"TabRepo: A Large Scale Repository of Tabular Model Evaluations and its AutoML Applications","date":"2023-11-06","arxiv_id":"2311.02971","repositories_listed":3,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tabrepo-a-large-scale-repository-of-tabular#ran","syntology_url":"https://syntology.ai/paper/2311.02971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02971"}},"official":{"repos":["autogluon/autogluon","autogluon/tabrepo"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/autogluon-timeseries-automl-for-probabilistic","slug":"autogluon-timeseries-automl-for-probabilistic","title":"AutoGluon-TimeSeries: AutoML for Probabilistic Time Series Forecasting","date":"2023-08-10","arxiv_id":"2308.05566","repositories_listed":3,"syntology":null},{"url":"/paper/automl-two-sample-test","slug":"automl-two-sample-test","title":"AutoML Two-Sample Test","date":"2022-06-17","arxiv_id":"2206.08843","repositories_listed":3,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":2,"n_instrument":8,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 8 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/automl-two-sample-test#ran","syntology_url":"https://syntology.ai/paper/2206.08843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08843"}},"official":{"repos":["antoninschrab/fl-mmdagg","jmkuebler/auto-tst","jmkuebler/automl-tst-paper"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/medmnist-v2-a-large-scale-lightweight","slug":"medmnist-v2-a-large-scale-lightweight","title":"MedMNIST v2 -- A large-scale lightweight benchmark for 2D and 3D biomedical image classification","date":"2021-10-27","arxiv_id":"2110.14795","repositories_listed":3,"syntology":null},{"url":"/paper/lightautoml-automl-solution-for-a-large","slug":"lightautoml-automl-solution-for-a-large","title":"LightAutoML: AutoML Solution for a Large Financial Services Ecosystem","date":"2021-09-03","arxiv_id":"2109.01528","repositories_listed":3,"syntology":null},{"url":"/paper/volcanoml-speeding-up-end-to-end-automl-via","slug":"volcanoml-speeding-up-end-to-end-automl-via","title":"VolcanoML: Speeding up End-to-End AutoML via Scalable Search Space Decomposition","date":"2021-07-19","arxiv_id":"2107.08861","repositories_listed":3,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/volcanoml-speeding-up-end-to-end-automl-via#ran","syntology_url":"https://syntology.ai/paper/2107.08861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.08861"}},"official":{"repos":["PKU-DAIR/mindware"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/autosf-towards-automatic-scoring-function","slug":"autosf-towards-automatic-scoring-function","title":"Bilinear Scoring Function Search for Knowledge Graph Learning","date":"2021-07-01","arxiv_id":"2107.00184","repositories_listed":3,"syntology":null},{"url":"/paper/efficient-relation-aware-scoring-function","slug":"efficient-relation-aware-scoring-function","title":"Efficient Relation-aware Scoring Function Search for Knowledge Graph Embedding","date":"2021-04-22","arxiv_id":"2104.10880","repositories_listed":3,"syntology":null},{"url":"/paper/rethinking-neural-operations-for-diverse","slug":"rethinking-neural-operations-for-diverse","title":"Rethinking Neural Operations for Diverse Tasks","date":"2021-03-29","arxiv_id":"2103.15798","repositories_listed":3,"syntology":{"n":34,"n_ran":22,"n_constructed":8,"n_ran_checked":17,"n_instrument":5,"n_unverified":12,"n_honours":3,"n_violates":0,"n_no_contract":14,"n_pointer_only":1,"phrase":"22 ran (of which 8 constructed an object rather than computing a result; 17 with no instrument failure: 3 honoured, 0 violated, 14 with no contract checked; 5 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/rethinking-neural-operations-for-diverse#ran","syntology_url":"https://syntology.ai/paper/2103.15798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.15798"}},"official":{"repos":["mkhodak/relax","nick11roberts/XD"],"state":"official (archive's flag): 22 ran","n_ran":22,"n_constructed":8,"n_ran_no_instrument_failure":17,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-and-accurate-object-detection-via","slug":"robust-and-accurate-object-detection-via","title":"Robust and Accurate Object Detection via Adversarial Learning","date":"2021-03-23","arxiv_id":"2103.13886","repositories_listed":3,"syntology":null},{"url":"/paper/medmnist-classification-decathlon-a","slug":"medmnist-classification-decathlon-a","title":"MedMNIST Classification Decathlon: A Lightweight AutoML Benchmark for Medical Image Analysis","date":"2020-10-28","arxiv_id":"2010.14925","repositories_listed":3,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/medmnist-classification-decathlon-a#ran","syntology_url":"https://syntology.ai/paper/2010.14925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14925"}},"official":{"repos":["MedMNIST/MedMNIST"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/cardea-an-open-automated-machine-learning","slug":"cardea-an-open-automated-machine-learning","title":"Cardea: An Open Automated Machine Learning Framework for Electronic Health Records","date":"2020-10-01","arxiv_id":"2010.00509","repositories_listed":3,"syntology":null},{"url":"/paper/gama-a-general-automated-machine-learning","slug":"gama-a-general-automated-machine-learning","title":"GAMA: a General Automated Machine learning Assistant","date":"2020-07-09","arxiv_id":"2007.04911","repositories_listed":3,"syntology":{"n":17,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gama-a-general-automated-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2007.04911","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04911"}},"official":{"repos":["PGijsbers/gama"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/autogan-distiller-searching-to-compress","slug":"autogan-distiller-searching-to-compress","title":"AutoGAN-Distiller: Searching to Compress Generative Adversarial Networks","date":"2020-06-15","arxiv_id":"2006.08198","repositories_listed":3,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/autogan-distiller-searching-to-compress#ran","syntology_url":"https://syntology.ai/paper/2006.08198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08198"}},"official":{"repos":["TAMU-VITA/AGD"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/model-based-asynchronous-hyperparameter","slug":"model-based-asynchronous-hyperparameter","title":"Model-based Asynchronous Hyperparameter and Neural Architecture Search","date":"2020-03-24","arxiv_id":"2003.10865","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/model-based-asynchronous-hyperparameter#ran","syntology_url":"https://syntology.ai/paper/2003.10865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10865"}},"official":{"repos":["awslabs/syne-tune"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/automatically-optimized-gradient-boosting","slug":"automatically-optimized-gradient-boosting","title":"Automatically Optimized Gradient Boosting Trees for Classifying Large Volume High Cardinality Data Streams Under Concept Drift","date":"2019-11-30","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/searching-to-exploit-memorization-effect-in","slug":"searching-to-exploit-memorization-effect-in","title":"Searching to Exploit Memorization Effect in Learning from Corrupted Labels","date":"2019-11-06","arxiv_id":"1911.02377","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/searching-to-exploit-memorization-effect-in#ran","syntology_url":"https://syntology.ai/paper/1911.02377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02377"}},"official":null}},{"url":"/paper/autokge-searching-scoring-functions-for","slug":"autokge-searching-scoring-functions-for","title":"AutoSF: Searching Scoring Functions for Knowledge Graph Embedding","date":"2019-04-26","arxiv_id":"1904.11682","repositories_listed":3,"syntology":null},{"url":"/paper/automatic-gradient-boosting","slug":"automatic-gradient-boosting","title":"Automatic Gradient Boosting","date":"2018-07-10","arxiv_id":"1807.03873","repositories_listed":3,"syntology":null},{"url":"/paper/evaluation-of-a-tree-based-pipeline","slug":"evaluation-of-a-tree-based-pipeline","title":"Evaluation of a Tree-based Pipeline Optimization Tool for Automating Data Science","date":"2016-03-20","arxiv_id":"1603.06212","repositories_listed":3,"syntology":null},{"url":"/paper/capo-cost-aware-prompt-optimization","slug":"capo-cost-aware-prompt-optimization","title":"CAPO: Cost-Aware Prompt Optimization","date":"2025-04-22","arxiv_id":"2504.16005","repositories_listed":2,"syntology":null},{"url":"/paper/fix-fairness-don-t-ruin-accuracy-performance","slug":"fix-fairness-don-t-ruin-accuracy-performance","title":"Fix Fairness, Don't Ruin Accuracy: Performance Aware Fairness Repair using AutoML","date":"2023-06-15","arxiv_id":"2306.09297","repositories_listed":2,"syntology":null},{"url":"/paper/large-language-models-for-automated-data-1","slug":"large-language-models-for-automated-data-1","title":"Large Language Models for Automated Data Science: Introducing CAAFE for Context-Aware Automated Feature Engineering","date":"2023-05-05","arxiv_id":"2305.03403","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-language-models-for-automated-data-1#ran","syntology_url":"https://syntology.ai/paper/2305.03403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.03403"}},"official":{"repos":["automl/caafe"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/construction-of-hierarchical-neural-1","slug":"construction-of-hierarchical-neural-1","title":"Construction of Hierarchical Neural Architecture Search Spaces based on Context-free Grammars","date":"2022-11-03","arxiv_id":"2211.01842","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/construction-of-hierarchical-neural-1#ran","syntology_url":"https://syntology.ai/paper/2211.01842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01842"}},"official":{"repos":["automl/hierarchical_nas_construction"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fdb-fraud-dataset-benchmark","slug":"fdb-fraud-dataset-benchmark","title":"Fraud Dataset Benchmark and Applications","date":"2022-08-30","arxiv_id":"2208.14417","repositories_listed":2,"syntology":null},{"url":"/paper/amlb-an-automl-benchmark","slug":"amlb-an-automl-benchmark","title":"AMLB: an AutoML Benchmark","date":"2022-07-25","arxiv_id":"2207.12560","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/amlb-an-automl-benchmark#ran","syntology_url":"https://syntology.ai/paper/2207.12560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.12560"}},"official":{"repos":["openml/automlbenchmark"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/dc-bench-dataset-condensation-benchmark","slug":"dc-bench-dataset-condensation-benchmark","title":"DC-BENCH: Dataset Condensation Benchmark","date":"2022-07-20","arxiv_id":"2207.09639","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":3,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 3 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dc-bench-dataset-condensation-benchmark#ran","syntology_url":"https://syntology.ai/paper/2207.09639","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09639"}},"official":{"repos":["justincui03/dc_benchmark"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/active-learning-as-a-service-an-efficient","slug":"active-learning-as-a-service-an-efficient","title":"Active-Learning-as-a-Service: An Automatic and Efficient MLOps System for Data-Centric AI","date":"2022-07-19","arxiv_id":"2207.09109","repositories_listed":2,"syntology":null},{"url":"/paper/deepcave-an-interactive-analysis-tool-for","slug":"deepcave-an-interactive-analysis-tool-for","title":"DeepCAVE: An Interactive Analysis Tool for Automated Machine Learning","date":"2022-06-07","arxiv_id":"2206.03493","repositories_listed":2,"syntology":null},{"url":"/paper/deep-architecture-connectivity-matters-for","slug":"deep-architecture-connectivity-matters-for","title":"Deep Architecture Connectivity Matters for Its Convergence: A Fine-Grained Analysis","date":"2022-05-11","arxiv_id":"2205.05662","repositories_listed":2,"syntology":{"n":21,"n_ran":19,"n_constructed":0,"n_ran_checked":16,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":2,"n_no_contract":14,"n_pointer_only":2,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 2 violated, 14 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deep-architecture-connectivity-matters-for#ran","syntology_url":"https://syntology.ai/paper/2205.05662","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.05662"}},"official":{"repos":["chenwydj/architecture_convergence","vita-group/architecture_convergence"],"state":"official (archive's flag): 19 ran","n_ran":19,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/manas-mining-software-repositories-to-assist","slug":"manas-mining-software-repositories-to-assist","title":"Manas: Mining Software Repositories to Assist AutoML","date":"2021-12-06","arxiv_id":"2112.03395","repositories_listed":2,"syntology":null},{"url":"/paper/benchmarking-multimodal-automl-for-tabular","slug":"benchmarking-multimodal-automl-for-tabular","title":"Benchmarking Multimodal AutoML for Tabular Data with Text Fields","date":"2021-11-04","arxiv_id":"2111.02705","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchmarking-multimodal-automl-for-tabular#ran","syntology_url":"https://syntology.ai/paper/2111.02705","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.02705"}},"official":{"repos":["sxjscience/automl_multimodal_benchmark","awslabs/autogluon"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hpobench-a-collection-of-reproducible-multi","slug":"hpobench-a-collection-of-reproducible-multi","title":"HPOBench: A Collection of Reproducible Multi-Fidelity Benchmark Problems for HPO","date":"2021-09-14","arxiv_id":"2109.06716","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hpobench-a-collection-of-reproducible-multi#ran","syntology_url":"https://syntology.ai/paper/2109.06716","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06716"}},"official":{"repos":["automl/HpBandSter","automl/HPOBench"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/autoformer-searching-transformers-for-visual","slug":"autoformer-searching-transformers-for-visual","title":"AutoFormer: Searching Transformers for Visual Recognition","date":"2021-07-01","arxiv_id":"2107.00651","repositories_listed":2,"syntology":null},{"url":"/paper/automated-machine-learning-techniques-for","slug":"automated-machine-learning-techniques-for","title":"Automated Machine Learning Techniques for Data Streams","date":"2021-06-14","arxiv_id":"2106.07317","repositories_listed":2,"syntology":null},{"url":"/paper/autogl-a-library-for-automated-graph-learning","slug":"autogl-a-library-for-automated-graph-learning","title":"AutoGL: A Library for Automated Graph Learning","date":"2021-04-11","arxiv_id":"2104.04987","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/autogl-a-library-for-automated-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2104.04987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.04987"}},"official":{"repos":["THUMNLab/AutoGL","thumnlab/autogl-light"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/automated-machine-learning-on-graphs-a-survey","slug":"automated-machine-learning-on-graphs-a-survey","title":"Automated Machine Learning on Graphs: A Survey","date":"2021-03-01","arxiv_id":"2103.00742","repositories_listed":2,"syntology":null},{"url":"/paper/do-we-really-need-explicit-position-encodings","slug":"do-we-really-need-explicit-position-encodings","title":"Conditional Positional Encodings for Vision Transformers","date":"2021-02-22","arxiv_id":"2102.10882","repositories_listed":2,"syntology":null},{"url":"/paper/on-automatic-feasibility-study-for-machine","slug":"on-automatic-feasibility-study-for-machine","title":"Automatic Feasibility Study via Data Quality Analysis for ML: A Case-Study on Label Noise","date":"2020-10-16","arxiv_id":"2010.08410","repositories_listed":2,"syntology":null},{"url":"/paper/smooth-variational-graph-embeddings-for","slug":"smooth-variational-graph-embeddings-for","title":"Smooth Variational Graph Embeddings for Efficient Neural Architecture Search","date":"2020-10-09","arxiv_id":"2010.04683","repositories_listed":2,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/smooth-variational-graph-embeddings-for#ran","syntology_url":"https://syntology.ai/paper/2010.04683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04683"}},"official":{"repos":["automl/SVGe","jovitalukasik/SVGe"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperparameter-optimization-via-sequential","slug":"hyperparameter-optimization-via-sequential","title":"Hyperparameter Optimization via Sequential Uniform Designs","date":"2020-09-08","arxiv_id":"2009.03586","repositories_listed":2,"syntology":null},{"url":"/paper/on-hyperparameter-optimization-of-machine","slug":"on-hyperparameter-optimization-of-machine","title":"On Hyperparameter Optimization of Machine Learning Algorithms: Theory and Practice","date":"2020-07-30","arxiv_id":"2007.15745","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/on-hyperparameter-optimization-of-machine#ran","syntology_url":"https://syntology.ai/paper/2007.15745","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15745"}},"official":{"repos":["LiYangHart/Hyperparameter-Optimization-of-Machine-Learning-Algorithms"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/auto-pytorch-tabular-multi-fidelity","slug":"auto-pytorch-tabular-multi-fidelity","title":"Auto-PyTorch Tabular: Multi-Fidelity MetaLearning for Efficient and Robust AutoDL","date":"2020-06-24","arxiv_id":"2006.13799","repositories_listed":2,"syntology":null},{"url":"/paper/is-deep-learning-necessary-for-simple","slug":"is-deep-learning-necessary-for-simple","title":"Is deep learning necessary for simple classification tasks?","date":"2020-06-11","arxiv_id":"2006.06730","repositories_listed":2,"syntology":null},{"url":"/paper/lite-transformer-with-long-short-range","slug":"lite-transformer-with-long-short-range","title":"Lite Transformer with Long-Short Range Attention","date":"2020-04-24","arxiv_id":"2004.11886","repositories_listed":2,"syntology":null},{"url":"/paper/metapoison-practical-general-purpose-clean","slug":"metapoison-practical-general-purpose-clean","title":"MetaPoison: Practical General-purpose Clean-label Data Poisoning","date":"2020-04-01","arxiv_id":"2004.00225","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/metapoison-practical-general-purpose-clean#ran","syntology_url":"https://syntology.ai/paper/2004.00225","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.00225"}},"official":{"repos":["wronnyhuang/metapoison"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/dhp-differentiable-meta-pruning-via","slug":"dhp-differentiable-meta-pruning-via","title":"DHP: Differentiable Meta Pruning via HyperNetworks","date":"2020-03-30","arxiv_id":"2003.13683","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dhp-differentiable-meta-pruning-via#ran","syntology_url":"https://syntology.ai/paper/2003.13683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.13683"}},"official":{"repos":["ofsoundof/dhp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-n-cheap-an-automated-search-framework","slug":"deep-n-cheap-an-automated-search-framework","title":"Deep-n-Cheap: An Automated Search Framework for Low Complexity Deep Learning","date":"2020-03-27","arxiv_id":"2004.00974","repositories_listed":2,"syntology":null},{"url":"/paper/flo-fast-and-lightweight-hyperparameter","slug":"flo-fast-and-lightweight-hyperparameter","title":"FLAML: A Fast and Lightweight AutoML Library","date":"2019-11-12","arxiv_id":"1911.04706","repositories_listed":2,"syntology":null},{"url":"/paper/automl-using-metadata-language-embeddings","slug":"automl-using-metadata-language-embeddings","title":"AutoML using Metadata Language Embeddings","date":"2019-10-08","arxiv_id":"1910.03698","repositories_listed":2,"syntology":null},{"url":"/paper/neuraxle-a-python-framework-for-neat-machine","slug":"neuraxle-a-python-framework-for-neat-machine","title":"Neuraxle - A Python Framework for Neat Machine Learning Pipelines","date":"2019-09-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/moga-searching-beyond-mobilenetv3","slug":"moga-searching-beyond-mobilenetv3","title":"MoGA: Searching Beyond MobileNetV3","date":"2019-08-04","arxiv_id":"1908.01314","repositories_listed":2,"syntology":null},{"url":"/paper/automl-a-survey-of-the-state-of-the-art","slug":"automl-a-survey-of-the-state-of-the-art","title":"AutoML: A Survey of the State-of-the-Art","date":"2019-08-02","arxiv_id":"1908.00709","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/automl-a-survey-of-the-state-of-the-art#ran","syntology_url":"https://syntology.ai/paper/1908.00709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00709"}},"official":{"repos":["marsggbo/automl_a_survey_of_state_of_the_art"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/searching-for-interaction-functions-in","slug":"searching-for-interaction-functions-in","title":"Efficient Neural Interaction Function Search for Collaborative Filtering","date":"2019-06-28","arxiv_id":"1906.12091","repositories_listed":2,"syntology":null},{"url":"/paper/190600170","slug":"190600170","title":"Automated Machine Learning with Monte-Carlo Tree Search","date":"2019-06-01","arxiv_id":"1906.00170","repositories_listed":2,"syntology":null},{"url":"/paper/improved-training-speed-accuracy-and-data","slug":"improved-training-speed-accuracy-and-data","title":"Improved Training Speed, Accuracy, and Data Utilization Through Loss Function Optimization","date":"2019-05-27","arxiv_id":"1905.11528","repositories_listed":2,"syntology":null},{"url":"/paper/towards-automatically-tuned-deep-neural","slug":"towards-automatically-tuned-deep-neural","title":"Towards Automatically-Tuned Deep Neural Networks","date":"2019-05-18","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/metapruning-meta-learning-for-automatic","slug":"metapruning-meta-learning-for-automatic","title":"MetaPruning: Meta Learning for Automatic Neural Network Channel Pruning","date":"2019-03-25","arxiv_id":"1903.10258","repositories_listed":2,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/metapruning-meta-learning-for-automatic#ran","syntology_url":"https://syntology.ai/paper/1903.10258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.10258"}},"official":{"repos":["liuzechun/MetaPruning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/atm-a-distributed-collaborative-scalable","slug":"atm-a-distributed-collaborative-scalable","title":"ATM: A distributed, collaborative, scalable system for automated machine learning","date":"2017-12-11","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/imbalanced-learn-a-python-toolbox-to-tackle","slug":"imbalanced-learn-a-python-toolbox-to-tackle","title":"Imbalanced-learn: A Python Toolbox to Tackle the Curse of Imbalanced Datasets in Machine Learning","date":"2016-09-21","arxiv_id":"1609.06570","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/imbalanced-learn-a-python-toolbox-to-tackle#ran","syntology_url":"https://syntology.ai/paper/1609.06570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.06570"}},"official":{"repos":["scikit-learn-contrib/imbalanced-learn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-and-robust-automated-machine","slug":"efficient-and-robust-automated-machine","title":"Efficient and Robust Automated Machine Learning","date":"2015-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/hyperopt-sklearn-automatic-hyperparameter","slug":"hyperopt-sklearn-automatic-hyperparameter","title":"Hyperopt-Sklearn: Automatic Hyperparameter Configuration for Scikit-Learn","date":"2014-01-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/overtuning-in-hyperparameter-optimization","slug":"overtuning-in-hyperparameter-optimization","title":"Overtuning in Hyperparameter Optimization","date":"2025-06-24","arxiv_id":"2506.19540","repositories_listed":1,"syntology":null},{"url":"/paper/from-tiny-machine-learning-to-tiny-deep","slug":"from-tiny-machine-learning-to-tiny-deep","title":"From Tiny Machine Learning to Tiny Deep Learning: A Survey","date":"2025-06-21","arxiv_id":"2506.18927","repositories_listed":1,"syntology":null},{"url":"/paper/virnyflow-a-design-space-for-responsible","slug":"virnyflow-a-design-space-for-responsible","title":"VirnyFlow: A Design Space for Responsible Model Development","date":"2025-06-02","arxiv_id":"2506.01584","repositories_listed":1,"syntology":null},{"url":"/paper/optimindtune-a-multi-agent-framework-for","slug":"optimindtune-a-multi-agent-framework-for","title":"OptiMindTune: A Multi-Agent Framework for Intelligent Hyperparameter Optimization","date":"2025-05-25","arxiv_id":"2505.19205","repositories_listed":1,"syntology":null},{"url":"/paper/mlzero-a-multi-agent-system-for-end-to-end","slug":"mlzero-a-multi-agent-system-for-end-to-end","title":"MLZero: A Multi-Agent System for End-to-end Machine Learning Automation","date":"2025-05-20","arxiv_id":"2505.13941","repositories_listed":1,"syntology":null},{"url":"/paper/when-your-own-output-becomes-your-training","slug":"when-your-own-output-becomes-your-training","title":"When Your Own Output Becomes Your Training Data: Noise-to-Meaning Loops and a Formal RSI Trigger","date":"2025-05-05","arxiv_id":"2505.02888","repositories_listed":1,"syntology":null},{"url":"/paper/a-darts-stable-model-selection-for-data","slug":"a-darts-stable-model-selection-for-data","title":"A-DARTS: Stable Model Selection for Data Repair in Time Series","date":"2025-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/advances-and-challenges-in-foundation-agents","slug":"advances-and-challenges-in-foundation-agents","title":"Advances and Challenges in Foundation Agents: From Brain-Inspired Intelligence to Evolutionary, Collaborative, and Safe Systems","date":"2025-03-31","arxiv_id":"2504.01990","repositories_listed":1,"syntology":null},{"url":"/paper/quota-query-oriented-token-assignment-via-cot","slug":"quota-query-oriented-token-assignment-via-cot","title":"QuoTA: Query-oriented Token Assignment via CoT Query Decouple for Long Video Comprehension","date":"2025-03-11","arxiv_id":"2503.08689","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quota-query-oriented-token-assignment-via-cot#ran","syntology_url":"https://syntology.ai/paper/2503.08689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.08689"}},"official":{"repos":["mac-automl/quota"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/prior-fitted-networks-scale-to-larger","slug":"prior-fitted-networks-scale-to-larger","title":"Prior-Fitted Networks Scale to Larger Datasets When Treated as Weak Learners","date":"2025-03-03","arxiv_id":"2503.01256","repositories_listed":1,"syntology":null},{"url":"/paper/autoqml-a-framework-for-automated-quantum","slug":"autoqml-a-framework-for-automated-quantum","title":"AutoQML: A Framework for Automated Quantum Machine Learning","date":"2025-02-28","arxiv_id":"2502.21025","repositories_listed":1,"syntology":null},{"url":"/paper/enabling-automl-for-zero-touch-network","slug":"enabling-automl-for-zero-touch-network","title":"Enabling AutoML for Zero-Touch Network Security: Use-Case Driven Analysis","date":"2025-02-28","arxiv_id":"2502.21286","repositories_listed":1,"syntology":null},{"url":"/paper/towards-zero-touch-networks-cross-layer","slug":"towards-zero-touch-networks-cross-layer","title":"Towards Zero Touch Networks: Cross-Layer Automated Security Solutions for 6G Wireless Networks","date":"2025-02-28","arxiv_id":"2502.20627","repositories_listed":1,"syntology":null},{"url":"/paper/automl-for-multi-class-anomaly-compensation","slug":"automl-for-multi-class-anomaly-compensation","title":"AutoML for Multi-Class Anomaly Compensation of Sensor Drift","date":"2025-02-26","arxiv_id":"2502.19180","repositories_listed":1,"syntology":null},{"url":"/paper/i-mcts-enhancing-agentic-automl-via","slug":"i-mcts-enhancing-agentic-automl-via","title":"I-MCTS: Enhancing Agentic AutoML via Introspective Monte Carlo Tree Search","date":"2025-02-20","arxiv_id":"2502.14693","repositories_listed":1,"syntology":null},{"url":"/paper/flow-of-options-diversified-and-improved-llm","slug":"flow-of-options-diversified-and-improved-llm","title":"Flow-of-Options: Diversified and Improved LLM Reasoning by Thinking Through Options","date":"2025-02-18","arxiv_id":"2502.12929","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/flow-of-options-diversified-and-improved-llm#ran","syntology_url":"https://syntology.ai/paper/2502.12929","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.12929"}},"official":{"repos":["flagshippioneering/flow-of-options"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-automated-model-design-on-recommender","slug":"towards-automated-model-design-on-recommender","title":"Towards Automated Model Design on Recommender Systems","date":"2024-11-12","arxiv_id":"2411.07569","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-for-constructing-and","slug":"large-language-models-for-constructing-and","title":"Large Language Models for Constructing and Optimizing Machine Learning Workflows: A Survey","date":"2024-11-11","arxiv_id":"2411.10478","repositories_listed":1,"syntology":null},{"url":"/paper/autoproteinengine-a-large-language-model","slug":"autoproteinengine-a-large-language-model","title":"AutoProteinEngine: A Large Language Model Driven Agent Framework for Multimodal AutoML in Protein Engineering","date":"2024-11-07","arxiv_id":"2411.04440","repositories_listed":1,"syntology":null},{"url":"/paper/adaptoml-ux-an-adaptive-user-centered-gui","slug":"adaptoml-ux-an-adaptive-user-centered-gui","title":"AdaptoML-UX: An Adaptive User-centered GUI-based AutoML Toolkit for Non-AI Experts and HCI Researchers","date":"2024-10-22","arxiv_id":"2410.17469","repositories_listed":1,"syntology":null},{"url":"/paper/sela-tree-search-enhanced-llm-agents-for","slug":"sela-tree-search-enhanced-llm-agents-for","title":"SELA: Tree-Search Enhanced LLM Agents for Automated Machine Learning","date":"2024-10-22","arxiv_id":"2410.17238","repositories_listed":1,"syntology":null},{"url":"/paper/mamba4cast-efficient-zero-shot-time-series","slug":"mamba4cast-efficient-zero-shot-time-series","title":"Mamba4Cast: Efficient Zero-Shot Time Series Forecasting with State Space Models","date":"2024-10-12","arxiv_id":"2410.09385","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mamba4cast-efficient-zero-shot-time-series#ran","syntology_url":"https://syntology.ai/paper/2410.09385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.09385"}},"official":{"repos":["automl/mamba4cast"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/systematic-feature-design-for-cycle-life","slug":"systematic-feature-design-for-cycle-life","title":"Systematic Feature Design for Cycle Life Prediction of Lithium-Ion Batteries During Formation","date":"2024-10-09","arxiv_id":"2410.07458","repositories_listed":1,"syntology":null}],"syntology_records":36,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":1,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/automl-on-wine","since_archive":"/sota/automl-on-wine#since-judged","papers_judged":1,"placed":0}]},"papers_where_code_ran":71,"papers_where_code_ran_first_page":"/task/automl/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":7,"url":"/task/automl/papers/2","json":"/task/automl/papers/2.json","rows":100},{"order":"archive","page":3,"of":7,"url":"/task/automl/papers/3","json":"/task/automl/papers/3.json","rows":100},{"order":"archive","page":4,"of":7,"url":"/task/automl/papers/4","json":"/task/automl/papers/4.json","rows":100},{"order":"archive","page":5,"of":7,"url":"/task/automl/papers/5","json":"/task/automl/papers/5.json","rows":100},{"order":"archive","page":6,"of":7,"url":"/task/automl/papers/6","json":"/task/automl/papers/6.json","rows":100},{"order":"archive","page":7,"of":7,"url":"/task/automl/papers/7","json":"/task/automl/papers/7.json","rows":41},{"order":"ran","page":1,"of":1,"url":"/task/automl/papers/ran/1","json":"/task/automl/papers/ran/1.json","rows":71}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"3793a717193144d92fc5451833f2368c3457fd654de5bac7f10146efdb612351","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}