{"id":"W2897984390","doi":"10.1007/s10994-019-05833-y","title":"Combining Bayesian optimization and Lipschitz optimization","year":2019,"lang":"en","type":"preprint","venue":"Machine Learning","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Canadian Institute for Advanced Research","keywords":"Lipschitz continuity; Bayesian optimization; Heuristics; Regret; Mathematical optimization; Computer science; Bayesian probability; Constant (computer programming); Optimization problem; Function (biology); Algorithm; Mathematics; Artificial intelligence; Machine learning","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008655819,0.001776748,0.003489531,0.002439526,0.0007747743,0.004121682,0.001942224,0.003422407,0.003922801],"category_scores_gemma":[0.03479904,0.001527905,0.001137036,0.002972691,0.00258446,0.006171033,0.003725921,0.003583192,0.001003709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002055106,"about_ca_system_score_gemma":0.002355595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003793808,"about_ca_topic_score_gemma":0.003519239,"domain_scores_codex":[0.9960594,0.002388559,0.0001574058,0.0003673131,0.0008764848,0.0001507148],"domain_scores_gemma":[0.9849641,0.01200838,0.0006582759,0.0009274949,0.001169399,0.0002724785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001236025,0.00009062103,0.0005385727,0.000336698,0.0002059961,0.00005652766,0.00008944319,0.3001781,0.0007503249,0.6217415,0.005541418,0.07034717],"study_design_scores_gemma":[0.00001262467,0.00001660349,0.0001123288,0.00003565568,0.00002044174,0.00001255164,0.000009032448,0.6856382,0.0002624806,0.312469,0.001395474,0.00001556606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002792356,0.001014012,0.9918087,0.0007915226,0.0000727705,0.0000147037,0.00004066595,0.0001112369,0.003354053],"genre_scores_gemma":[0.3152483,0.005729934,0.654867,0.001118956,0.001471627,0.0003466896,0.0005791829,0.0006739746,0.01996444],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008655819,"threshold_uncertainty_score":0.0457769,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05627383965606547,"score_gpt":0.3841076774584195,"score_spread":0.327833837802354,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}