{"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/bayesian-optimization/papers/5","list_of":"/task/bayesian-optimization","task":"Bayesian 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":5,"pages_in_order":19,"rows_per_page":100,"rows":[401,500],"of":1900,"counts":{"archive_papers_tagged":1900,"with_a_code_link":686,"where_syntology_ran_a_sample":185,"not_listed_spam_title":0,"listed":1900,"listed_where_code_ran":185,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":148,"every_run_a_failure_of_syntologys_instrument":37,"listed_with_a_run_with_no_instrument_failure":148,"listed_every_run_a_failure_of_syntologys_instrument":37,"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/bayesian-optimization","prev":"/task/bayesian-optimization/papers/4","next":"/task/bayesian-optimization/papers/6","papers":[{"url":"/paper/bayesian-optimization-under-stochastic","slug":"bayesian-optimization-under-stochastic","title":"Bayesian Optimization under Stochastic Delayed Feedback","date":"2022-06-19","arxiv_id":"2206.09341","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/bayesian-optimization-under-stochastic#ran","syntology_url":"https://syntology.ai/paper/2206.09341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09341"}},"official":{"repos":["daizhongxiang/bo-sdf"],"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/demystifying-the-adversarial-robustness-of-1","slug":"demystifying-the-adversarial-robustness-of-1","title":"Demystifying the Adversarial Robustness of Random Transformation Defenses","date":"2022-06-18","arxiv_id":"2207.03574","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/demystifying-the-adversarial-robustness-of-1#ran","syntology_url":"https://syntology.ai/paper/2207.03574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.03574"}},"official":{"repos":["wagner-group/demystify-random-transform"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/query-efficient-and-scalable-black-box","slug":"query-efficient-and-scalable-black-box","title":"Query-Efficient and Scalable Black-Box Adversarial Attacks on Discrete Sequential Data via Bayesian Optimization","date":"2022-06-17","arxiv_id":"2206.08575","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":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/query-efficient-and-scalable-black-box#ran","syntology_url":"https://syntology.ai/paper/2206.08575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08575"}},"official":{"repos":["snu-mllab/discreteblockbayesattack"],"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/scalable-first-order-bayesian-optimization","slug":"scalable-first-order-bayesian-optimization","title":"Scalable First-Order Bayesian Optimization via Structured Automatic Differentiation","date":"2022-06-16","arxiv_id":"2206.08366","repositories_listed":1,"syntology":null},{"url":"/paper/on-provably-robust-meta-bayesian-optimization","slug":"on-provably-robust-meta-bayesian-optimization","title":"On Provably Robust Meta-Bayesian Optimization","date":"2022-06-14","arxiv_id":"2206.06872","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/relaxed-gaussian-process-interpolation-a-goal","slug":"relaxed-gaussian-process-interpolation-a-goal","title":"Relaxed Gaussian process interpolation: a goal-oriented approach to Bayesian optimization","date":"2022-06-07","arxiv_id":"2206.03034","repositories_listed":1,"syntology":null},{"url":"/paper/hybrid-models-for-mixed-variables-in-bayesian","slug":"hybrid-models-for-mixed-variables-in-bayesian","title":"Hybrid Parameter Search and Dynamic Model Selection for Mixed-Variable Bayesian Optimization","date":"2022-06-03","arxiv_id":"2206.01409","repositories_listed":1,"syntology":null},{"url":"/paper/features-extraction-and-reduction-techniques","slug":"features-extraction-and-reduction-techniques","title":"Features extraction and reduction techniques with optimized SVM for Persian/Arabic handwritten digits recognition","date":"2022-05-30","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/odbo-bayesian-optimization-with-search-space","slug":"odbo-bayesian-optimization-with-search-space","title":"ODBO: Bayesian Optimization with Search Space Prescreening for Directed Protein Evolution","date":"2022-05-19","arxiv_id":"2205.09548","repositories_listed":1,"syntology":null},{"url":"/paper/hyper-parameter-tuning-of-physics-informed","slug":"hyper-parameter-tuning-of-physics-informed","title":"Hyper-parameter tuning of physics-informed neural networks: Application to Helmholtz problems","date":"2022-05-13","arxiv_id":"2205.06704","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-automated-deep-learning-for-time","slug":"efficient-automated-deep-learning-for-time","title":"Efficient Automated Deep Learning for Time Series Forecasting","date":"2022-05-11","arxiv_id":"2205.05511","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/efficient-automated-deep-learning-for-time#ran","syntology_url":"https://syntology.ai/paper/2205.05511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.05511"}},"official":{"repos":["automl/Auto-PyTorch"],"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/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/uncertainty-aware-search-framework-for-multi-1","slug":"uncertainty-aware-search-framework-for-multi-1","title":"Uncertainty-Aware Search Framework for Multi-Objective Bayesian Optimization","date":"2022-04-12","arxiv_id":"2204.05944","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/uncertainty-aware-search-framework-for-multi-1#ran","syntology_url":"https://syntology.ai/paper/2204.05944","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.05944"}},"official":{"repos":["belakaria/usemo"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/text-pf-2-text-es-parallel-feasible-pareto","slug":"text-pf-2-text-es-parallel-feasible-pareto","title":"$\\{\\text{PF}\\}^2$ES: Parallel Feasible Pareto Frontier Entropy Search for Multi-Objective Bayesian Optimization","date":"2022-04-11","arxiv_id":"2204.05411","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-with-known-experimental","slug":"bayesian-optimization-with-known-experimental","title":"Bayesian optimization with known experimental and design constraints for chemistry applications","date":"2022-03-29","arxiv_id":"2203.17241","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":3,"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/bayesian-optimization-with-known-experimental#ran","syntology_url":"https://syntology.ai/paper/2203.17241","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.17241"}},"official":{"repos":["aspuru-guzik-group/gryffin"],"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/multi-armed-bandits-for-online-optimization","slug":"multi-armed-bandits-for-online-optimization","title":"Multi-armed bandits for resource efficient, online optimization of language model pre-training: the use case of dynamic masking","date":"2022-03-24","arxiv_id":"2203.13151","repositories_listed":1,"syntology":null},{"url":"/paper/preference-exploration-for-efficient-bayesian","slug":"preference-exploration-for-efficient-bayesian","title":"Preference Exploration for Efficient Bayesian Optimization with Multiple Outcomes","date":"2022-03-21","arxiv_id":"2203.11382","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/preference-exploration-for-efficient-bayesian#ran","syntology_url":"https://syntology.ai/paper/2203.11382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11382"}},"official":{"repos":["facebookresearch/preference-exploration"],"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/skill-based-multi-objective-reinforcement","slug":"skill-based-multi-objective-reinforcement","title":"Skill-based Multi-objective Reinforcement Learning of Industrial Robot Tasks with Planning and Knowledge Integration","date":"2022-03-18","arxiv_id":"2203.10033","repositories_listed":1,"syntology":null},{"url":"/paper/non-elitist-selection-among-survivor","slug":"non-elitist-selection-among-survivor","title":"Non-Elitist Selection Can Improve the Performance of Irace","date":"2022-03-17","arxiv_id":"2203.09227","repositories_listed":1,"syntology":null},{"url":"/paper/leopard-parallel-optimal-deep-echo-state","slug":"leopard-parallel-optimal-deep-echo-state","title":"LEOPARD: Parallel Optimal Deep Echo State Network Prediction Improves Service Coverage for UAV-Assisted Outdoor Hotspots","date":"2022-03-08","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sparse-bayesian-optimization","slug":"sparse-bayesian-optimization","title":"Sparse Bayesian Optimization","date":"2022-03-03","arxiv_id":"2203.01900","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-bayesian-optimization-using-vecchia","slug":"scalable-bayesian-optimization-using-vecchia","title":"Scalable Bayesian Optimization Using Vecchia Approximations of Gaussian Processes","date":"2022-03-02","arxiv_id":"2203.01459","repositories_listed":1,"syntology":null},{"url":"/paper/risk-aware-scene-sampling-for-dynamic","slug":"risk-aware-scene-sampling-for-dynamic","title":"Risk-Aware Scene Sampling for Dynamic Assurance of Autonomous Systems","date":"2022-02-28","arxiv_id":"2202.13510","repositories_listed":1,"syntology":null},{"url":"/paper/translational-quantum-machine-intelligence","slug":"translational-quantum-machine-intelligence","title":"Translational Quantum Machine Intelligence for Modeling Tumor Dynamics in Oncology","date":"2022-02-21","arxiv_id":"2202.10919","repositories_listed":1,"syntology":null},{"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/robust-multi-objective-bayesian-optimization","slug":"robust-multi-objective-bayesian-optimization","title":"Robust Multi-Objective Bayesian Optimization Under Input Noise","date":"2022-02-15","arxiv_id":"2202.07549","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":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/robust-multi-objective-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/2202.07549","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.07549"}},"official":{"repos":["facebookresearch/robust_mobo"],"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/b2ea-an-evolutionary-algorithm-assisted-by","slug":"b2ea-an-evolutionary-algorithm-assisted-by","title":"B2EA: An Evolutionary Algorithm Assisted by Two Bayesian Optimization Modules for Neural Architecture Search","date":"2022-02-07","arxiv_id":"2202.03005","repositories_listed":1,"syntology":null},{"url":"/paper/mold-into-a-graph-efficient-bayesian","slug":"mold-into-a-graph-efficient-bayesian","title":"Mold into a Graph: Efficient Bayesian Optimization over Mixed-Spaces","date":"2022-02-02","arxiv_id":"2202.00893","repositories_listed":1,"syntology":null},{"url":"/paper/posterior-temperature-optimized-bayesian","slug":"posterior-temperature-optimized-bayesian","title":"Posterior temperature optimized Bayesian models for inverse problems in medical imaging","date":"2022-02-02","arxiv_id":"2202.00986","repositories_listed":1,"syntology":null},{"url":"/paper/local-latent-space-bayesian-optimization-over","slug":"local-latent-space-bayesian-optimization-over","title":"Local Latent Space Bayesian Optimization over Structured Inputs","date":"2022-01-28","arxiv_id":"2201.11872","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/local-latent-space-bayesian-optimization-over#ran","syntology_url":"https://syntology.ai/paper/2201.11872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.11872"}},"official":{"repos":["nataliemaus/lolbo"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/safeapt-safe-simulation-to-real-robot","slug":"safeapt-safe-simulation-to-real-robot","title":"SafeAPT: Safe Simulation-to-Real Robot Learning using Diverse Policies Learned in Simulation","date":"2022-01-27","arxiv_id":"2201.13248","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-of-function-networks-1","slug":"bayesian-optimization-of-function-networks-1","title":"Bayesian Optimization of Function Networks","date":"2021-12-31","arxiv_id":"2112.15311","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/bayesian-optimization-of-function-networks-1#ran","syntology_url":"https://syntology.ai/paper/2112.15311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.15311"}},"official":{"repos":["raulastudillo06/bofn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/expected-hypervolume-improvement-for","slug":"expected-hypervolume-improvement-for","title":"Leveraging Trust for Joint Multi-Objective and Multi-Fidelity Optimization","date":"2021-12-27","arxiv_id":"2112.13901","repositories_listed":1,"syntology":null},{"url":"/paper/triangulation-candidates-for-bayesian","slug":"triangulation-candidates-for-bayesian","title":"Triangulation candidates for Bayesian optimization","date":"2021-12-14","arxiv_id":"2112.07457","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-over-permutation-spaces","slug":"bayesian-optimization-over-permutation-spaces","title":"Bayesian Optimization over Permutation Spaces","date":"2021-12-02","arxiv_id":"2112.01049","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":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) · 1 unverified","sample_list":"/paper/bayesian-optimization-over-permutation-spaces#ran","syntology_url":"https://syntology.ai/paper/2112.01049","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.01049"}},"official":{"repos":["aryandeshwal/bops"],"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/counterexample-guided-rl-policy-refinement","slug":"counterexample-guided-rl-policy-refinement","title":"Counterexample Guided RL Policy Refinement Using Bayesian Optimization","date":"2021-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-conditional-value-at-risk-of-black","slug":"optimizing-conditional-value-at-risk-of-black","title":"Optimizing Conditional Value-At-Risk of Black-Box Functions","date":"2021-12-01","arxiv_id":null,"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/naive-automated-machine-learning","slug":"naive-automated-machine-learning","title":"Naive Automated Machine Learning","date":"2021-11-29","arxiv_id":"2111.14514","repositories_listed":1,"syntology":null},{"url":"/paper/towards-robust-and-automatic-hyper-parameter","slug":"towards-robust-and-automatic-hyper-parameter","title":"Towards Robust and Automatic Hyper-Parameter Tunning","date":"2021-11-28","arxiv_id":"2111.14056","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/towards-robust-and-automatic-hyper-parameter#ran","syntology_url":"https://syntology.ai/paper/2111.14056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.14056"}},"official":{"repos":["mathieutuli/autohyper"],"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/a-stacked-dcnn-to-predict-the-rul-of-a","slug":"a-stacked-dcnn-to-predict-the-rul-of-a","title":"A stacked DCNN to predict the RUL of a turbofan engine","date":"2021-11-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-stacked-deep-convolutional-neural-network","slug":"a-stacked-deep-convolutional-neural-network","title":"A stacked deep convolutional neural network to predict the remaining useful life of a turbofan engine","date":"2021-11-24","arxiv_id":"2111.12689","repositories_listed":1,"syntology":null},{"url":"/paper/transfer-learning-with-gaussian-processes-for","slug":"transfer-learning-with-gaussian-processes-for","title":"Transfer Learning with Gaussian Processes for Bayesian Optimization","date":"2021-11-22","arxiv_id":"2111.11223","repositories_listed":1,"syntology":null},{"url":"/paper/accounting-for-gaussian-process-imprecision","slug":"accounting-for-gaussian-process-imprecision","title":"Accounting for Gaussian Process Imprecision in Bayesian Optimization","date":"2021-11-16","arxiv_id":"2111.08299","repositories_listed":1,"syntology":null},{"url":"/paper/multi-step-budgeted-bayesian-optimization","slug":"multi-step-budgeted-bayesian-optimization","title":"Multi-Step Budgeted Bayesian Optimization with Unknown Evaluation Costs","date":"2021-11-12","arxiv_id":"2111.06537","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/multi-step-budgeted-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/2111.06537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06537"}},"official":{"repos":["raulastudillo06/budgetedbo"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"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/iohexperimenter-benchmarking-platform-for","slug":"iohexperimenter-benchmarking-platform-for","title":"IOHexperimenter: Benchmarking Platform for Iterative Optimization Heuristics","date":"2021-11-07","arxiv_id":"2111.04077","repositories_listed":1,"syntology":null},{"url":"/paper/risk-averse-heteroscedastic-bayesian","slug":"risk-averse-heteroscedastic-bayesian","title":"Risk-averse Heteroscedastic Bayesian Optimization","date":"2021-11-05","arxiv_id":"2111.03637","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/risk-averse-heteroscedastic-bayesian#ran","syntology_url":"https://syntology.ai/paper/2111.03637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.03637"}},"official":{"repos":["avidereta/risk-averse-hetero-bo"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"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/geometry-aware-bayesian-optimization-in","slug":"geometry-aware-bayesian-optimization-in","title":"Geometry-aware Bayesian Optimization in Robotics using Riemannian Matérn Kernels","date":"2021-11-02","arxiv_id":"2111.01460","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/geometry-aware-bayesian-optimization-in#ran","syntology_url":"https://syntology.ai/paper/2111.01460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.01460"}},"official":{"repos":["noemiejaquier/materngabo"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/combining-latent-space-and-structured-kernels","slug":"combining-latent-space-and-structured-kernels","title":"Combining Latent Space and Structured Kernels for Bayesian Optimization over Combinatorial Spaces","date":"2021-11-01","arxiv_id":"2111.01186","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/combining-latent-space-and-structured-kernels#ran","syntology_url":"https://syntology.ai/paper/2111.01186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.01186"}},"official":{"repos":["aryandeshwal/ladder"],"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/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/dynamic-causal-bayesian-optimization","slug":"dynamic-causal-bayesian-optimization","title":"Dynamic Causal Bayesian Optimization","date":"2021-10-26","arxiv_id":"2110.13891","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/dynamic-causal-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/2110.13891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.13891"}},"official":{"repos":["neildhir/dcbo"],"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/surrogate-assisted-reference-vector","slug":"surrogate-assisted-reference-vector","title":"Surrogate-Assisted Reference Vector Adaptation to Various Pareto Front Shapes for Many-Objective Bayesian Optimization","date":"2021-10-10","arxiv_id":"2110.04689","repositories_listed":1,"syntology":null},{"url":"/paper/simple-recurrent-neural-networks-is-all-we","slug":"simple-recurrent-neural-networks-is-all-we","title":"Simple Recurrent Neural Networks is all we need for clinical events predictions using EHR data","date":"2021-10-03","arxiv_id":"2110.00998","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-with-knowledge-constraints","slug":"machine-learning-with-knowledge-constraints","title":"Machine Learning with Knowledge Constraints for Process Optimization of Open-Air Perovskite Solar Cell Manufacturing","date":"2021-10-01","arxiv_id":"2110.01387","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-discrete-bayesian","slug":"high-dimensional-discrete-bayesian","title":"High-Dimensional Discrete Bayesian Optimization with Self-Supervised Representation Learning for Data-Efficient Materials Exploration","date":"2021-09-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scalable-bayesian-optimization-accelerates","slug":"scalable-bayesian-optimization-accelerates","title":"Scalable Bayesian Optimization Accelerates Process Optimization of Penicillin Production","date":"2021-09-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-bayesian-optimization-for","slug":"high-dimensional-bayesian-optimization-for","title":"Bayesian Optimization with Clustering and Rollback for CNN Auto Pruning","date":"2021-09-22","arxiv_id":"2109.10591","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-bayesian-optimization-over","slug":"multi-objective-bayesian-optimization-over","title":"Multi-Objective Bayesian Optimization over High-Dimensional Search Spaces","date":"2021-09-22","arxiv_id":"2109.10964","repositories_listed":1,"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":8,"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/multi-objective-bayesian-optimization-over#ran","syntology_url":"https://syntology.ai/paper/2109.10964","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.10964"}},"official":null}},{"url":"/paper/computationally-efficient-high-dimensional","slug":"computationally-efficient-high-dimensional","title":"Computationally Efficient High-Dimensional Bayesian Optimization via Variable Selection","date":"2021-09-20","arxiv_id":"2109.09264","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/non-smooth-bayesian-optimization-in-tuning","slug":"non-smooth-bayesian-optimization-in-tuning","title":"Non-smooth Bayesian Optimization in Tuning Problems","date":"2021-09-15","arxiv_id":"2109.07563","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-learning-of-3-point-correlation","slug":"data-driven-learning-of-3-point-correlation","title":"Data-Driven Learning of 3-Point Correlation Functions as Microstructure Representations","date":"2021-09-06","arxiv_id":"2109.02255","repositories_listed":1,"syntology":null},{"url":"/paper/text-autoaugment-learning-compositional","slug":"text-autoaugment-learning-compositional","title":"Text AutoAugment: Learning Compositional Augmentation Policy for Text Classification","date":"2021-09-01","arxiv_id":"2109.00523","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-reservoir-computing-for-solving","slug":"unsupervised-reservoir-computing-for-solving","title":"Unsupervised Reservoir Computing for Solving Ordinary Differential Equations","date":"2021-08-25","arxiv_id":"2108.11417","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/unsupervised-reservoir-computing-for-solving#ran","syntology_url":"https://syntology.ai/paper/2108.11417","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.11417"}},"official":{"repos":["blindedjoy/RcTorch"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/time-dependence-in-kalman-filter-tuning","slug":"time-dependence-in-kalman-filter-tuning","title":"Time Dependence in Kalman Filter Tuning","date":"2021-08-21","arxiv_id":"2108.10712","repositories_listed":1,"syntology":null},{"url":"/paper/trusted-maximizers-entropy-search-for","slug":"trusted-maximizers-entropy-search-for","title":"Trusted-Maximizers Entropy Search for Efficient Bayesian Optimization","date":"2021-07-30","arxiv_id":"2107.14465","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-for-min-max","slug":"bayesian-optimization-for-min-max","title":"Bayesian Optimization for Min Max Optimization","date":"2021-07-29","arxiv_id":"2107.13772","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimisation-for-sequential","slug":"bayesian-optimisation-for-sequential","title":"Bayesian Optimisation for Sequential Experimental Design with Applications in Additive Manufacturing","date":"2021-07-27","arxiv_id":"2107.12809","repositories_listed":1,"syntology":null},{"url":"/paper/eggs-eigen-gap-guided-search-making-subspace","slug":"eggs-eigen-gap-guided-search-making-subspace","title":"A Simple Approach to Automated Spectral Clustering","date":"2021-07-23","arxiv_id":"2107.12183","repositories_listed":1,"syntology":null},{"url":"/paper/active-offline-policy-selection","slug":"active-offline-policy-selection","title":"Active Offline Policy Selection","date":"2021-06-18","arxiv_id":"2106.10251","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/active-offline-policy-selection#ran","syntology_url":"https://syntology.ai/paper/2106.10251","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10251"}},"official":{"repos":["deepmind/active_ops"],"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/amortized-auto-tuning-cost-efficient-transfer","slug":"amortized-auto-tuning-cost-efficient-transfer","title":"Amortized Auto-Tuning: Cost-Efficient Bayesian Transfer Optimization for Hyperparameter Recommendation","date":"2021-06-17","arxiv_id":"2106.09179","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/amortized-auto-tuning-cost-efficient-transfer#ran","syntology_url":"https://syntology.ai/paper/2106.09179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09179"}},"official":{"repos":["xiaoyuxin1002/amortized-auto-tuning"],"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/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/bayesian-optimization-over-hybrid-spaces","slug":"bayesian-optimization-over-hybrid-spaces","title":"Bayesian Optimization over Hybrid Spaces","date":"2021-06-08","arxiv_id":"2106.04682","repositories_listed":1,"syntology":null},{"url":"/paper/jumbo-scalable-multi-task-bayesian","slug":"jumbo-scalable-multi-task-bayesian","title":"JUMBO: Scalable Multi-task Bayesian Optimization using Offline Data","date":"2021-06-02","arxiv_id":"2106.00942","repositories_listed":1,"syntology":null},{"url":"/paper/autonomous-optimization-of-fluid-systems-at","slug":"autonomous-optimization-of-fluid-systems-at","title":"A Machine Learning and Computer Vision Approach to Rapidly Optimize Multiscale Droplet Generation","date":"2021-05-28","arxiv_id":"2105.13553","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":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) · 1 unverified","sample_list":"/paper/autonomous-optimization-of-fluid-systems-at#ran","syntology_url":"https://syntology.ai/paper/2105.13553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13553"}},"official":{"repos":["pv-lab/ml-multiscale-droplets"],"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/gosafe-globally-optimal-safe-robot-learning","slug":"gosafe-globally-optimal-safe-robot-learning","title":"GoSafe: Globally Optimal Safe Robot Learning","date":"2021-05-27","arxiv_id":"2105.13281","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/gosafe-globally-optimal-safe-robot-learning#ran","syntology_url":"https://syntology.ai/paper/2105.13281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13281"}},"official":null}},{"url":"/paper/benchmarking-the-performance-of-bayesian","slug":"benchmarking-the-performance-of-bayesian","title":"Benchmarking the Performance of Bayesian Optimization across Multiple Experimental Materials Science Domains","date":"2021-05-23","arxiv_id":"2106.01309","repositories_listed":1,"syntology":null},{"url":"/paper/autolrs-automatic-learning-rate-schedule-by-1","slug":"autolrs-automatic-learning-rate-schedule-by-1","title":"AutoLRS: Automatic Learning-Rate Schedule by Bayesian Optimization on the Fly","date":"2021-05-22","arxiv_id":"2105.10762","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/autolrs-automatic-learning-rate-schedule-by-1#ran","syntology_url":"https://syntology.ai/paper/2105.10762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.10762"}},"official":{"repos":["YuchenJin/autolrs"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/parallel-bayesian-optimization-of-multiple","slug":"parallel-bayesian-optimization-of-multiple","title":"Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement","date":"2021-05-17","arxiv_id":"2105.08195","repositories_listed":1,"syntology":null},{"url":"/paper/a-feasibility-study-of-a-hyperparameter","slug":"a-feasibility-study-of-a-hyperparameter","title":"A hyperparameter-tuning approach to automated inverse planning","date":"2021-05-14","arxiv_id":"2105.07024","repositories_listed":1,"syntology":null},{"url":"/paper/hasco-towards-agile-hardware-and-software-co","slug":"hasco-towards-agile-hardware-and-software-co","title":"HASCO: Towards Agile HArdware and Software CO-design for Tensor Computation","date":"2021-05-04","arxiv_id":"2105.01585","repositories_listed":1,"syntology":null},{"url":"/paper/autotuning-polybench-benchmarks-with-llvm-1","slug":"autotuning-polybench-benchmarks-with-llvm-1","title":"Autotuning PolyBench Benchmarks with LLVM Clang/Polly Loop Optimization Pragmas Using Bayesian Optimization (extended version)","date":"2021-04-27","arxiv_id":"2104.13242","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-is-superior-to-random","slug":"bayesian-optimization-is-superior-to-random","title":"Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 2020","date":"2021-04-20","arxiv_id":"2104.10201","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":5,"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/bayesian-optimization-is-superior-to-random#ran","syntology_url":"https://syntology.ai/paper/2104.10201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.10201"}},"official":null}},{"url":"/paper/bayesian-algorithm-execution-estimating","slug":"bayesian-algorithm-execution-estimating","title":"Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Information","date":"2021-04-19","arxiv_id":"2104.09460","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":5,"n_ran_checked":8,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":3,"n_no_contract":5,"n_pointer_only":12,"phrase":"10 ran (of which 5 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 3 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bayesian-algorithm-execution-estimating#ran","syntology_url":"https://syntology.ai/paper/2104.09460","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09460"}},"official":{"repos":["willieneis/bayesian-algorithm-execution"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":5,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/octis-comparing-and-optimizing-topic-models","slug":"octis-comparing-and-optimizing-topic-models","title":"OCTIS: Comparing and Optimizing Topic models is Simple!","date":"2021-04-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-surrogate-assisted-evolutionary","slug":"a-novel-surrogate-assisted-evolutionary","title":"A Novel Surrogate-assisted Evolutionary Algorithm Applied to Partition-based Ensemble Learning","date":"2021-04-16","arxiv_id":"2104.08048","repositories_listed":1,"syntology":null},{"url":"/paper/inverse-bayesian-optimization-learning-human","slug":"inverse-bayesian-optimization-learning-human","title":"Inverse Bayesian Optimization: Learning Human Acquisition Functions in an Exploration vs Exploitation Search Task","date":"2021-04-16","arxiv_id":"2104.09237","repositories_listed":1,"syntology":null},{"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/autooed-automated-optimal-experiment-design","slug":"autooed-automated-optimal-experiment-design","title":"AutoOED: Automated Optimal Experiment Design Platform","date":"2021-04-13","arxiv_id":"2104.05959","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-bayesian-optimization-in-the-light","slug":"revisiting-bayesian-optimization-in-the-light","title":"Revisiting Bayesian Optimization in the light of the COCO benchmark","date":"2021-03-30","arxiv_id":"2103.16649","repositories_listed":1,"syntology":null},{"url":"/paper/a-sampling-criterion-for-constrained-bayesian","slug":"a-sampling-criterion-for-constrained-bayesian","title":"A sampling criterion for constrained Bayesian optimization with uncertainties","date":"2021-03-09","arxiv_id":"2103.05706","repositories_listed":1,"syntology":null},{"url":"/paper/gemini-dynamic-bias-correction-for-autonomous","slug":"gemini-dynamic-bias-correction-for-autonomous","title":"Gemini: Dynamic Bias Correction for Autonomous Experimentation and Molecular Simulation","date":"2021-03-05","arxiv_id":"2103.03391","repositories_listed":1,"syntology":null},{"url":"/paper/batch-bayesian-optimization-on-permutations","slug":"batch-bayesian-optimization-on-permutations","title":"Batch Bayesian Optimization on Permutations using the Acquisition Weighted Kernel","date":"2021-02-26","arxiv_id":"2102.13382","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/batch-bayesian-optimization-on-permutations#ran","syntology_url":"https://syntology.ai/paper/2102.13382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.13382"}},"official":{"repos":["changyong-oh/law2order"],"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/nomu-neural-optimization-based-model","slug":"nomu-neural-optimization-based-model","title":"NOMU: Neural Optimization-based Model Uncertainty","date":"2021-02-26","arxiv_id":"2102.13640","repositories_listed":1,"syntology":null},{"url":"/paper/ps-and-qs-quantization-aware-pruning-for","slug":"ps-and-qs-quantization-aware-pruning-for","title":"Ps and Qs: Quantization-aware pruning for efficient low latency neural network inference","date":"2021-02-22","arxiv_id":"2102.11289","repositories_listed":1,"syntology":null},{"url":"/paper/bore-bayesian-optimization-by-density-ratio","slug":"bore-bayesian-optimization-by-density-ratio","title":"BORE: Bayesian Optimization by Density-Ratio Estimation","date":"2021-02-17","arxiv_id":"2102.09009","repositories_listed":1,"syntology":null}],"record_sha256":"866f4bf1c1aba33a6fb13f71ae1c57f5f97a945ac8ece9e02f238ba5cdfbcb24","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}