{"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/hyperparameter-optimization","name":"Hyperparameter Optimization","slug":"hyperparameter-optimization","description_markdown":"**Hyperparameter Optimization** is the problem of choosing a set of optimal hyperparameters for a learning algorithm. Whether the algorithm is suitable for the data directly depends on hyperparameters, which directly influence overfitting or underfitting. Each model requires different assumptions, weights or training speeds for different types of data under the conditions of a given loss function.\r\n\r\n\r\n<span class=\"description-source\">Source: [Data-driven model for fracturing design optimization: focus on building digital database and production forecast ](https://arxiv.org/abs/1910.14499)</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":813,"papers_with_code":339,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":3,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/hyperparameter-optimization-on-bayesmark","slug":"hyperparameter-optimization-on-bayesmark","dataset":"Bayesmark","dataset_url":null,"rows_in_archive":2,"metrics":["Mean"],"first_row_in_archive_order":{"model":"HEBO","paper_title":"HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisation","paper_url":"/paper/hebo-heteroscedastic-evolutionary-bayesian","paper_date":"2020-12-07","arxiv_id":"2012.03826","code_links":[{"title":"huawei-noah/hebo","url":"https://github.com/huawei-noah/hebo"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/BO/HEBO"},{"title":"huawei-noah/noah-research","url":"https://github.com/huawei-noah/noah-research/tree/master/HEBO"}],"syntology":null}}],"datasets":[{"url":"/dataset/nas-bench-201","name":"NAS-Bench-201","full_name":"","num_papers_in_archive":260},{"url":"/dataset/nas-bench-101","name":"NAS-Bench-101","full_name":"","num_papers_in_archive":152},{"url":"/dataset/pmlb","name":"PMLB","full_name":"Penn Machine Learning Benchmarks","num_papers_in_archive":42}],"subtasks":[],"parent_tasks":[{"url":"/task/automl","name":"AutoML"}],"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":9,"rows_per_page":100,"shown":100,"of":813,"of_with_code":339,"tagged_in_all":813,"counts":{"archive_papers_tagged":813,"with_a_code_link":339,"where_syntology_ran_a_sample":90,"not_listed_spam_title":0,"listed":813,"listed_where_code_ran":90,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":73,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":73,"listed_every_run_a_failure_of_syntologys_instrument":17,"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/hyperband-a-novel-bandit-based-approach-to","slug":"hyperband-a-novel-bandit-based-approach-to","title":"Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization","date":"2016-03-21","arxiv_id":"1603.06560","repositories_listed":17,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/hyperband-a-novel-bandit-based-approach-to#ran","syntology_url":"https://syntology.ai/paper/1603.06560","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.06560"}},"official":null}},{"url":"/paper/a-tutorial-on-bayesian-optimization-of","slug":"a-tutorial-on-bayesian-optimization-of","title":"A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning","date":"2010-12-12","arxiv_id":"1012.2599","repositories_listed":15,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-tutorial-on-bayesian-optimization-of#ran","syntology_url":"https://syntology.ai/paper/1012.2599","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1012.2599"}},"official":null}},{"url":"/paper/optuna-a-next-generation-hyperparameter","slug":"optuna-a-next-generation-hyperparameter","title":"Optuna: A Next-generation Hyperparameter Optimization Framework","date":"2019-07-25","arxiv_id":"1907.10902","repositories_listed":11,"syntology":{"n":20,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/optuna-a-next-generation-hyperparameter#ran","syntology_url":"https://syntology.ai/paper/1907.10902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10902"}},"official":{"repos":["pfnet/optuna"],"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/optimizing-millions-of-hyperparameters-by","slug":"optimizing-millions-of-hyperparameters-by","title":"Optimizing Millions of Hyperparameters by Implicit Differentiation","date":"2019-11-06","arxiv_id":"1911.02590","repositories_listed":9,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/optimizing-millions-of-hyperparameters-by#ran","syntology_url":"https://syntology.ai/paper/1911.02590","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.02590"}},"official":null}},{"url":"/paper/are-gans-created-equal-a-large-scale-study","slug":"are-gans-created-equal-a-large-scale-study","title":"Are GANs Created Equal? A Large-Scale Study","date":"2017-11-28","arxiv_id":"1711.10337","repositories_listed":9,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/are-gans-created-equal-a-large-scale-study#ran","syntology_url":"https://syntology.ai/paper/1711.10337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.10337"}},"official":{"repos":["google/compare_gan"],"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/a-tutorial-on-bayesian-optimization","slug":"a-tutorial-on-bayesian-optimization","title":"A Tutorial on Bayesian Optimization","date":"2018-07-08","arxiv_id":"1807.02811","repositories_listed":7,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-tutorial-on-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/1807.02811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.02811"}},"official":{"repos":["wujian16/Cornell-MOE"],"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/massively-parallel-hyperparameter-tuning","slug":"massively-parallel-hyperparameter-tuning","title":"A System for Massively Parallel Hyperparameter Tuning","date":"2018-10-13","arxiv_id":"1810.05934","repositories_listed":6,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/massively-parallel-hyperparameter-tuning#ran","syntology_url":"https://syntology.ai/paper/1810.05934","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.05934"}},"official":{"repos":["liamcli/darts_asha"],"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/optimal-hyperparameters-for-deep-lstm","slug":"optimal-hyperparameters-for-deep-lstm","title":"Optimal Hyperparameters for Deep LSTM-Networks for Sequence Labeling Tasks","date":"2017-07-21","arxiv_id":"1707.06799","repositories_listed":6,"syntology":null},{"url":"/paper/gpt-takes-the-bar-exam","slug":"gpt-takes-the-bar-exam","title":"GPT Takes the Bar Exam","date":"2022-12-29","arxiv_id":"2212.14402","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/single-headed-attention-rnn-stop-thinking","slug":"single-headed-attention-rnn-stop-thinking","title":"Single Headed Attention RNN: Stop Thinking With Your Head","date":"2019-11-26","arxiv_id":"1911.11423","repositories_listed":5,"syntology":null},{"url":"/paper/nystrom-method-for-accurate-and-scalable","slug":"nystrom-method-for-accurate-and-scalable","title":"Nystrom Method for Accurate and Scalable Implicit Differentiation","date":"2023-02-20","arxiv_id":"2302.09726","repositories_listed":4,"syntology":null},{"url":"/paper/random-search-and-reproducibility-for-neural","slug":"random-search-and-reproducibility-for-neural","title":"Random Search and Reproducibility for Neural Architecture Search","date":"2019-02-20","arxiv_id":"1902.07638","repositories_listed":4,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"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) · 5 unverified","sample_list":"/paper/random-search-and-reproducibility-for-neural#ran","syntology_url":"https://syntology.ai/paper/1902.07638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07638"}},"official":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/tune-a-research-platform-for-distributed","slug":"tune-a-research-platform-for-distributed","title":"Tune: A Research Platform for Distributed Model Selection and Training","date":"2018-07-13","arxiv_id":"1807.05118","repositories_listed":4,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"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) · 4 unverified","sample_list":"/paper/tune-a-research-platform-for-distributed#ran","syntology_url":"https://syntology.ai/paper/1807.05118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.05118"}},"official":null}},{"url":"/paper/bohb-robust-and-efficient-hyperparameter","slug":"bohb-robust-and-efficient-hyperparameter","title":"BOHB: Robust and Efficient Hyperparameter Optimization at Scale","date":"2018-07-04","arxiv_id":"1807.01774","repositories_listed":4,"syntology":null},{"url":"/paper/scalable-bayesian-optimization-using-deep","slug":"scalable-bayesian-optimization-using-deep","title":"Scalable Bayesian Optimization Using Deep Neural Networks","date":"2015-02-19","arxiv_id":"1502.05700","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/scalable-bayesian-optimization-using-deep#ran","syntology_url":"https://syntology.ai/paper/1502.05700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1502.05700"}},"official":null}},{"url":"/paper/practical-bayesian-optimization-of-machine","slug":"practical-bayesian-optimization-of-machine","title":"Practical Bayesian Optimization of Machine Learning Algorithms","date":"2012-06-13","arxiv_id":"1206.2944","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/hyperparameter-optimization-for-randomized","slug":"hyperparameter-optimization-for-randomized","title":"Hyperparameter Optimization for Randomized Algorithms: A Case Study on Random Features","date":"2024-06-30","arxiv_id":"2407.00584","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/cost-effective-hyperparameter-optimization","slug":"cost-effective-hyperparameter-optimization","title":"Cost-Effective Hyperparameter Optimization for Large Language Model Generation Inference","date":"2023-03-08","arxiv_id":"2303.04673","repositories_listed":3,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":9,"phrase":"6 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cost-effective-hyperparameter-optimization#ran","syntology_url":"https://syntology.ai/paper/2303.04673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.04673"}},"official":{"repos":["microsoft/FLAML"],"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/fednest-federated-bilevel-minimax-and","slug":"fednest-federated-bilevel-minimax-and","title":"FedNest: Federated Bilevel, Minimax, and Compositional Optimization","date":"2022-05-04","arxiv_id":"2205.02215","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fednest-federated-bilevel-minimax-and#ran","syntology_url":"https://syntology.ai/paper/2205.02215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.02215"}},"official":{"repos":["ucr-optml/FedNest"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","named_in_paper"]}}},{"url":"/paper/hebo-heteroscedastic-evolutionary-bayesian","slug":"hebo-heteroscedastic-evolutionary-bayesian","title":"HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisation","date":"2020-12-07","arxiv_id":"2012.03826","repositories_listed":3,"syntology":null},{"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/bananas-bayesian-optimization-with-neural","slug":"bananas-bayesian-optimization-with-neural","title":"BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture Search","date":"2019-10-25","arxiv_id":"1910.11858","repositories_listed":3,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bananas-bayesian-optimization-with-neural#ran","syntology_url":"https://syntology.ai/paper/1910.11858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11858"}},"official":{"repos":["naszilla/bananas","naszilla/naszilla"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/self-tuning-networks-bilevel-optimization-of","slug":"self-tuning-networks-bilevel-optimization-of","title":"Self-Tuning Networks: Bilevel Optimization of Hyperparameters using Structured Best-Response Functions","date":"2019-03-07","arxiv_id":"1903.03088","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/online-learning-rate-adaptation-with","slug":"online-learning-rate-adaptation-with","title":"Online Learning Rate Adaptation with Hypergradient Descent","date":"2017-03-14","arxiv_id":"1703.04782","repositories_listed":3,"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":0,"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/online-learning-rate-adaptation-with#ran","syntology_url":"https://syntology.ai/paper/1703.04782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.04782"}},"official":{"repos":["gbaydin/hypergradient-descent"],"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/global-optimization-of-lipschitz-functions","slug":"global-optimization-of-lipschitz-functions","title":"Global optimization of Lipschitz functions","date":"2017-03-07","arxiv_id":"1703.02628","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/global-optimization-of-lipschitz-functions#ran","syntology_url":"https://syntology.ai/paper/1703.02628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.02628"}},"official":null}},{"url":"/paper/forward-and-reverse-gradient-based","slug":"forward-and-reverse-gradient-based","title":"Forward and Reverse Gradient-Based Hyperparameter Optimization","date":"2017-03-06","arxiv_id":"1703.01785","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/forward-and-reverse-gradient-based#ran","syntology_url":"https://syntology.ai/paper/1703.01785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01785"}},"official":{"repos":["lucfra/FAR-HO","lucfra/RFHO"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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/recursive-gaussian-process-state-space-model","slug":"recursive-gaussian-process-state-space-model","title":"Recursive Gaussian Process State Space Model","date":"2024-11-22","arxiv_id":"2411.14679","repositories_listed":2,"syntology":null},{"url":"/paper/reshuffling-resampling-splits-can-improve","slug":"reshuffling-resampling-splits-can-improve","title":"Reshuffling Resampling Splits Can Improve Generalization of Hyperparameter Optimization","date":"2024-05-24","arxiv_id":"2405.15393","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":0,"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/reshuffling-resampling-splits-can-improve#ran","syntology_url":"https://syntology.ai/paper/2405.15393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15393"}},"official":{"repos":["slds-lmu/paper_2024_reshuffling","sumny/reshuffling"],"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/in-context-freeze-thaw-bayesian-optimization","slug":"in-context-freeze-thaw-bayesian-optimization","title":"In-Context Freeze-Thaw Bayesian Optimization for Hyperparameter Optimization","date":"2024-04-25","arxiv_id":"2404.16795","repositories_listed":2,"syntology":{"n":11,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/in-context-freeze-thaw-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/2404.16795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.16795"}},"official":{"repos":["huggingface.co/spaces/herilalaina/ifbo"],"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":["named_in_paper"]}}},{"url":"/paper/streamlining-ocean-dynamics-modeling-with","slug":"streamlining-ocean-dynamics-modeling-with","title":"Streamlining Ocean Dynamics Modeling with Fourier Neural Operators: A Multiobjective Hyperparameter and Architecture Optimization Approach","date":"2024-04-07","arxiv_id":"2404.05768","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/streamlining-ocean-dynamics-modeling-with#ran","syntology_url":"https://syntology.ai/paper/2404.05768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.05768"}},"official":null}},{"url":"/paper/where-did-the-gap-go-reassessing-the-long","slug":"where-did-the-gap-go-reassessing-the-long","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","date":"2023-09-01","arxiv_id":"2309.00367","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":4,"n_no_contract":2,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 4 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/where-did-the-gap-go-reassessing-the-long#ran","syntology_url":"https://syntology.ai/paper/2309.00367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00367"}},"official":{"repos":["toenshoff/lrgb"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/priorband-practical-hyperparameter-1","slug":"priorband-practical-hyperparameter-1","title":"PriorBand: Practical Hyperparameter Optimization in the Age of Deep Learning","date":"2023-06-21","arxiv_id":"2306.12370","repositories_listed":2,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/priorband-practical-hyperparameter-1#ran","syntology_url":"https://syntology.ai/paper/2306.12370","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.12370"}},"official":{"repos":["automl/mf-prior-exp"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/pytorch-hyperparameter-tuning-a-tutorial-for","slug":"pytorch-hyperparameter-tuning-a-tutorial-for","title":"PyTorch Hyperparameter Tuning - A Tutorial for spotPython","date":"2023-05-19","arxiv_id":"2305.11930","repositories_listed":2,"syntology":null},{"url":"/paper/scaling-down-to-scale-up-a-guide-to-parameter","slug":"scaling-down-to-scale-up-a-guide-to-parameter","title":"Scaling Down to Scale Up: A Guide to Parameter-Efficient Fine-Tuning","date":"2023-03-28","arxiv_id":"2303.15647","repositories_listed":2,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/scaling-down-to-scale-up-a-guide-to-parameter#ran","syntology_url":"https://syntology.ai/paper/2303.15647","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.15647"}},"official":{"repos":["guitaricet/peft_comparison"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/window-size-selection-in-unsupervised-time","slug":"window-size-selection-in-unsupervised-time","title":"Window Size Selection in Unsupervised Time Series Analytics: A Review and Benchmark","date":"2023-02-04","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/data-driven-model-identification-via","slug":"data-driven-model-identification-via","title":"Model Parameter Identification via a Hyperparameter Optimization Scheme for Autonomous Racing Systems","date":"2023-01-04","arxiv_id":"2301.01470","repositories_listed":2,"syntology":null},{"url":"/paper/pyhopper-hyperparameter-optimization","slug":"pyhopper-hyperparameter-optimization","title":"PyHopper -- Hyperparameter optimization","date":"2022-10-10","arxiv_id":"2210.04728","repositories_listed":2,"syntology":null},{"url":"/paper/start-small-think-big-on-hyperparameter","slug":"start-small-think-big-on-hyperparameter","title":"Start Small, Think Big: On Hyperparameter Optimization for Large-Scale Knowledge Graph Embeddings","date":"2022-07-11","arxiv_id":"2207.04979","repositories_listed":2,"syntology":null},{"url":"/paper/omicselector-automatic-feature-selection-and","slug":"omicselector-automatic-feature-selection-and","title":"OmicSelector: automatic feature selection and deep learning modeling for omic experiments","date":"2022-06-02","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/generative-adversarial-neural-operators","slug":"generative-adversarial-neural-operators","title":"Generative Adversarial Neural Operators","date":"2022-05-06","arxiv_id":"2205.03017","repositories_listed":2,"syntology":null},{"url":"/paper/visual-speech-recognition-for-multiple","slug":"visual-speech-recognition-for-multiple","title":"Visual Speech Recognition for Multiple Languages in the Wild","date":"2022-02-26","arxiv_id":"2202.13084","repositories_listed":2,"syntology":null},{"url":"/paper/bilevel-optimization-with-a-lower-level","slug":"bilevel-optimization-with-a-lower-level","title":"Bilevel Optimization with a Lower-level Contraction: Optimal Sample Complexity without Warm-start","date":"2022-02-07","arxiv_id":"2202.03397","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"8 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bilevel-optimization-with-a-lower-level#ran","syntology_url":"https://syntology.ai/paper/2202.03397","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03397"}},"official":{"repos":["csml-iit-ucl/bioptexps"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/benchml-an-extensible-pipelining-framework","slug":"benchml-an-extensible-pipelining-framework","title":"BenchML: an extensible pipelining framework for benchmarking representations of materials and molecules at scale","date":"2021-12-04","arxiv_id":"2112.02287","repositories_listed":2,"syntology":null},{"url":"/paper/personalized-benchmarking-with-the-ludwig","slug":"personalized-benchmarking-with-the-ludwig","title":"Personalized Benchmarking with the Ludwig Benchmarking Toolkit","date":"2021-11-08","arxiv_id":"2111.04260","repositories_listed":2,"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/personalized-benchmarking-with-the-ludwig#ran","syntology_url":"https://syntology.ai/paper/2111.04260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04260"}},"official":{"repos":["ludwig-ai/ludwig"],"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/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/reproducible-radiomics-through-automated","slug":"reproducible-radiomics-through-automated","title":"An automated machine learning framework to optimize radiomics model construction validated on twelve clinical applications","date":"2021-08-19","arxiv_id":"2108.08618","repositories_listed":2,"syntology":null},{"url":"/paper/multi-objective-asynchronous-successive","slug":"multi-objective-asynchronous-successive","title":"Multi-objective Asynchronous Successive Halving","date":"2021-06-23","arxiv_id":"2106.12639","repositories_listed":2,"syntology":null},{"url":"/paper/shine-sharing-the-inverse-estimate-from-the","slug":"shine-sharing-the-inverse-estimate-from-the","title":"SHINE: SHaring the INverse Estimate from the forward pass for bi-level optimization and implicit models","date":"2021-06-01","arxiv_id":"2106.00553","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":0,"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/shine-sharing-the-inverse-estimate-from-the#ran","syntology_url":"https://syntology.ai/paper/2106.00553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00553"}},"official":{"repos":["zaccharieramzi/hoag","zaccharieramzi/shine"],"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/dehb-evolutionary-hyberband-for-scalable","slug":"dehb-evolutionary-hyberband-for-scalable","title":"DEHB: Evolutionary Hyperband for Scalable, Robust and Efficient Hyperparameter Optimization","date":"2021-05-20","arxiv_id":"2105.09821","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/dehb-evolutionary-hyberband-for-scalable#ran","syntology_url":"https://syntology.ai/paper/2105.09821","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.09821"}},"official":{"repos":["automl/DEHB"],"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/promoting-fairness-through-hyperparameter","slug":"promoting-fairness-through-hyperparameter","title":"Promoting Fairness through Hyperparameter Optimization","date":"2021-03-23","arxiv_id":"2103.12715","repositories_listed":2,"syntology":null},{"url":"/paper/re-learning-memory-guided-normality-for","slug":"re-learning-memory-guided-normality-for","title":"[Re] Learning Memory Guided Normality for Anomaly Detection","date":"2021-01-29","arxiv_id":"2101.12382","repositories_listed":2,"syntology":null},{"url":"/paper/warm-starting-cma-es-for-hyperparameter","slug":"warm-starting-cma-es-for-hyperparameter","title":"Warm Starting CMA-ES for Hyperparameter Optimization","date":"2020-12-13","arxiv_id":"2012.06932","repositories_listed":2,"syntology":null},{"url":"/paper/provably-faster-algorithms-for-bilevel-1","slug":"provably-faster-algorithms-for-bilevel-1","title":"Bilevel Optimization: Convergence Analysis and Enhanced Design","date":"2020-10-15","arxiv_id":"2010.07962","repositories_listed":2,"syntology":{"n":18,"n_ran":14,"n_constructed":0,"n_ran_checked":7,"n_instrument":7,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 7 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/provably-faster-algorithms-for-bilevel-1#ran","syntology_url":"https://syntology.ai/paper/2010.07962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07962"}},"official":{"repos":["junjieyang97/stocbio_hp"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["listed","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/a-rigorous-machine-learning-analysis-pipeline","slug":"a-rigorous-machine-learning-analysis-pipeline","title":"A Rigorous Machine Learning Analysis Pipeline for Biomedical Binary Classification: Application in Pancreatic Cancer Nested Case-control Studies with Implications for Bias Assessments","date":"2020-08-28","arxiv_id":"2008.12829","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/multi-source-unsupervised-hyperparameter","slug":"multi-source-unsupervised-hyperparameter","title":"Efficient Hyperparameter Optimization under Multi-Source Covariate Shift","date":"2020-06-18","arxiv_id":"2006.10600","repositories_listed":2,"syntology":null},{"url":"/paper/local-search-is-state-of-the-art-for-nas","slug":"local-search-is-state-of-the-art-for-nas","title":"Exploring the Loss Landscape in Neural Architecture Search","date":"2020-05-06","arxiv_id":"2005.02960","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/local-search-is-state-of-the-art-for-nas#ran","syntology_url":"https://syntology.ai/paper/2005.02960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.02960"}},"official":{"repos":["naszilla/naszilla","realityengines/local_search"],"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/you-can-teach-an-old-dog-new-tricks-on","slug":"you-can-teach-an-old-dog-new-tricks-on","title":"You CAN Teach an Old Dog New Tricks! On Training Knowledge Graph Embeddings","date":"2020-05-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/one-shot-bayes-opt-with-probabilistic","slug":"one-shot-bayes-opt-with-probabilistic","title":"Provably Efficient Online Hyperparameter Optimization with Population-Based Bandits","date":"2020-02-06","arxiv_id":"2002.02518","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/one-shot-bayes-opt-with-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2002.02518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.02518"}},"official":{"repos":["jparkerholder/PB2"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/prior-specification-via-prior-predictive","slug":"prior-specification-via-prior-predictive","title":"Prior Specification for Bayesian Matrix Factorization via Prior Predictive Matching","date":"2019-10-27","arxiv_id":"1910.12263","repositories_listed":2,"syntology":null},{"url":"/paper/towards-modular-and-programmable-architecture","slug":"towards-modular-and-programmable-architecture","title":"Towards modular and programmable architecture search","date":"2019-09-30","arxiv_id":"1909.13404","repositories_listed":2,"syntology":{"n":16,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/towards-modular-and-programmable-architecture#ran","syntology_url":"https://syntology.ai/paper/1909.13404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.13404"}},"official":{"repos":["negrinho/deep_architect"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/gradient-descent-the-ultimate-optimizer","slug":"gradient-descent-the-ultimate-optimizer","title":"Gradient Descent: The Ultimate Optimizer","date":"2019-09-29","arxiv_id":"1909.13371","repositories_listed":2,"syntology":null},{"url":"/paper/190807896","slug":"190807896","title":"Enabling hyperparameter optimization in sequential autoencoders for spiking neural data","date":"2019-08-21","arxiv_id":"1908.07896","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/190807896#ran","syntology_url":"https://syntology.ai/paper/1908.07896","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07896"}},"official":{"repos":["snel-repo/lfads-cd"],"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/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/sharpdarts-faster-and-more-accurate","slug":"sharpdarts-faster-and-more-accurate","title":"sharpDARTS: Faster and More Accurate Differentiable Architecture Search","date":"2019-03-23","arxiv_id":"1903.09900","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":0,"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/sharpdarts-faster-and-more-accurate#ran","syntology_url":"https://syntology.ai/paper/1903.09900","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.09900"}},"official":{"repos":["ahundt/sharpDARTS"],"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/far-ho-a-bilevel-programming-package-for","slug":"far-ho-a-bilevel-programming-package-for","title":"Far-HO: A Bilevel Programming Package for Hyperparameter Optimization and Meta-Learning","date":"2018-06-13","arxiv_id":"1806.04941","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-factorized-hierarchical-variational","slug":"scalable-factorized-hierarchical-variational","title":"Scalable Factorized Hierarchical Variational Autoencoder Training","date":"2018-04-09","arxiv_id":"1804.03201","repositories_listed":2,"syntology":null},{"url":"/paper/scalable-meta-learning-for-bayesian","slug":"scalable-meta-learning-for-bayesian","title":"Practical Transfer Learning for Bayesian Optimization","date":"2018-02-06","arxiv_id":"1802.02219","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":0,"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/scalable-meta-learning-for-bayesian#ran","syntology_url":"https://syntology.ai/paper/1802.02219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.02219"}},"official":{"repos":["automl/transfer-hpo-framework"],"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/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/hyperparameter-importance-across-datasets","slug":"hyperparameter-importance-across-datasets","title":"Hyperparameter Importance Across Datasets","date":"2017-10-12","arxiv_id":"1710.04725","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hyperparameter-importance-across-datasets#ran","syntology_url":"https://syntology.ai/paper/1710.04725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.04725"}},"official":null}},{"url":"/paper/accelerating-neural-architecture-search-using","slug":"accelerating-neural-architecture-search-using","title":"Accelerating Neural Architecture Search using Performance Prediction","date":"2017-05-30","arxiv_id":"1705.10823","repositories_listed":2,"syntology":null},{"url":"/paper/large-scale-evolution-of-image-classifiers","slug":"large-scale-evolution-of-image-classifiers","title":"Large-Scale Evolution of Image Classifiers","date":"2017-03-03","arxiv_id":"1703.01041","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/large-scale-evolution-of-image-classifiers#ran","syntology_url":"https://syntology.ai/paper/1703.01041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.01041"}},"official":null}},{"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/gradient-based-hyperparameter-optimization","slug":"gradient-based-hyperparameter-optimization","title":"Gradient-based Hyperparameter Optimization through Reversible Learning","date":"2015-02-11","arxiv_id":"1502.03492","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/hyperopt-a-python-library-for-optimizing-the","slug":"hyperopt-a-python-library-for-optimizing-the","title":"Hyperopt: A Python Library for Optimizing the Hyperparameters of Machine Learning Algorithms","date":"2013-12-12","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/peer-ranked-precision-creating-a-foundational","slug":"peer-ranked-precision-creating-a-foundational","title":"Peer-Ranked Precision: Creating a Foundational Dataset for Fine-Tuning Vision Models from DataSeeds' Annotated Imagery","date":"2025-06-06","arxiv_id":"2506.05673","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/polypose-localizing-deformable-anatomy-in-3d","slug":"polypose-localizing-deformable-anatomy-in-3d","title":"PolyPose: Localizing Deformable Anatomy in 3D from Sparse 2D X-ray Images using Polyrigid Transforms","date":"2025-05-25","arxiv_id":"2505.19256","repositories_listed":1,"syntology":null},{"url":"/paper/bensparx-a-robust-explainable-machine","slug":"bensparx-a-robust-explainable-machine","title":"BenSParX: A Robust Explainable Machine Learning Framework for Parkinson's Disease Detection from Bengali Conversational Speech","date":"2025-05-18","arxiv_id":"2505.12192","repositories_listed":1,"syntology":null},{"url":"/paper/2505-11210","slug":"2505-11210","title":"Minimizing False-Positive Attributions in Explanations of Non-Linear Models","date":"2025-05-16","arxiv_id":"2505.11210","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/2505-11210#ran","syntology_url":"https://syntology.ai/paper/2505.11210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.11210"}},"official":{"repos":["gjoelbye/patternlocal"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/a-critical-assessment-of-reinforcement","slug":"a-critical-assessment-of-reinforcement","title":"A critical assessment of reinforcement learning methods for microswimmer navigation in complex flows","date":"2025-05-08","arxiv_id":"2505.05525","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-augmented-pre-trained-language","slug":"knowledge-augmented-pre-trained-language","title":"Knowledge-augmented Pre-trained Language Models for Biomedical Relation Extraction","date":"2025-05-01","arxiv_id":"2505.00814","repositories_listed":1,"syntology":null},{"url":"/paper/hypercontroller-a-hyperparameter-controller","slug":"hypercontroller-a-hyperparameter-controller","title":"HyperController: A Hyperparameter Controller for Fast and Stable Training of Reinforcement Learning Neural Networks","date":"2025-04-27","arxiv_id":"2504.19382","repositories_listed":1,"syntology":null},{"url":"/paper/terratorch-the-geospatial-foundation-models","slug":"terratorch-the-geospatial-foundation-models","title":"TerraTorch: The Geospatial Foundation Models Toolkit","date":"2025-03-26","arxiv_id":"2503.20563","repositories_listed":1,"syntology":null},{"url":"/paper/hypernos-automated-and-parallel-library-for","slug":"hypernos-automated-and-parallel-library-for","title":"HyperNOs: Automated and Parallel Library for Neural Operators Research","date":"2025-03-23","arxiv_id":"2503.18087","repositories_listed":1,"syntology":null},{"url":"/paper/integration-of-nested-cross-validation","slug":"integration-of-nested-cross-validation","title":"Integration of nested cross-validation, automated hyperparameter optimization, high-performance computing to reduce and quantify the variance of test performance estimation of deep learning models","date":"2025-03-11","arxiv_id":"2503.08589","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/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/metade-evolving-differential-evolution-by","slug":"metade-evolving-differential-evolution-by","title":"MetaDE: Evolving Differential Evolution by Differential Evolution","date":"2025-02-13","arxiv_id":"2502.10470","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/metade-evolving-differential-evolution-by#ran","syntology_url":"https://syntology.ai/paper/2502.10470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.10470"}},"official":{"repos":["emi-group/metade"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperparameters-in-score-based-membership","slug":"hyperparameters-in-score-based-membership","title":"Hyperparameters in Score-Based Membership Inference Attacks","date":"2025-02-10","arxiv_id":"2502.06374","repositories_listed":1,"syntology":null}],"syntology_records":42,"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":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_where_code_ran":90,"papers_where_code_ran_first_page":"/task/hyperparameter-optimization/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":9,"url":"/task/hyperparameter-optimization/papers/2","json":"/task/hyperparameter-optimization/papers/2.json","rows":100},{"order":"archive","page":3,"of":9,"url":"/task/hyperparameter-optimization/papers/3","json":"/task/hyperparameter-optimization/papers/3.json","rows":100},{"order":"archive","page":4,"of":9,"url":"/task/hyperparameter-optimization/papers/4","json":"/task/hyperparameter-optimization/papers/4.json","rows":100},{"order":"archive","page":5,"of":9,"url":"/task/hyperparameter-optimization/papers/5","json":"/task/hyperparameter-optimization/papers/5.json","rows":100},{"order":"archive","page":6,"of":9,"url":"/task/hyperparameter-optimization/papers/6","json":"/task/hyperparameter-optimization/papers/6.json","rows":100},{"order":"archive","page":7,"of":9,"url":"/task/hyperparameter-optimization/papers/7","json":"/task/hyperparameter-optimization/papers/7.json","rows":100},{"order":"archive","page":8,"of":9,"url":"/task/hyperparameter-optimization/papers/8","json":"/task/hyperparameter-optimization/papers/8.json","rows":100},{"order":"archive","page":9,"of":9,"url":"/task/hyperparameter-optimization/papers/9","json":"/task/hyperparameter-optimization/papers/9.json","rows":13},{"order":"ran","page":1,"of":1,"url":"/task/hyperparameter-optimization/papers/ran/1","json":"/task/hyperparameter-optimization/papers/ran/1.json","rows":90}],"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":"5a982704fe04cca8eecceff40da4244cae331781bab609dd7ba2315206a5c0d4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}