{"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/6","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":6,"pages_in_order":19,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/bayesian-optimization/papers/7","papers":[{"url":"/paper/explaining-inference-queries-with-bayesian","slug":"explaining-inference-queries-with-bayesian","title":"Explaining Inference Queries with Bayesian Optimization","date":"2021-02-10","arxiv_id":"2102.05308","repositories_listed":1,"syntology":null},{"url":"/paper/hyper-optimization-with-gaussian-process-and","slug":"hyper-optimization-with-gaussian-process-and","title":"Hyper-optimization with Gaussian Process and Differential Evolution Algorithm","date":"2021-01-26","arxiv_id":"2101.10625","repositories_listed":1,"syntology":null},{"url":"/paper/numerical-issues-in-maximum-likelihood","slug":"numerical-issues-in-maximum-likelihood","title":"Numerical issues in maximum likelihood parameter estimation for Gaussian process interpolation","date":"2021-01-24","arxiv_id":"2101.09747","repositories_listed":1,"syntology":null},{"url":"/paper/cobbo-coordinate-backoff-bayesian","slug":"cobbo-coordinate-backoff-bayesian","title":"CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels","date":"2021-01-13","arxiv_id":"2101.05147","repositories_listed":1,"syntology":null},{"url":"/paper/good-practices-for-bayesian-optimization-of","slug":"good-practices-for-bayesian-optimization-of","title":"Good practices for Bayesian Optimization of high dimensional structured spaces","date":"2020-12-31","arxiv_id":"2012.15471","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/good-practices-for-bayesian-optimization-of#ran","syntology_url":"https://syntology.ai/paper/2012.15471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15471"}},"official":{"repos":["esiivola/hdssbo"],"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/high-dimensional-bayesian-optimization-via-3","slug":"high-dimensional-bayesian-optimization-via-3","title":"High-Dimensional Bayesian Optimization via Tree-Structured Additive Models","date":"2020-12-24","arxiv_id":"2012.13088","repositories_listed":1,"syntology":null},{"url":"/paper/an-information-theoretic-framework-for-3","slug":"an-information-theoretic-framework-for-3","title":"An Information-Theoretic Framework for Unifying Active Learning Problems","date":"2020-12-19","arxiv_id":"2012.10695","repositories_listed":1,"syntology":null},{"url":"/paper/top-k-ranking-bayesian-optimization","slug":"top-k-ranking-bayesian-optimization","title":"Top-$k$ Ranking Bayesian Optimization","date":"2020-12-19","arxiv_id":"2012.10688","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/top-k-ranking-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/2012.10688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.10688"}},"official":{"repos":["sebtsh/Top-k-Ranking-Bayesian-Optimization"],"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/solving-black-box-optimization-challenge-via","slug":"solving-black-box-optimization-challenge-via","title":"Solving Black-Box Optimization Challenge via Learning Search Space Partition for Local Bayesian Optimization","date":"2020-12-18","arxiv_id":"2012.10335","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-multi-armed-bandit","slug":"bayesian-optimization-multi-armed-bandit","title":"Bayesian Optimization -- Multi-Armed Bandit Problem","date":"2020-12-14","arxiv_id":"2012.07885","repositories_listed":1,"syntology":null},{"url":"/paper/mercer-features-for-efficient-combinatorial","slug":"mercer-features-for-efficient-combinatorial","title":"Mercer Features for Efficient Combinatorial Bayesian Optimization","date":"2020-12-14","arxiv_id":"2012.07762","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/mercer-features-for-efficient-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2012.07762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07762"}},"official":{"repos":["aryandeshwal/MerCBO"],"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/accelerating-high-throughput-virtual","slug":"accelerating-high-throughput-virtual","title":"Accelerating high-throughput virtual screening through molecular pool-based active learning","date":"2020-12-13","arxiv_id":"2012.07127","repositories_listed":1,"syntology":null},{"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/differential-evolution-for-neural","slug":"differential-evolution-for-neural","title":"Differential Evolution for Neural Architecture Search","date":"2020-12-11","arxiv_id":"2012.06400","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/differential-evolution-for-neural#ran","syntology_url":"https://syntology.ai/paper/2012.06400","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.06400"}},"official":{"repos":["automl/DE-NAS"],"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/neural-fidelity-warping-for-efficient-robot","slug":"neural-fidelity-warping-for-efficient-robot","title":"Neural fidelity warping for efficient robot morphology design","date":"2020-12-08","arxiv_id":"2012.04195","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-circuit-design-search","slug":"quantum-circuit-design-search","title":"Quantum Circuit Design Search","date":"2020-12-07","arxiv_id":"2012.04046","repositories_listed":1,"syntology":null},{"url":"/paper/diversity-guided-multi-objective-bayesian","slug":"diversity-guided-multi-objective-bayesian","title":"Diversity-Guided Multi-Objective Bayesian Optimization With Batch Evaluations","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-contextual-policy-search","slug":"high-dimensional-contextual-policy-search","title":"High-Dimensional Contextual Policy Search with Unknown Context Rewards using Bayesian Optimization","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/task-agnostic-amortized-inference-of-gaussian","slug":"task-agnostic-amortized-inference-of-gaussian","title":"Task-Agnostic Amortized Inference of Gaussian Process Hyperparameters","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/autonomous-graph-mining-algorithm-search-with","slug":"autonomous-graph-mining-algorithm-search-with","title":"Autonomous Graph Mining Algorithm Search with Best Speed/Accuracy Trade-off","date":"2020-11-26","arxiv_id":"2011.14925","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/policy-transfer-via-kinematic-domain","slug":"policy-transfer-via-kinematic-domain","title":"Policy Transfer via Kinematic Domain Randomization and Adaptation","date":"2020-11-03","arxiv_id":"2011.01891","repositories_listed":1,"syntology":null},{"url":"/paper/max-value-entropy-search-for-multi-objective-2","slug":"max-value-entropy-search-for-multi-objective-2","title":"Improved Max-value Entropy Search for Multi-objective Bayesian Optimization with Constraints","date":"2020-11-02","arxiv_id":"2011.01150","repositories_listed":1,"syntology":null},{"url":"/paper/a-computationally-efficient-approach-to-black","slug":"a-computationally-efficient-approach-to-black","title":"A Domain-Shrinking based Bayesian Optimization Algorithm with Order-Optimal Regret Performance","date":"2020-10-27","arxiv_id":"2010.13997","repositories_listed":1,"syntology":null},{"url":"/paper/private-outsourced-bayesian-optimization","slug":"private-outsourced-bayesian-optimization","title":"Private Outsourced Bayesian Optimization","date":"2020-10-24","arxiv_id":"2010.12799","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/private-outsourced-bayesian-optimization#ran","syntology_url":"https://syntology.ai/paper/2010.12799","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12799"}},"official":{"repos":["Mitan/po-gp-ucb"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/high-dimensional-bayesian-optimization-via-2","slug":"high-dimensional-bayesian-optimization-via-2","title":"High-Dimensional Bayesian Optimization via Nested Riemannian Manifolds","date":"2020-10-21","arxiv_id":"2010.10904","repositories_listed":1,"syntology":{"n":19,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":6,"n_honours":1,"n_violates":1,"n_no_contract":10,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 1 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/high-dimensional-bayesian-optimization-via-2#ran","syntology_url":"https://syntology.ai/paper/2010.10904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.10904"}},"official":{"repos":["NoemieJaquier/GaBOtorch"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-bayesian-optimization-via-thompson","slug":"federated-bayesian-optimization-via-thompson","title":"Federated Bayesian Optimization via Thompson Sampling","date":"2020-10-20","arxiv_id":"2010.10154","repositories_listed":1,"syntology":null},{"url":"/paper/finding-physical-adversarial-examples-for-1","slug":"finding-physical-adversarial-examples-for-1","title":"Finding Physical Adversarial Examples for Autonomous Driving with Fast and Differentiable Image Compositing","date":"2020-10-17","arxiv_id":"2010.08844","repositories_listed":1,"syntology":null},{"url":"/paper/robot-learning-with-crash-constraints","slug":"robot-learning-with-crash-constraints","title":"Robot Learning with Crash Constraints","date":"2020-10-16","arxiv_id":"2010.08669","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimized-monte-carlo-planning","slug":"bayesian-optimized-monte-carlo-planning","title":"Bayesian Optimized Monte Carlo Planning","date":"2020-10-07","arxiv_id":"2010.03597","repositories_listed":1,"syntology":null},{"url":"/paper/additive-tree-structured-conditional","slug":"additive-tree-structured-conditional","title":"Additive Tree-Structured Conditional Parameter Spaces in Bayesian Optimization: A Novel Covariance Function and a Fast Implementation","date":"2020-10-06","arxiv_id":"2010.03171","repositories_listed":1,"syntology":null},{"url":"/paper/adalead-a-simple-and-robust-adaptive-greedy-1","slug":"adalead-a-simple-and-robust-adaptive-greedy-1","title":"AdaLead: A simple and robust adaptive greedy search algorithm for sequence design","date":"2020-10-05","arxiv_id":"2010.02141","repositories_listed":1,"syntology":null},{"url":"/paper/boss-bayesian-optimization-over-string-spaces","slug":"boss-bayesian-optimization-over-string-spaces","title":"BOSS: Bayesian Optimization over String Spaces","date":"2020-10-02","arxiv_id":"2010.00979","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/boss-bayesian-optimization-over-string-spaces#ran","syntology_url":"https://syntology.ai/paper/2010.00979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00979"}},"official":{"repos":["henrymoss/BOSS"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-task-causal-learning-with-gaussian","slug":"multi-task-causal-learning-with-gaussian","title":"Multi-task Causal Learning with Gaussian Processes","date":"2020-09-27","arxiv_id":"2009.12821","repositories_listed":1,"syntology":null},{"url":"/paper/information-theoretic-multi-objective","slug":"information-theoretic-multi-objective","title":"Information-Theoretic Multi-Objective Bayesian Optimization with Continuous Approximations","date":"2020-09-12","arxiv_id":"2009.05700","repositories_listed":1,"syntology":null},{"url":"/paper/confuciux-autonomous-hardware-resource","slug":"confuciux-autonomous-hardware-resource","title":"ConfuciuX: Autonomous Hardware Resource Assignment for DNN Accelerators using Reinforcement Learning","date":"2020-09-04","arxiv_id":"2009.02010","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"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: 1 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/confuciux-autonomous-hardware-resource#ran","syntology_url":"https://syntology.ai/paper/2009.02010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.02010"}},"official":{"repos":["maestro-project/confuciux"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-combinatorial-bayesian-optimization","slug":"scalable-combinatorial-bayesian-optimization","title":"Scalable Combinatorial Bayesian Optimization with Tractable Statistical models","date":"2020-08-18","arxiv_id":"2008.08177","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-aware-search-framework-for-multi","slug":"uncertainty-aware-search-framework-for-multi","title":"Uncertainty aware Search Framework for Multi-Objective Bayesian Optimization with Constraints","date":"2020-08-16","arxiv_id":"2008.07029","repositories_listed":1,"syntology":null},{"url":"/paper/a-hierarchical-approach-to-scaling-batch","slug":"a-hierarchical-approach-to-scaling-batch","title":"A Hierarchical Approach to Scaling Batch Active Search Over Structured Data","date":"2020-07-20","arxiv_id":"2007.10263","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-for-automatic-design-of","slug":"bayesian-optimization-for-automatic-design-of","title":"Bayesian optimization for automatic design of face stimuli","date":"2020-07-20","arxiv_id":"2007.09989","repositories_listed":1,"syntology":null},{"url":"/paper/hard-label-black-box-adversarial-attacks-in","slug":"hard-label-black-box-adversarial-attacks-in","title":"Simple and Efficient Hard Label Black-box Adversarial Attacks in Low Query Budget Regimes","date":"2020-07-13","arxiv_id":"2007.07210","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/hard-label-black-box-adversarial-attacks-in#ran","syntology_url":"https://syntology.ai/paper/2007.07210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.07210"}},"official":{"repos":["satyanshukla/bayes_attack"],"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/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/accurate-characterization-of-non-uniformly","slug":"accurate-characterization-of-non-uniformly","title":"Accurate Characterization of Non-Uniformly Sampled Time Series using Stochastic Differential Equations","date":"2020-07-02","arxiv_id":"2007.01073","repositories_listed":1,"syntology":null},{"url":"/paper/high-dimensional-bayesian-optimization","slug":"high-dimensional-bayesian-optimization","title":"High Dimensional Bayesian Optimization Assisted by Principal Component Analysis","date":"2020-07-02","arxiv_id":"2007.00925","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-nonmyopic-bayesian-optimization-via","slug":"efficient-nonmyopic-bayesian-optimization-via","title":"Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Trees","date":"2020-06-29","arxiv_id":"2006.15779","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/efficient-nonmyopic-bayesian-optimization-via#ran","syntology_url":"https://syntology.ai/paper/2006.15779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15779"}},"official":null}},{"url":"/paper/pareto-active-learning-with-gaussian","slug":"pareto-active-learning-with-gaussian","title":"Beyond Grids: Multi-objective Bayesian Optimization With Adaptive Discretization","date":"2020-06-24","arxiv_id":"2006.14061","repositories_listed":1,"syntology":null},{"url":"/paper/fast-matrix-square-roots-with-applications-to","slug":"fast-matrix-square-roots-with-applications-to","title":"Fast Matrix Square Roots with Applications to Gaussian Processes and Bayesian Optimization","date":"2020-06-19","arxiv_id":"2006.11267","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/fast-matrix-square-roots-with-applications-to#ran","syntology_url":"https://syntology.ai/paper/2006.11267","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11267"}},"official":{"repos":["gpleiss/ciq_experiments"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/likelihood-free-inference-with-deep-gaussian","slug":"likelihood-free-inference-with-deep-gaussian","title":"Likelihood-Free Inference with Deep Gaussian Processes","date":"2020-06-18","arxiv_id":"2006.10571","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-quantification-using-martingales","slug":"uncertainty-quantification-using-martingales","title":"Uncertainty quantification using martingales for misspecified Gaussian processes","date":"2020-06-12","arxiv_id":"2006.07368","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/uncertainty-quantification-using-martingales#ran","syntology_url":"https://syntology.ai/paper/2006.07368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07368"}},"official":null}},{"url":"/paper/adaptation-strategies-for-automated-machine","slug":"adaptation-strategies-for-automated-machine","title":"Adaptation Strategies for Automated Machine Learning on Evolving Data","date":"2020-06-09","arxiv_id":"2006.06480","repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-expected-hypervolume","slug":"differentiable-expected-hypervolume","title":"Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimization","date":"2020-06-09","arxiv_id":"2006.05078","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/epidemiologically-and-socio-economically","slug":"epidemiologically-and-socio-economically","title":"Epidemiologically and Socio-economically Optimal Policies via Bayesian Optimization","date":"2020-05-22","arxiv_id":"2005.11257","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/informative-path-planning-for-anomaly","slug":"informative-path-planning-for-anomaly","title":"Informative Path Planning for Extreme Anomaly Detection in Environment Exploration and Monitoring","date":"2020-05-20","arxiv_id":"2005.10040","repositories_listed":1,"syntology":null},{"url":"/paper/a-robust-experimental-evaluation-of-automated","slug":"a-robust-experimental-evaluation-of-automated","title":"A Robust Experimental Evaluation of Automated Multi-Label Classification Methods","date":"2020-05-16","arxiv_id":"2005.08083","repositories_listed":1,"syntology":null},{"url":"/paper/excursion-search-for-constrained-bayesian","slug":"excursion-search-for-constrained-bayesian","title":"Excursion Search for Constrained Bayesian Optimization under a Limited Budget of Failures","date":"2020-05-15","arxiv_id":"2005.07443","repositories_listed":1,"syntology":null},{"url":"/paper/finding-game-levels-with-the-right-difficulty","slug":"finding-game-levels-with-the-right-difficulty","title":"Finding Game Levels with the Right Difficulty in a Few Trials through Intelligent Trial-and-Error","date":"2020-05-15","arxiv_id":"2005.07677","repositories_listed":1,"syntology":null},{"url":"/paper/autotune-automatically-tuning-convolutional","slug":"autotune-automatically-tuning-convolutional","title":"AutoTune: Automatically Tuning Convolutional Neural Networks for Improved Transfer Learning","date":"2020-04-25","arxiv_id":"2005.02165","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-guide-random-search-1","slug":"learning-to-guide-random-search-1","title":"Learning to Guide Random Search","date":"2020-04-25","arxiv_id":"2004.12214","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"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 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learning-to-guide-random-search-1#ran","syntology_url":"https://syntology.ai/paper/2004.12214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12214"}},"official":{"repos":["intel-isl/LMRS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-optimization-with-output-weighted","slug":"bayesian-optimization-with-output-weighted","title":"Bayesian Optimization with Output-Weighted Optimal Sampling","date":"2020-04-22","arxiv_id":"2004.10599","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-predictive-entropy-search-for-multi","slug":"parallel-predictive-entropy-search-for-multi","title":"Parallel Predictive Entropy Search for Multi-objective Bayesian Optimization with Constraints","date":"2020-04-01","arxiv_id":"2004.00601","repositories_listed":1,"syntology":null},{"url":"/paper/npenas-neural-predictor-guided-evolution-for","slug":"npenas-neural-predictor-guided-evolution-for","title":"NPENAS: Neural Predictor Guided Evolution for Neural Architecture Search","date":"2020-03-28","arxiv_id":"2003.12857","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/npenas-neural-predictor-guided-evolution-for#ran","syntology_url":"https://syntology.ai/paper/2003.12857","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.12857"}},"official":{"repos":["auroua/NPENASv1"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/knot-selection-in-sparse-gaussian-processes-1","slug":"knot-selection-in-sparse-gaussian-processes-1","title":"Knot Selection in Sparse Gaussian Processes with a Variational Objective Function","date":"2020-03-05","arxiv_id":"2003.02729","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/differentiating-the-black-box-optimization","slug":"differentiating-the-black-box-optimization","title":"Black-Box Optimization with Local Generative Surrogates","date":"2020-02-11","arxiv_id":"2002.04632","repositories_listed":1,"syntology":null},{"url":"/paper/noisy-input-entropy-search-for-efficient","slug":"noisy-input-entropy-search-for-efficient","title":"Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization","date":"2020-02-07","arxiv_id":"2002.02820","repositories_listed":1,"syntology":null},{"url":"/paper/re-examining-linear-embeddings-for-high-1","slug":"re-examining-linear-embeddings-for-high-1","title":"Re-Examining Linear Embeddings for High-Dimensional Bayesian Optimization","date":"2020-01-31","arxiv_id":"2001.11659","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-neural-architecture-search-using-a","slug":"bayesian-neural-architecture-search-using-a","title":"Bayesian Neural Architecture Search using A Training-Free Performance Metric","date":"2020-01-29","arxiv_id":"2001.10726","repositories_listed":1,"syntology":null},{"url":"/paper/discovery-of-self-assembling-conjugated","slug":"discovery-of-self-assembling-conjugated","title":"Discovery of Self-Assembling $π$-Conjugated Peptides by Active Learning-Directed Coarse-Grained Molecular Simulation","date":"2020-01-27","arxiv_id":"2002.01563","repositories_listed":1,"syntology":null},{"url":"/paper/flexibo-cost-aware-multi-objective","slug":"flexibo-cost-aware-multi-objective","title":"FlexiBO: A Decoupled Cost-Aware Multi-Objective Optimization Approach for Deep Neural Networks","date":"2020-01-18","arxiv_id":"2001.06588","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/flexibo-cost-aware-multi-objective#ran","syntology_url":"https://syntology.ai/paper/2001.06588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.06588"}},"official":{"repos":["softsys4ai/FlexiBO"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"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/stepwise-model-selection-for-sequence","slug":"stepwise-model-selection-for-sequence","title":"Stepwise Model Selection for Sequence Prediction via Deep Kernel Learning","date":"2020-01-12","arxiv_id":"2001.03898","repositories_listed":1,"syntology":null},{"url":"/paper/expected-improvement-versus-predicted-value","slug":"expected-improvement-versus-predicted-value","title":"Expected Improvement versus Predicted Value in Surrogate-Based Optimization","date":"2020-01-09","arxiv_id":"2001.02957","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-task-embedding-for-few-shot-bayesian","slug":"bayesian-task-embedding-for-few-shot-bayesian","title":"Bayesian task embedding for few-shot Bayesian optimization","date":"2020-01-02","arxiv_id":"2001.00637","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-initializations-for-image-1","slug":"meta-learning-initializations-for-image-1","title":"Meta-Learning Initializations for Image Segmentation","date":"2019-12-13","arxiv_id":"1912.06290","repositories_listed":1,"syntology":null},{"url":"/paper/max-value-entropy-search-for-multi-objective","slug":"max-value-entropy-search-for-multi-objective","title":"Max-value Entropy Search for Multi-Objective Bayesian Optimization","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/offline-contextual-bayesian-optimization","slug":"offline-contextual-bayesian-optimization","title":"Offline Contextual Bayesian Optimization","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-for-categorical-and","slug":"bayesian-optimization-for-categorical-and","title":"Bayesian Optimization for Categorical and Category-Specific Continuous Inputs","date":"2019-11-28","arxiv_id":"1911.12473","repositories_listed":1,"syntology":null},{"url":"/paper/multi-objective-neural-architecture-search-1","slug":"multi-objective-neural-architecture-search-1","title":"Bridging the Gap between Sample-based and One-shot Neural Architecture Search with BONAS","date":"2019-11-21","arxiv_id":"1911.09336","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-combinatorial-optimization-using","slug":"black-box-combinatorial-optimization-using","title":"Black-box Combinatorial Optimization using Models with Integer-valued Minima","date":"2019-11-20","arxiv_id":"1911.08817","repositories_listed":1,"syntology":null},{"url":"/paper/a-programmable-approach-to-model-compression","slug":"a-programmable-approach-to-model-compression","title":"A Programmable Approach to Neural Network Compression","date":"2019-11-06","arxiv_id":"1911.02497","repositories_listed":1,"syntology":null},{"url":"/paper/thompson-sampling-for-contextual-bandit","slug":"thompson-sampling-for-contextual-bandit","title":"Thompson Sampling for Contextual Bandit Problems with Auxiliary Safety Constraints","date":"2019-11-02","arxiv_id":"1911.00638","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-with-unknown-search","slug":"bayesian-optimization-with-unknown-search","title":"Bayesian Optimization with Unknown Search Space","date":"2019-10-29","arxiv_id":"1910.13092","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-legacy-data-to-accelerate","slug":"leveraging-legacy-data-to-accelerate","title":"Leveraging Legacy Data to Accelerate Materials Design via Preference Learning","date":"2019-10-25","arxiv_id":"1910.11516","repositories_listed":1,"syntology":null},{"url":"/paper/exploration-via-sample-efficient-subgoal","slug":"exploration-via-sample-efficient-subgoal","title":"Dynamic Subgoal-based Exploration via Bayesian Optimization","date":"2019-10-21","arxiv_id":"1910.09143","repositories_listed":1,"syntology":null},{"url":"/paper/parameter-estimation-for-biochemical-reaction","slug":"parameter-estimation-for-biochemical-reaction","title":"Parameter estimation for biochemical reaction networks using Wasserstein distances","date":"2019-10-21","arxiv_id":"1907.07986","repositories_listed":1,"syntology":null},{"url":"/paper/black-box-adversarial-attacks-with-bayesian","slug":"black-box-adversarial-attacks-with-bayesian","title":"Black-box Adversarial Attacks with Bayesian Optimization","date":"2019-09-30","arxiv_id":"1909.13857","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-for-iterative-learning","slug":"bayesian-optimization-for-iterative-learning","title":"Bayesian Optimization for Iterative Learning","date":"2019-09-20","arxiv_id":"1909.09593","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-under-heavy-tailed","slug":"bayesian-optimization-under-heavy-tailed","title":"Bayesian Optimization under Heavy-tailed Payoffs","date":"2019-09-16","arxiv_id":"1909.07040","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-nonmyopic-bayesian-optimization-and","slug":"efficient-nonmyopic-bayesian-optimization-and","title":"BINOCULARS for Efficient, Nonmyopic Sequential Experimental Design","date":"2019-09-10","arxiv_id":"1909.04568","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/efficient-nonmyopic-bayesian-optimization-and#ran","syntology_url":"https://syntology.ai/paper/1909.04568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.04568"}},"official":null}},{"url":"/paper/190807980","slug":"190807980","title":"A tree-based radial basis function method for noisy parallel surrogate optimization","date":"2019-08-21","arxiv_id":"1908.07980","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/chembo-bayesian-optimization-of-small-organic","slug":"chembo-bayesian-optimization-of-small-organic","title":"ChemBO: Bayesian Optimization of Small Organic Molecules with Synthesizable Recommendations","date":"2019-08-05","arxiv_id":"1908.01425","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/chembo-bayesian-optimization-of-small-organic#ran","syntology_url":"https://syntology.ai/paper/1908.01425","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.01425"}},"official":null}},{"url":"/paper/improving-attacks-on-round-reduced-speck32-64","slug":"improving-attacks-on-round-reduced-speck32-64","title":"Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning","date":"2019-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/no-past-bo-normalized-portfolio-allocation","slug":"no-past-bo-normalized-portfolio-allocation","title":"No-PASt-BO: Normalized Portfolio Allocation Strategy for Bayesian Optimization","date":"2019-08-01","arxiv_id":"1908.00361","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/on-the-design-of-black-box-adversarial","slug":"on-the-design-of-black-box-adversarial","title":"On the Design of Black-box Adversarial Examples by Leveraging Gradient-free Optimization and Operator Splitting Method","date":"2019-07-26","arxiv_id":"1907.11684","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/on-the-design-of-black-box-adversarial#ran","syntology_url":"https://syntology.ai/paper/1907.11684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11684"}},"official":{"repos":["LinLabNEU/Blackbox_ADMM"],"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/high-dimensional-bayesian-optimization-via-1","slug":"high-dimensional-bayesian-optimization-via-1","title":"High Dimensional Bayesian Optimization via Supervised Dimension Reduction","date":"2019-07-21","arxiv_id":"1907.08953","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-optimization-in-variational-latent","slug":"bayesian-optimization-in-variational-latent","title":"Bayesian Optimization in Variational Latent Spaces with Dynamic Compression","date":"2019-07-10","arxiv_id":"1907.04796","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":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bayesian-optimization-in-variational-latent#ran","syntology_url":"https://syntology.ai/paper/1907.04796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.04796"}},"official":{"repos":["contactrika/bo-svae-dc"],"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"]}}}],"record_sha256":"05a9b7896b510f0f7d7f98866d59b752e3a662ba6a19ae84aa724fe41472cf8b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}