{"id":"W2935647296","doi":"10.1287/opre.2018.1835","title":"Robust Dual Dynamic Programming","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":88,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council; Imperial College London","keywords":"Mathematical optimization; Bounding overwatch; Dynamic programming; Computer science; Scheme (mathematics); Dual (grammatical number); Stylized fact; Upper and lower bounds; Robust optimization; Embedding; Algorithm; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004942699,0.00007045919,0.0001198045,0.0005462215,0.0005017834,0.001124267,0.0004284788,0.00006956996,0.002399222],"category_scores_gemma":[0.001353453,0.00005201154,0.0000457008,0.001992694,0.00009032916,0.0005687737,0.0001446921,0.0002715056,0.008027744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005497534,"about_ca_system_score_gemma":0.000242178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001344966,"about_ca_topic_score_gemma":0.0004891644,"domain_scores_codex":[0.9966334,0.0003910888,0.0003470834,0.0004067871,0.001875276,0.0003463397],"domain_scores_gemma":[0.9976973,0.00038564,0.00001821649,0.0006457676,0.001148431,0.0001046533],"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.00002465134,0.0001599453,0.01770989,0.00000262957,0.00001287141,0.00001184723,0.001230353,0.7045076,0.001411592,0.01399132,0.01050613,0.2504312],"study_design_scores_gemma":[0.0003051294,0.0001481508,0.007208119,0.000008572064,0.000001938876,0.00001269811,0.001854439,0.8201925,0.0001635314,0.0007532182,0.1692019,0.0001498294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9242259,0.0001530566,0.02310764,0.002944089,0.0004433815,0.001128418,0.0000123406,0.00006179749,0.04792339],"genre_scores_gemma":[0.8991879,0.0001013352,0.01313185,0.00002665233,0.00005511372,0.00005099919,0.00003189447,0.00001151833,0.08740274],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2502814,"threshold_uncertainty_score":0.9999127,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2675650150968807,"score_gpt":0.4947029442188555,"score_spread":0.2271379291219748,"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."}}