{"id":"W3006406045","doi":"10.1609/aaai.v35i5.16512","title":"Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies","year":2021,"lang":"en","type":"preprint","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Institut de Valorisation des Données; Compute Canada; Canadian Institute for Advanced Research","keywords":"Branching (polymer chemistry); Branch and bound; Generalization; Computer science; Tree (set theory); Benchmark (surveying); Search tree; Integer programming; Mathematical optimization; Theoretical computer science; Artificial intelligence; Search algorithm; Mathematics; Algorithm; Combinatorics","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.002642556,0.00129091,0.001356124,0.0007427098,0.000429329,0.001242217,0.001671249,0.001715719,0.00276936],"category_scores_gemma":[0.01480028,0.0006571202,0.0007355809,0.0008217856,0.001211638,0.002063343,0.001642976,0.003277703,0.0008297588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001158078,"about_ca_system_score_gemma":0.002096529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002320348,"about_ca_topic_score_gemma":0.002583315,"domain_scores_codex":[0.9990461,0.0004216108,0.00006145617,0.0001817574,0.0001693673,0.0001196546],"domain_scores_gemma":[0.99394,0.004632974,0.0004156741,0.0004543253,0.0003421786,0.0002148448],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000064795,0.00005747717,0.0006712251,0.00004085147,0.00001808344,0.00002222179,0.000039106,0.95818,0.0006370682,0.007852946,0.0007752613,0.03164094],"study_design_scores_gemma":[0.000006956856,0.000015013,0.00001879407,0.000006478507,0.0000025465,0.000003698153,0.000002803804,0.9957435,0.0002001445,0.003850684,0.0001472649,0.000002101501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04595144,0.0004498569,0.9484079,0.0003356646,0.0000635303,0.0001094498,0.00008631052,0.001066102,0.003529715],"genre_scores_gemma":[0.7093263,0.000385541,0.2868829,0.000343371,0.00005303303,0.0004842033,0.0003527094,0.000297387,0.00187463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00276936,"threshold_uncertainty_score":0.01397532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1157952399877882,"score_gpt":0.3423432507773105,"score_spread":0.2265480107895222,"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."}}