{"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/3","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":9,"rows_per_page":100,"rows":[201,300],"of":813,"counts":{"archive_papers_tagged":813,"with_a_code_link":339,"where_syntology_ran_a_sample":90,"not_listed_spam_title":0,"listed":813,"listed_where_code_ran":90,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":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","prev":"/task/hyperparameter-optimization/papers/2","next":"/task/hyperparameter-optimization/papers/4","papers":[{"url":"/paper/hpo-x-ela-investigating-hyperparameter","slug":"hpo-x-ela-investigating-hyperparameter","title":"HPO X ELA: Investigating Hyperparameter Optimization Landscapes by Means of Exploratory Landscape Analysis","date":"2022-07-30","arxiv_id":"2208.00220","repositories_listed":1,"syntology":null},{"url":"/paper/open-source-vizier-distributed-infrastructure","slug":"open-source-vizier-distributed-infrastructure","title":"Open Source Vizier: Distributed Infrastructure and API for Reliable and Flexible Blackbox Optimization","date":"2022-07-27","arxiv_id":"2207.13676","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-hyperparameter-optimization-for","slug":"deep-learning-hyperparameter-optimization-for","title":"Deep Learning Hyperparameter Optimization for Breast Mass Detection in Mammograms","date":"2022-07-22","arxiv_id":"2207.11244","repositories_listed":1,"syntology":null},{"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/goal-oriented-sensitivity-analysis-of","slug":"goal-oriented-sensitivity-analysis-of","title":"Goal-Oriented Sensitivity Analysis of Hyperparameters in Deep Learning","date":"2022-07-13","arxiv_id":"2207.06216","repositories_listed":1,"syntology":null},{"url":"/paper/betty-an-automatic-differentiation-library","slug":"betty-an-automatic-differentiation-library","title":"Betty: An Automatic Differentiation Library for Multilevel Optimization","date":"2022-07-05","arxiv_id":"2207.02849","repositories_listed":1,"syntology":null},{"url":"/paper/streamline-a-simple-transparent-end-to-end","slug":"streamline-a-simple-transparent-end-to-end","title":"STREAMLINE: A Simple, Transparent, End-To-End Automated Machine Learning Pipeline Facilitating Data Analysis and Algorithm Comparison","date":"2022-06-23","arxiv_id":"2206.12002","repositories_listed":1,"syntology":null},{"url":"/paper/near-optimal-control-of-dynamical-systems","slug":"near-optimal-control-of-dynamical-systems","title":"Near-optimal control of dynamical systems with neural ordinary differential equations","date":"2022-06-22","arxiv_id":"2206.11120","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-explainability-of-hyperparameter","slug":"enhancing-explainability-of-hyperparameter","title":"Improving Accuracy of Interpretability Measures in Hyperparameter Optimization via Bayesian Algorithm Execution","date":"2022-06-11","arxiv_id":"2206.05447","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-differentiable-optimization-via","slug":"flexible-differentiable-optimization-via","title":"Flexible Differentiable Optimization via Model Transformations","date":"2022-06-10","arxiv_id":"2206.06135","repositories_listed":1,"syntology":null},{"url":"/paper/fedhpo-b-a-benchmark-suite-for-federated","slug":"fedhpo-b-a-benchmark-suite-for-federated","title":"FedHPO-B: A Benchmark Suite for Federated Hyperparameter Optimization","date":"2022-06-08","arxiv_id":"2206.03966","repositories_listed":1,"syntology":null},{"url":"/paper/towards-learning-universal-hyperparameter","slug":"towards-learning-universal-hyperparameter","title":"Towards Learning Universal Hyperparameter Optimizers with Transformers","date":"2022-05-26","arxiv_id":"2205.13320","repositories_listed":1,"syntology":null},{"url":"/paper/kronecker-decomposition-for-knowledge-graph","slug":"kronecker-decomposition-for-knowledge-graph","title":"Kronecker Decomposition for Knowledge Graph Embeddings","date":"2022-05-13","arxiv_id":"2205.06560","repositories_listed":1,"syntology":null},{"url":"/paper/a-collection-of-quality-diversity","slug":"a-collection-of-quality-diversity","title":"A Collection of Quality Diversity Optimization Problems Derived from Hyperparameter Optimization of Machine Learning Models","date":"2022-04-28","arxiv_id":"2204.14061","repositories_listed":1,"syntology":null},{"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/federatedscope-a-comprehensive-and-flexible","slug":"federatedscope-a-comprehensive-and-flexible","title":"FederatedScope: A Flexible Federated Learning Platform for Heterogeneity","date":"2022-04-11","arxiv_id":"2204.05011","repositories_listed":1,"syntology":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/dynamic-and-efficient-gray-box-hyperparameter-1","slug":"dynamic-and-efficient-gray-box-hyperparameter-1","title":"Supervising the Multi-Fidelity Race of Hyperparameter Configurations","date":"2022-02-20","arxiv_id":"2202.09774","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 6 unverified","sample_list":"/paper/dynamic-and-efficient-gray-box-hyperparameter-1#ran","syntology_url":"https://syntology.ai/paper/2202.09774","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.09774"}},"official":{"repos":["releaunifreiburg/dyhpo"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/one-configuration-to-rule-them-all-towards","slug":"one-configuration-to-rule-them-all-towards","title":"One Configuration to Rule Them All? Towards Hyperparameter Transfer in Topic Models using Multi-Objective Bayesian Optimization","date":"2022-02-15","arxiv_id":"2202.07631","repositories_listed":1,"syntology":null},{"url":"/paper/similarity-search-on-neighbor-s-graphs-with","slug":"similarity-search-on-neighbor-s-graphs-with","title":"Similarity search on neighbor's graphs with automatic Pareto optimal performance and minimum expected quality setups based on hyperparameter optimization","date":"2022-01-19","arxiv_id":"2201.07917","repositories_listed":1,"syntology":null},{"url":"/paper/heuristic-hyperparameter-optimization-for","slug":"heuristic-hyperparameter-optimization-for","title":"Heuristic Hyperparameter Optimization for Convolutional Neural Networks using Genetic Algorithm","date":"2021-12-14","arxiv_id":"2112.07087","repositories_listed":1,"syntology":null},{"url":"/paper/automated-benchmark-driven-design-and","slug":"automated-benchmark-driven-design-and","title":"Automated Benchmark-Driven Design and Explanation of Hyperparameter Optimizers","date":"2021-11-29","arxiv_id":"2111.14756","repositories_listed":1,"syntology":null},{"url":"/paper/importance-of-kernel-bandwidth-in-quantum","slug":"importance-of-kernel-bandwidth-in-quantum","title":"Importance of Kernel Bandwidth in Quantum Machine Learning","date":"2021-11-09","arxiv_id":"2111.05451","repositories_listed":1,"syntology":null},{"url":"/paper/explaining-hyperparameter-optimization-via","slug":"explaining-hyperparameter-optimization-via","title":"Explaining Hyperparameter Optimization via Partial Dependence Plots","date":"2021-11-08","arxiv_id":"2111.04820","repositories_listed":1,"syntology":null},{"url":"/paper/lassobench-a-high-dimensional-hyperparameter","slug":"lassobench-a-high-dimensional-hyperparameter","title":"LassoBench: A High-Dimensional Hyperparameter Optimization Benchmark Suite for Lasso","date":"2021-11-04","arxiv_id":"2111.02790","repositories_listed":1,"syntology":null},{"url":"/paper/automated-hyperparameter-optimization","slug":"automated-hyperparameter-optimization","title":"Automated Hyperparameter Optimization Challenge at CIKM 2021 AnalyticCup","date":"2021-10-31","arxiv_id":"2111.00513","repositories_listed":1,"syntology":null},{"url":"/paper/genealogical-population-based-training-for","slug":"genealogical-population-based-training-for","title":"Genealogical Population-Based Training for Hyperparameter Optimization","date":"2021-09-30","arxiv_id":"2109.14925","repositories_listed":1,"syntology":null},{"url":"/paper/smac3-a-versatile-bayesian-optimization","slug":"smac3-a-versatile-bayesian-optimization","title":"SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimization","date":"2021-09-20","arxiv_id":"2109.09831","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-transferability-of-bert-models-on","slug":"evaluating-transferability-of-bert-models-on","title":"Evaluating Transferability of BERT Models on Uralic Languages","date":"2021-09-13","arxiv_id":"2109.06327","repositories_listed":1,"syntology":null},{"url":"/paper/yahpo-gym-design-criteria-and-a-new","slug":"yahpo-gym-design-criteria-and-a-new","title":"YAHPO Gym -- An Efficient Multi-Objective Multi-Fidelity Benchmark for Hyperparameter Optimization","date":"2021-09-08","arxiv_id":"2109.03670","repositories_listed":1,"syntology":null},{"url":"/paper/crossedwires-a-dataset-of-syntactically","slug":"crossedwires-a-dataset-of-syntactically","title":"CrossedWires: A Dataset of Syntactically Equivalent but Semantically Disparate Deep Learning Models","date":"2021-08-29","arxiv_id":"2108.12768","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-hyperparameter-optimization-for-1","slug":"efficient-hyperparameter-optimization-for-1","title":"Efficient Hyperparameter Optimization for Differentially Private Deep Learning","date":"2021-08-09","arxiv_id":"2108.03888","repositories_listed":1,"syntology":null},{"url":"/paper/hyperparameter-free-and-explainable-whole","slug":"hyperparameter-free-and-explainable-whole","title":"Hyperparameter-free and Explainable Whole Graph Embedding","date":"2021-08-04","arxiv_id":"2108.02113","repositories_listed":1,"syntology":null},{"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/hpo-b-a-large-scale-reproducible-benchmark","slug":"hpo-b-a-large-scale-reproducible-benchmark","title":"HPO-B: A Large-Scale Reproducible Benchmark for Black-Box HPO based on OpenML","date":"2021-06-11","arxiv_id":"2106.06257","repositories_listed":1,"syntology":null},{"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/meta-learning-for-symbolic-hyperparameter","slug":"meta-learning-for-symbolic-hyperparameter","title":"Meta-Learning for Symbolic Hyperparameter Defaults","date":"2021-06-10","arxiv_id":"2106.05767","repositories_listed":1,"syntology":null},{"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/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/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/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/elliot-a-comprehensive-and-rigorous-framework","slug":"elliot-a-comprehensive-and-rigorous-framework","title":"Elliot: a Comprehensive and Rigorous Framework for Reproducible Recommender Systems Evaluation","date":"2021-03-03","arxiv_id":"2103.02590","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-importance-of-hyperparameter","slug":"on-the-importance-of-hyperparameter","title":"On the Importance of Hyperparameter Optimization for Model-based Reinforcement Learning","date":"2021-02-26","arxiv_id":"2102.13651","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-large-scale-hyperparameters-via-1","slug":"optimizing-large-scale-hyperparameters-via-1","title":"Optimizing Large-Scale Hyperparameters via Automated Learning Algorithm","date":"2021-02-17","arxiv_id":"2102.09026","repositories_listed":1,"syntology":null},{"url":"/paper/online-hyperparameter-optimization-by-real","slug":"online-hyperparameter-optimization-by-real","title":"Online hyperparameter optimization by real-time recurrent learning","date":"2021-02-15","arxiv_id":"2102.07813","repositories_listed":1,"syntology":null},{"url":"/paper/hyperparameter-optimization-is-deceiving-us","slug":"hyperparameter-optimization-is-deceiving-us","title":"Hyperparameter Optimization Is Deceiving Us, and How to Stop It","date":"2021-02-05","arxiv_id":"2102.03034","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/hyperparameter-optimization-is-deceiving-us#ran","syntology_url":"https://syntology.ai/paper/2102.03034","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03034"}},"official":{"repos":["pasta41/deception"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/better-call-surrogates-a-hybrid-evolutionary","slug":"better-call-surrogates-a-hybrid-evolutionary","title":"Better call Surrogates: A hybrid Evolutionary Algorithm for Hyperparameter optimization","date":"2020-12-11","arxiv_id":"2012.06453","repositories_listed":1,"syntology":null},{"url":"/paper/a-population-based-hybrid-approach-to","slug":"a-population-based-hybrid-approach-to","title":"A Population-based Hybrid Approach to Hyperparameter Optimization for Neural Networks","date":"2020-11-22","arxiv_id":"2011.11062","repositories_listed":1,"syntology":null},{"url":"/paper/vega-towards-an-end-to-end-configurable","slug":"vega-towards-an-end-to-end-configurable","title":"VEGA: Towards an End-to-End Configurable AutoML Pipeline","date":"2020-11-03","arxiv_id":"2011.01507","repositories_listed":1,"syntology":null},{"url":"/paper/a-critical-assessment-of-state-of-the-art-in","slug":"a-critical-assessment-of-state-of-the-art-in","title":"A Critical Assessment of State-of-the-Art in Entity Alignment","date":"2020-10-30","arxiv_id":"2010.16314","repositories_listed":1,"syntology":null},{"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/robust-semi-supervised-learning-with-out-of","slug":"robust-semi-supervised-learning-with-out-of","title":"How Out-of-Distribution Data Hurts Semi-Supervised Learning","date":"2020-10-07","arxiv_id":"2010.03658","repositories_listed":1,"syntology":null},{"url":"/paper/libkge-a-knowledge-graph-embedding-library","slug":"libkge-a-knowledge-graph-embedding-library","title":"LibKGE - A knowledge graph embedding library for reproducible research","date":"2020-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/anisotropic-3d-multi-stream-cnn-for-accurate","slug":"anisotropic-3d-multi-stream-cnn-for-accurate","title":"Anisotropic 3D Multi-Stream CNN for Accurate Prostate Segmentation from Multi-Planar MRI","date":"2020-09-23","arxiv_id":"2009.11120","repositories_listed":1,"syntology":null},{"url":"/paper/a-study-of-genetic-algorithms-for","slug":"a-study-of-genetic-algorithms-for","title":"A Study of Genetic Algorithms for Hyperparameter Optimization of Neural Networks in Machine Translation","date":"2020-09-15","arxiv_id":"2009.08928","repositories_listed":1,"syntology":null},{"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/fast-approximate-multi-output-gaussian","slug":"fast-approximate-multi-output-gaussian","title":"Fast Approximate Multi-output Gaussian Processes","date":"2020-08-22","arxiv_id":"2008.09848","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-hyperparameter-optimization-by-way","slug":"efficient-hyperparameter-optimization-by-way","title":"Efficient hyperparameter optimization by way of PAC-Bayes bound minimization","date":"2020-08-14","arxiv_id":"2008.06431","repositories_listed":1,"syntology":null},{"url":"/paper/black-magic-in-deep-learning-how-human-skill","slug":"black-magic-in-deep-learning-how-human-skill","title":"Black Magic in Deep Learning: How Human Skill Impacts Network Training","date":"2020-08-13","arxiv_id":"2008.05981","repositories_listed":1,"syntology":null},{"url":"/paper/stabilizing-bi-level-hyperparameter","slug":"stabilizing-bi-level-hyperparameter","title":"Stabilizing Bi-Level Hyperparameter Optimization using Moreau-Yosida Regularization","date":"2020-07-27","arxiv_id":"2007.13322","repositories_listed":1,"syntology":null},{"url":"/paper/non-greedy-gradient-based-hyperparameter","slug":"non-greedy-gradient-based-hyperparameter","title":"Gradient-based Hyperparameter Optimization Over Long Horizons","date":"2020-07-15","arxiv_id":"2007.07869","repositories_listed":1,"syntology":null},{"url":"/paper/an-asymptotically-optimal-multi-armed-bandit","slug":"an-asymptotically-optimal-multi-armed-bandit","title":"An Asymptotically Optimal Multi-Armed Bandit Algorithm and Hyperparameter Optimization","date":"2020-07-11","arxiv_id":"2007.05670","repositories_listed":1,"syntology":null},{"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/efficient-hyperparameter-optimization-in-deep","slug":"efficient-hyperparameter-optimization-in-deep","title":"Efficient Hyperparameter Optimization in Deep Learning Using a Variable Length Genetic Algorithm","date":"2020-06-23","arxiv_id":"2006.12703","repositories_listed":1,"syntology":null},{"url":"/paper/ranking-and-benchmarking-framework-for","slug":"ranking-and-benchmarking-framework-for","title":"Ranking and benchmarking framework for sampling algorithms on synthetic data streams","date":"2020-06-17","arxiv_id":"2006.09895","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-embedding-learning-for-high","slug":"semi-supervised-embedding-learning-for-high","title":"Semi-supervised Embedding Learning for High-dimensional Bayesian Optimization","date":"2020-05-29","arxiv_id":"2005.14601","repositories_listed":1,"syntology":null},{"url":"/paper/mango-a-python-library-for-parallel","slug":"mango-a-python-library-for-parallel","title":"MANGO: A Python Library for Parallel Hyperparameter Tuning","date":"2020-05-22","arxiv_id":"2005.11394","repositories_listed":1,"syntology":null},{"url":"/paper/sherpa-robust-hyperparameter-optimization-for","slug":"sherpa-robust-hyperparameter-optimization-for","title":"Sherpa: Robust Hyperparameter Optimization for Machine Learning","date":"2020-05-08","arxiv_id":"2005.04048","repositories_listed":1,"syntology":null},{"url":"/paper/cost-effective-optimization-for-cost-related","slug":"cost-effective-optimization-for-cost-related","title":"Frugal Optimization for Cost-related Hyperparameters","date":"2020-05-04","arxiv_id":"2005.01571","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-in-neural-networks-a-survey","slug":"meta-learning-in-neural-networks-a-survey","title":"Meta-Learning in Neural Networks: A Survey","date":"2020-04-11","arxiv_id":"2004.05439","repositories_listed":1,"syntology":null},{"url":"/paper/direct-loss-minimization-for-sparse-gaussian","slug":"direct-loss-minimization-for-sparse-gaussian","title":"Direct loss minimization algorithms for sparse Gaussian processes","date":"2020-04-07","arxiv_id":"2004.03083","repositories_listed":1,"syntology":null},{"url":"/paper/weighted-random-search-for-hyperparameter","slug":"weighted-random-search-for-hyperparameter","title":"Weighted Random Search for Hyperparameter Optimization","date":"2020-04-03","arxiv_id":"2004.01628","repositories_listed":1,"syntology":null},{"url":"/paper/weighted-random-search-for-cnn-hyperparameter","slug":"weighted-random-search-for-cnn-hyperparameter","title":"Weighted Random Search for CNN Hyperparameter Optimization","date":"2020-03-30","arxiv_id":"2003.13300","repositories_listed":1,"syntology":null},{"url":"/paper/phs-a-toolbox-for-parellel-hyperparameter","slug":"phs-a-toolbox-for-parellel-hyperparameter","title":"PHS: A Toolbox for Parallel Hyperparameter Search","date":"2020-02-26","arxiv_id":"2002.11429","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-differentiation-of-lasso-type-models","slug":"implicit-differentiation-of-lasso-type-models","title":"Implicit differentiation of Lasso-type models for hyperparameter optimization","date":"2020-02-20","arxiv_id":"2002.08943","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-enhanced-quantum","slug":"reinforcement-learning-enhanced-quantum","title":"Reinforcement Learning Enhanced Quantum-inspired Algorithm for Combinatorial Optimization","date":"2020-02-11","arxiv_id":"2002.04676","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/reinforcement-learning-enhanced-quantum#ran","syntology_url":"https://syntology.ai/paper/2002.04676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04676"}},"official":{"repos":["BeloborodovDS/SIMCIM-RL"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/extreme-algorithm-selection-with-dyadic","slug":"extreme-algorithm-selection-with-dyadic","title":"Extreme Algorithm Selection With Dyadic Feature Representation","date":"2020-01-29","arxiv_id":"2001.10741","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-hyperparameter-optimization-with-1","slug":"scalable-hyperparameter-optimization-with-1","title":"Scalable Hyperparameter Optimization with Lazy Gaussian Processes","date":"2020-01-16","arxiv_id":"2001.05726","repositories_listed":1,"syntology":null},{"url":"/paper/auptimizer-an-extensible-open-source","slug":"auptimizer-an-extensible-open-source","title":"Auptimizer -- an Extensible, Open-Source Framework for Hyperparameter Tuning","date":"2019-11-06","arxiv_id":"1911.02522","repositories_listed":1,"syntology":null},{"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/probabilistic-rollouts-for-learning-curve","slug":"probabilistic-rollouts-for-learning-curve","title":"Probabilistic Rollouts for Learning Curve Extrapolation Across Hyperparameter Settings","date":"2019-10-10","arxiv_id":"1910.04522","repositories_listed":1,"syntology":null},{"url":"/paper/mental-task-classification-using","slug":"mental-task-classification-using","title":"Mental Task Classification Using Electroencephalogram Signal","date":"2019-10-02","arxiv_id":"1910.03023","repositories_listed":1,"syntology":null},{"url":"/paper/a-specialized-evolutionary-strategy-using","slug":"a-specialized-evolutionary-strategy-using","title":"Random Error Sampling-based Recurrent Neural Network Architecture Optimization","date":"2019-09-04","arxiv_id":"1909.02425","repositories_listed":1,"syntology":null},{"url":"/paper/boah-a-tool-suite-for-multi-fidelity-bayesian","slug":"boah-a-tool-suite-for-multi-fidelity-bayesian","title":"BOAH: A Tool Suite for Multi-Fidelity Bayesian Optimization & Analysis of Hyperparameters","date":"2019-08-16","arxiv_id":"1908.06756","repositories_listed":1,"syntology":null},{"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/hypernomad-hyperparameter-optimization-of","slug":"hypernomad-hyperparameter-optimization-of","title":"HyperNOMAD: Hyperparameter optimization of deep neural networks using mesh adaptive direct search","date":"2019-07-03","arxiv_id":"1907.01698","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-overlap-and-a-comparison-of","slug":"spectral-overlap-and-a-comparison-of","title":"Spectral Overlap and a Comparison of Parameter-Free, Dimensionality Reduction Quality Metrics","date":"2019-07-03","arxiv_id":"1907.01974","repositories_listed":1,"syntology":null},{"url":"/paper/single-path-mobile-automl-efficient-convnet","slug":"single-path-mobile-automl-efficient-convnet","title":"Single-Path Mobile AutoML: Efficient ConvNet Design and NAS Hyperparameter Optimization","date":"2019-07-01","arxiv_id":"1907.00959","repositories_listed":1,"syntology":null},{"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/190600195","slug":"190600195","title":"Multivariate, Multistep Forecasting, Reconstruction and Feature Selection of Ocean Waves via Recurrent and Sequence-to-Sequence Networks","date":"2019-06-01","arxiv_id":"1906.00195","repositories_listed":1,"syntology":null},{"url":"/paper/meta-surrogate-benchmarking-for","slug":"meta-surrogate-benchmarking-for","title":"Meta-Surrogate Benchmarking for Hyperparameter Optimization","date":"2019-05-30","arxiv_id":"1905.12982","repositories_listed":1,"syntology":null},{"url":"/paper/lambdaopt-learn-to-regularize-recommender","slug":"lambdaopt-learn-to-regularize-recommender","title":"LambdaOpt: Learn to Regularize Recommender Models in Finer Levels","date":"2019-05-28","arxiv_id":"1905.11596","repositories_listed":1,"syntology":null},{"url":"/paper/dataset2vec-learning-dataset-meta-features","slug":"dataset2vec-learning-dataset-meta-features","title":"Dataset2Vec: Learning Dataset Meta-Features","date":"2019-05-27","arxiv_id":"1905.11063","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-gaussian-processes-for-online","slug":"sequential-gaussian-processes-for-online","title":"Sequential Gaussian Processes for Online Learning of Nonstationary Functions","date":"2019-05-24","arxiv_id":"1905.10003","repositories_listed":1,"syntology":null},{"url":"/paper/deep-bo-for-hyperparameter-optimization-of-1","slug":"deep-bo-for-hyperparameter-optimization-of-1","title":"DEEP-BO for Hyperparameter Optimization of Deep Networks","date":"2019-05-23","arxiv_id":"1905.09680","repositories_listed":1,"syntology":null}],"record_sha256":"5d428b93c5cc226be08f2e54aff5be4a74bf72e96f4d26c5cb872cfd2637aa14","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}