{"id":"W2949103490","doi":"10.48550/arxiv.1003.0804","title":"Branch and Bound Algorithms for Maximizing Expected Improvement Functions","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Algorithm; Function (biology); Set (abstract data type); Mathematical optimization; Source code; Process (computing); Genetic algorithm; Code (set theory); Gaussian process; Gaussian; Computer experiment; Simulation; Mathematics; Machine learning","routes":{"ca_aff":true,"ca_fund":false,"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.007238001,0.003558846,0.003235202,0.003067563,0.001182106,0.002629815,0.00280177,0.003124247,0.01019219],"category_scores_gemma":[0.02302376,0.00135495,0.001245131,0.00327679,0.002057399,0.002618874,0.002377488,0.004171942,0.002765687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002616483,"about_ca_system_score_gemma":0.003400162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003946329,"about_ca_topic_score_gemma":0.004045406,"domain_scores_codex":[0.9969777,0.001483543,0.0001680803,0.0003842914,0.0007055558,0.0002808477],"domain_scores_gemma":[0.9848737,0.01307897,0.0004490588,0.0004209637,0.0009639153,0.0002134185],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001801908,0.0001725423,0.0007166453,0.0003048746,0.0001046189,0.00007108862,0.0001425773,0.8001626,0.0007280176,0.06367094,0.005621603,0.1281242],"study_design_scores_gemma":[0.00005098691,0.00004714543,0.00008918994,0.00005055131,0.0000238851,0.00002099467,0.00001963317,0.9506834,0.0004360852,0.046869,0.001696777,0.0000123465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002723726,0.0008821722,0.9923441,0.0002952596,0.0000402319,0.0001033883,0.00005363616,0.0004020672,0.00315544],"genre_scores_gemma":[0.09598929,0.001295453,0.8957297,0.0003888898,0.0001350051,0.001243025,0.0003854423,0.000575834,0.004257303],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01019219,"threshold_uncertainty_score":0.03827864,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05901204504488729,"score_gpt":0.2141443307221525,"score_spread":0.1551322856772652,"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."}}