{"id":"W4313350174","doi":"10.1016/j.orl.2022.12.006","title":"Gradient boosting for convex cone predict and optimize problems","year":2022,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick; University of Toronto","funders":"","keywords":"Regret; Gradient boosting; Convex optimization; Mathematical optimization; Boosting (machine learning); Regular polygon; Computer science; Quadratic programming; Quadratic equation; Artificial intelligence; Mathematics; Machine learning; Random forest","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.005740351,0.001702031,0.003466228,0.00129247,0.0008718994,0.002131603,0.002406763,0.002416772,0.003457878],"category_scores_gemma":[0.01455876,0.001445254,0.001182434,0.001605034,0.001768503,0.002290057,0.002299222,0.004170518,0.001134989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001419087,"about_ca_system_score_gemma":0.002120282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004416898,"about_ca_topic_score_gemma":0.004070804,"domain_scores_codex":[0.9981782,0.0008673876,0.00007182534,0.0001797481,0.0005095971,0.0001930755],"domain_scores_gemma":[0.9945143,0.003608443,0.0002718483,0.0004152096,0.0008973097,0.0002927936],"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.0002645933,0.0002855767,0.001019117,0.0003775318,0.0001331732,0.0001006101,0.00007322412,0.7196333,0.001667432,0.1243925,0.01455434,0.1374987],"study_design_scores_gemma":[0.000008966909,0.00001451261,0.00005297982,0.00001168386,0.000005936971,0.000008657548,0.000002990502,0.9790322,0.0001470413,0.02023946,0.0004719798,0.000003654342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005843328,0.001133585,0.9899971,0.0005788725,0.0001127948,0.0000535431,0.00005856047,0.0002493868,0.001972898],"genre_scores_gemma":[0.3821076,0.002678766,0.596033,0.0009567398,0.0008398968,0.0005476662,0.0008591215,0.0006354229,0.01534172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005740351,"threshold_uncertainty_score":0.0303582,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2601772201591964,"score_gpt":0.4724558772527916,"score_spread":0.2122786570935952,"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."}}