{"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/papers/ran/1","list_of":"/task/hyperparameter-optimization","task":"Hyperparameter Optimization","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,90],"of":90,"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":75,"every_run_a_failure_of_syntologys_instrument":15,"listed_with_a_run_with_no_instrument_failure":75,"listed_every_run_a_failure_of_syntologys_instrument":15,"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"},"first_page":"/task/hyperparameter-optimization/papers/ran/1","prev":null,"next":null,"papers":[{"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/put-cash-on-bandits-a-max-k-armed-problem-for","slug":"put-cash-on-bandits-a-max-k-armed-problem-for","title":"Put CASH on Bandits: A Max K-Armed Problem for Automated Machine Learning","date":"2025-05-08","arxiv_id":"2505.05226","repositories_listed":0,"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":1,"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/put-cash-on-bandits-a-max-k-armed-problem-for#ran","syntology_url":"https://syntology.ai/paper/2505.05226","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.05226"}},"official":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/automating-data-science-pipelines-with-tensor","slug":"automating-data-science-pipelines-with-tensor","title":"Automating Data Science Pipelines with Tensor Completion","date":"2024-10-08","arxiv_id":"2410.06408","repositories_listed":1,"syntology":{"n":16,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":16,"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) · 11 unverified","sample_list":"/paper/automating-data-science-pipelines-with-tensor#ran","syntology_url":"https://syntology.ai/paper/2410.06408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06408"}},"official":{"repos":["shaanpakala/stc_automl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/archon-an-architecture-search-framework-for","slug":"archon-an-architecture-search-framework-for","title":"Archon: An Architecture Search Framework for Inference-Time Techniques","date":"2024-09-23","arxiv_id":"2409.15254","repositories_listed":1,"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/archon-an-architecture-search-framework-for#ran","syntology_url":"https://syntology.ai/paper/2409.15254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.15254"}},"official":{"repos":["scalingintelligence/archon"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/terrain-classification-enhanced-with","slug":"terrain-classification-enhanced-with","title":"Terrain Classification Enhanced with Uncertainty for Space Exploration Robots from Proprioceptive Data","date":"2024-07-03","arxiv_id":"2407.03241","repositories_listed":0,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/terrain-classification-enhanced-with#ran","syntology_url":"https://syntology.ai/paper/2407.03241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.03241"}},"official":null}},{"url":"/paper/a-data-centric-perspective-on-evaluating","slug":"a-data-centric-perspective-on-evaluating","title":"A Data-Centric Perspective on Evaluating Machine Learning Models for Tabular Data","date":"2024-07-02","arxiv_id":"2407.02112","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/a-data-centric-perspective-on-evaluating#ran","syntology_url":"https://syntology.ai/paper/2407.02112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02112"}},"official":{"repos":["atschalz/dc_tabeval"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-hyperparameter-optimization-with","slug":"improving-hyperparameter-optimization-with","title":"Improving Hyperparameter Optimization with Checkpointed Model Weights","date":"2024-06-26","arxiv_id":"2406.18630","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/improving-hyperparameter-optimization-with#ran","syntology_url":"https://syntology.ai/paper/2406.18630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18630"}},"official":{"repos":["nvlabs/forecasting-model-search"],"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/adapters-strike-back","slug":"adapters-strike-back","title":"Adapters Strike Back","date":"2024-06-10","arxiv_id":"2406.06820","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/adapters-strike-back#ran","syntology_url":"https://syntology.ai/paper/2406.06820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.06820"}},"official":{"repos":["visinf/adapter_plus"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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":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/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":1,"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/hyperparameter-optimization-can-even-be","slug":"hyperparameter-optimization-can-even-be","title":"Hyperparameter Optimization Can Even be Harmful in Off-Policy Learning and How to Deal with It","date":"2024-04-23","arxiv_id":"2404.15084","repositories_listed":0,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/hyperparameter-optimization-can-even-be#ran","syntology_url":"https://syntology.ai/paper/2404.15084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15084"}},"official":null}},{"url":"/paper/generalized-population-based-training-for","slug":"generalized-population-based-training-for","title":"Generalized Population-Based Training for Hyperparameter Optimization in Reinforcement Learning","date":"2024-04-12","arxiv_id":"2404.08233","repositories_listed":1,"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/generalized-population-based-training-for#ran","syntology_url":"https://syntology.ai/paper/2404.08233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.08233"}},"official":{"repos":["emi-group/gpbt-pl"],"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/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":3,"n_instrument":0,"n_unverified":1,"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) · 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/nonsmooth-implicit-differentiation","slug":"nonsmooth-implicit-differentiation","title":"Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Rates","date":"2024-03-18","arxiv_id":"2403.11687","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/nonsmooth-implicit-differentiation#ran","syntology_url":"https://syntology.ai/paper/2403.11687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11687"}},"official":{"repos":["prolearner/nonsmooth_implicit_diff"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bilevel-optimization-under-unbounded","slug":"bilevel-optimization-under-unbounded","title":"Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis","date":"2024-01-17","arxiv_id":"2401.09587","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 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) · 3 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/bilevel-optimization-under-unbounded#ran","syntology_url":"https://syntology.ai/paper/2401.09587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09587"}},"official":{"repos":["mingruiliu-ml-lab/bilevel-optimization-under-unbounded-smoothness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/using-large-language-models-for","slug":"using-large-language-models-for","title":"Using Large Language Models for Hyperparameter Optimization","date":"2023-12-07","arxiv_id":"2312.04528","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/using-large-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2312.04528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04528"}},"official":{"repos":["michaelrzhang/llm-hyperopt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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":8,"n_instrument":0,"n_unverified":0,"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) · 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/hodge-compositional-edge-gaussian-processes","slug":"hodge-compositional-edge-gaussian-processes","title":"Hodge-Compositional Edge Gaussian Processes","date":"2023-10-30","arxiv_id":"2310.19450","repositories_listed":1,"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/hodge-compositional-edge-gaussian-processes#ran","syntology_url":"https://syntology.ai/paper/2310.19450","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19450"}},"official":{"repos":["cookbook-ms/hodge-edge-gp"],"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/large-scale-gaussian-processes-via","slug":"large-scale-gaussian-processes-via","title":"Large-Scale Gaussian Processes via Alternating Projection","date":"2023-10-26","arxiv_id":"2310.17137","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/large-scale-gaussian-processes-via#ran","syntology_url":"https://syntology.ai/paper/2310.17137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.17137"}},"official":{"repos":["kayween/alternating-projection-for-gp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"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":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":2,"n_no_contract":6,"n_pointer_only":6,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 2 violated, 6 with no contract checked; 0 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":7,"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":17,"n_instrument":0,"n_unverified":1,"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) · 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":15,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/improving-hyperparameter-learning-under","slug":"improving-hyperparameter-learning-under","title":"Improving Hyperparameter Learning under Approximate Inference in Gaussian Process Models","date":"2023-06-07","arxiv_id":"2306.04201","repositories_listed":1,"syntology":{"n":19,"n_ran":18,"n_constructed":0,"n_ran_checked":18,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":18,"n_pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-hyperparameter-learning-under#ran","syntology_url":"https://syntology.ai/paper/2306.04201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04201"}},"official":{"repos":["aaltoml/improved-hyperparameter-learning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/stochastic-marginal-likelihood-gradients","slug":"stochastic-marginal-likelihood-gradients","title":"Stochastic Marginal Likelihood Gradients using Neural Tangent Kernels","date":"2023-06-06","arxiv_id":"2306.03968","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/stochastic-marginal-likelihood-gradients#ran","syntology_url":"https://syntology.ai/paper/2306.03968","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03968"}},"official":{"repos":["aleximmer/ntk-marglik"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperparameters-in-reinforcement-learning-and","slug":"hyperparameters-in-reinforcement-learning-and","title":"Hyperparameters in Reinforcement Learning and How To Tune Them","date":"2023-06-02","arxiv_id":"2306.01324","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"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, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hyperparameters-in-reinforcement-learning-and#ran","syntology_url":"https://syntology.ai/paper/2306.01324","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.01324"}},"official":{"repos":["facebookresearch/how-to-autorl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-three-regime-model-of-network-pruning","slug":"a-three-regime-model-of-network-pruning","title":"A Three-regime Model of Network Pruning","date":"2023-05-28","arxiv_id":"2305.18383","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-three-regime-model-of-network-pruning#ran","syntology_url":"https://syntology.ai/paper/2305.18383","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18383"}},"official":{"repos":["yefanzhou/threeregimepruning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pfns-are-flexible-models-for-real-world","slug":"pfns-are-flexible-models-for-real-world","title":"PFNs4BO: In-Context Learning for Bayesian Optimization","date":"2023-05-27","arxiv_id":"2305.17535","repositories_listed":1,"syntology":{"n":23,"n_ran":20,"n_constructed":7,"n_ran_checked":16,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":15,"n_pointer_only":0,"phrase":"20 ran (of which 7 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 1 violated, 15 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/pfns-are-flexible-models-for-real-world#ran","syntology_url":"https://syntology.ai/paper/2305.17535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17535"}},"official":{"repos":["automl/pfns4bo"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/ped-anova-efficiently-quantifying","slug":"ped-anova-efficiently-quantifying","title":"PED-ANOVA: Efficiently Quantifying Hyperparameter Importance in Arbitrary Subspaces","date":"2023-04-20","arxiv_id":"2304.10255","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/ped-anova-efficiently-quantifying#ran","syntology_url":"https://syntology.ai/paper/2304.10255","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.10255"}},"official":{"repos":["nabenabe0928/local-anova"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/autorl-hyperparameter-landscapes","slug":"autorl-hyperparameter-landscapes","title":"AutoRL Hyperparameter Landscapes","date":"2023-04-05","arxiv_id":"2304.02396","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/autorl-hyperparameter-landscapes#ran","syntology_url":"https://syntology.ai/paper/2304.02396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.02396"}},"official":{"repos":["automl/autorl-landscape"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/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":6,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":5,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 0 violated, 5 with no contract checked; 0 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/online-hyperparameter-optimization-for-class","slug":"online-hyperparameter-optimization-for-class","title":"Online Hyperparameter Optimization for Class-Incremental Learning","date":"2023-01-11","arxiv_id":"2301.05032","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/online-hyperparameter-optimization-for-class#ran","syntology_url":"https://syntology.ai/paper/2301.05032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.05032"}},"official":{"repos":["yaoyao-liu/online-hyperparameter-optimization"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperparameters-in-contextual-rl-are-highly","slug":"hyperparameters-in-contextual-rl-are-highly","title":"Hyperparameters in Contextual RL are Highly Situational","date":"2022-12-21","arxiv_id":"2212.10876","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hyperparameters-in-contextual-rl-are-highly#ran","syntology_url":"https://syntology.ai/paper/2212.10876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10876"}},"official":{"repos":["automl-private/crl_hpo"],"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/asynchronous-distributed-bilevel-optimization","slug":"asynchronous-distributed-bilevel-optimization","title":"Asynchronous Distributed Bilevel Optimization","date":"2022-12-20","arxiv_id":"2212.10048","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/asynchronous-distributed-bilevel-optimization#ran","syntology_url":"https://syntology.ai/paper/2212.10048","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.10048"}},"official":{"repos":["iclr23submission6251/adbo"],"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":["official"]}}},{"url":"/paper/pasha-efficient-hpo-with-progressive-resource","slug":"pasha-efficient-hpo-with-progressive-resource","title":"PASHA: Efficient HPO and NAS with Progressive Resource Allocation","date":"2022-07-14","arxiv_id":"2207.06940","repositories_listed":1,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/pasha-efficient-hpo-with-progressive-resource#ran","syntology_url":"https://syntology.ai/paper/2207.06940","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06940"}},"official":{"repos":["ondrejbohdal/pasha"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"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/p-bo-augmenting-acquisition-functions-with","slug":"p-bo-augmenting-acquisition-functions-with","title":"$π$BO: Augmenting Acquisition Functions with User Beliefs for Bayesian Optimization","date":"2022-04-23","arxiv_id":"2204.11051","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 3 unverified","sample_list":"/paper/p-bo-augmenting-acquisition-functions-with#ran","syntology_url":"https://syntology.ai/paper/2204.11051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11051"}},"official":null}},{"url":"/paper/min-max-bilevel-multi-objective-optimization","slug":"min-max-bilevel-multi-objective-optimization","title":"Min-Max Bilevel Multi-objective Optimization with Applications in Machine Learning","date":"2022-03-03","arxiv_id":"2203.01924","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/min-max-bilevel-multi-objective-optimization#ran","syntology_url":"https://syntology.ai/paper/2203.01924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.01924"}},"official":{"repos":["minimario/morbit"],"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":["found_in_text","official"]}}},{"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/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/evograd-efficient-gradient-based-meta","slug":"evograd-efficient-gradient-based-meta","title":"EvoGrad: Efficient Gradient-Based Meta-Learning and Hyperparameter Optimization","date":"2021-06-19","arxiv_id":"2106.10575","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 3 unverified","sample_list":"/paper/evograd-efficient-gradient-based-meta#ran","syntology_url":"https://syntology.ai/paper/2106.10575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10575"}},"official":{"repos":["ondrejbohdal/evograd"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["community","official"]}}},{"url":"/paper/an-empirical-study-on-hyperparameter","slug":"an-empirical-study-on-hyperparameter","title":"An Empirical Study on Hyperparameter Optimization for Fine-Tuning Pre-trained Language Models","date":"2021-06-17","arxiv_id":"2106.09204","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 3 unverified","sample_list":"/paper/an-empirical-study-on-hyperparameter#ran","syntology_url":"https://syntology.ai/paper/2106.09204","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09204"}},"official":{"repos":["microsoft/FLAML"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-nonmyopic-approach-to-cost-constrained","slug":"a-nonmyopic-approach-to-cost-constrained","title":"A Nonmyopic Approach to Cost-Constrained Bayesian Optimization","date":"2021-06-10","arxiv_id":"2106.06079","repositories_listed":1,"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/a-nonmyopic-approach-to-cost-constrained#ran","syntology_url":"https://syntology.ai/paper/2106.06079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06079"}},"official":{"repos":["ericlee0803/lookahead_release"],"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/stability-and-generalization-of-bilevel","slug":"stability-and-generalization-of-bilevel","title":"Stability and Generalization of Bilevel Programming in Hyperparameter Optimization","date":"2021-06-08","arxiv_id":"2106.04188","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/stability-and-generalization-of-bilevel#ran","syntology_url":"https://syntology.ai/paper/2106.04188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04188"}},"official":{"repos":["baofff/stability_ho"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/provably-faster-algorithms-for-bilevel","slug":"provably-faster-algorithms-for-bilevel","title":"Provably Faster Algorithms for Bilevel Optimization","date":"2021-06-08","arxiv_id":"2106.04692","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":2,"n_instrument":6,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/provably-faster-algorithms-for-bilevel#ran","syntology_url":"https://syntology.ai/paper/2106.04692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04692"}},"official":{"repos":["JunjieYang97/MRVRBO"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/k-mixup-regularization-for-deep-learning-via","slug":"k-mixup-regularization-for-deep-learning-via","title":"k-Mixup Regularization for Deep Learning via Optimal Transport","date":"2021-06-05","arxiv_id":"2106.02933","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/k-mixup-regularization-for-deep-learning-via#ran","syntology_url":"https://syntology.ai/paper/2106.02933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02933"}},"official":{"repos":["anminggu/kmixup-cifar10"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/implicit-differentiation-for-fast","slug":"implicit-differentiation-for-fast","title":"Implicit differentiation for fast hyperparameter selection in non-smooth convex learning","date":"2021-05-04","arxiv_id":"2105.01637","repositories_listed":1,"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/implicit-differentiation-for-fast#ran","syntology_url":"https://syntology.ai/paper/2105.01637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01637"}},"official":{"repos":["QB3/sparse-ho"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bag-of-baselines-for-multi-objective-joint","slug":"bag-of-baselines-for-multi-objective-joint","title":"Bag of Baselines for Multi-objective Joint Neural Architecture Search and Hyperparameter Optimization","date":"2021-05-03","arxiv_id":"2105.01015","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":5,"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, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bag-of-baselines-for-multi-objective-joint#ran","syntology_url":"https://syntology.ai/paper/2105.01015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.01015"}},"official":{"repos":["automl/multi-obj-baselines"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/one-billion-audio-sounds-from-gpu-enabled","slug":"one-billion-audio-sounds-from-gpu-enabled","title":"One Billion Audio Sounds from GPU-enabled Modular Synthesis","date":"2021-04-27","arxiv_id":"2104.12922","repositories_listed":1,"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/one-billion-audio-sounds-from-gpu-enabled#ran","syntology_url":"https://syntology.ai/paper/2104.12922","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12922"}},"official":{"repos":["torchsynth/torchsynth"],"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/overfitting-in-bayesian-optimization-an","slug":"overfitting-in-bayesian-optimization-an","title":"Automatic Termination for Hyperparameter Optimization","date":"2021-04-16","arxiv_id":"2104.08166","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/overfitting-in-bayesian-optimization-an#ran","syntology_url":"https://syntology.ai/paper/2104.08166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08166"}},"official":{"repos":["amazon-research/bo-early-stopping"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/delta-stn-efficient-bilevel-optimization-for","slug":"delta-stn-efficient-bilevel-optimization-for","title":"Delta-STN: Efficient Bilevel Optimization for Neural Networks using Structured Response Jacobians","date":"2020-10-26","arxiv_id":"2010.13514","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/delta-stn-efficient-bilevel-optimization-for#ran","syntology_url":"https://syntology.ai/paper/2010.13514","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13514"}},"official":{"repos":["pomonam/Self-Tuning-Networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hyperparameter-transfer-across-developer-1","slug":"hyperparameter-transfer-across-developer-1","title":"Hyperparameter Transfer Across Developer Adjustments","date":"2020-10-25","arxiv_id":"2010.13117","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/hyperparameter-transfer-across-developer-1#ran","syntology_url":"https://syntology.ai/paper/2010.13117","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13117"}},"official":{"repos":["hp-transfer/htaa_experiments"],"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/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/sample-efficient-automated-deep-reinforcement","slug":"sample-efficient-automated-deep-reinforcement","title":"Sample-Efficient Automated Deep Reinforcement Learning","date":"2020-09-03","arxiv_id":"2009.01555","repositories_listed":1,"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/sample-efficient-automated-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2009.01555","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.01555"}},"official":{"repos":["automl/SEARL"],"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/on-the-iteration-complexity-of-hypergradient","slug":"on-the-iteration-complexity-of-hypergradient","title":"On the Iteration Complexity of Hypergradient Computation","date":"2020-06-29","arxiv_id":"2006.16218","repositories_listed":1,"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":3,"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/on-the-iteration-complexity-of-hypergradient#ran","syntology_url":"https://syntology.ai/paper/2006.16218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.16218"}},"official":{"repos":["prolearner/hypertorch"],"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/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/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/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/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/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/scheduling-the-learning-rate-via-1","slug":"scheduling-the-learning-rate-via-1","title":"MARTHE: Scheduling the Learning Rate Via Online Hypergradients","date":"2019-10-18","arxiv_id":"1910.08525","repositories_listed":1,"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":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) · 5 unverified","sample_list":"/paper/scheduling-the-learning-rate-via-1#ran","syntology_url":"https://syntology.ai/paper/1910.08525","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.08525"}},"official":{"repos":["awslabs/adatune"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"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/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/deep-neural-network-hyperparameter","slug":"deep-neural-network-hyperparameter","title":"Deep Neural Network Hyperparameter Optimization with Orthogonal Array Tuning","date":"2019-07-31","arxiv_id":"1907.13359","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/deep-neural-network-hyperparameter#ran","syntology_url":"https://syntology.ai/paper/1907.13359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.13359"}},"official":{"repos":["xiangzhang1015/OATM"],"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/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/hyp-rl-hyperparameter-optimization-by","slug":"hyp-rl-hyperparameter-optimization-by","title":"Hyp-RL : Hyperparameter Optimization by Reinforcement Learning","date":"2019-06-27","arxiv_id":"1906.11527","repositories_listed":1,"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":3,"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/hyp-rl-hyperparameter-optimization-by#ran","syntology_url":"https://syntology.ai/paper/1906.11527","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.11527"}},"official":{"repos":["hadijomaa/HypRL"],"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/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/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/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/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/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/rafiki-machine-learning-as-an-analytics","slug":"rafiki-machine-learning-as-an-analytics","title":"Rafiki: Machine Learning as an Analytics Service System","date":"2018-04-17","arxiv_id":"1804.06087","repositories_listed":1,"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/rafiki-machine-learning-as-an-analytics#ran","syntology_url":"https://syntology.ai/paper/1804.06087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.06087"}},"official":null}},{"url":"/paper/reviving-and-improving-recurrent-back","slug":"reviving-and-improving-recurrent-back","title":"Reviving and Improving Recurrent Back-Propagation","date":"2018-03-16","arxiv_id":"1803.06396","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/reviving-and-improving-recurrent-back#ran","syntology_url":"https://syntology.ai/paper/1803.06396","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.06396"}},"official":{"repos":["lrjconan/RBP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-hyperparameter-optimization","slug":"stochastic-hyperparameter-optimization","title":"Stochastic Hyperparameter Optimization through Hypernetworks","date":"2018-02-26","arxiv_id":"1802.09419","repositories_listed":1,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/stochastic-hyperparameter-optimization#ran","syntology_url":"https://syntology.ai/paper/1802.09419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09419"}},"official":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/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/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/hyperparameter-optimization-a-spectral","slug":"hyperparameter-optimization-a-spectral","title":"Hyperparameter Optimization: A Spectral Approach","date":"2017-06-02","arxiv_id":"1706.00764","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hyperparameter-optimization-a-spectral#ran","syntology_url":"https://syntology.ai/paper/1706.00764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.00764"}},"official":{"repos":["callowbird/Harmonica"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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":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/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":1,"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/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/fast-bayesian-optimization-of-machine","slug":"fast-bayesian-optimization-of-machine","title":"Fast Bayesian Optimization of Machine Learning Hyperparameters on Large Datasets","date":"2016-05-23","arxiv_id":"1605.07079","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fast-bayesian-optimization-of-machine#ran","syntology_url":"https://syntology.ai/paper/1605.07079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1605.07079"}},"official":{"repos":["automl/RoBO"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/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/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}}],"record_sha256":"4f6b159ca1d87e76843e86dc2e23278193fe7b0fa8864f600b5f5f4355972071","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}