{"id":"W1537507437","doi":"10.1007/11766247_42","title":"The K Best-Paths Approach to Approximate Dynamic Programming with Application to Portfolio Optimization","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Dynamic programming; Reinforcement learning; Mathematical optimization; Markov decision process; Portfolio; Kernel (algebra); Controller (irrigation); Sharpe ratio; Project portfolio management; Portfolio optimization; Artificial intelligence; Markov process; Algorithm; Mathematics; Finance; Project management","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000910231,0.0005491066,0.0003779818,0.0006633803,0.0006089241,0.001446811,0.003749519,0.0002049828,7.862598e-7],"category_scores_gemma":[0.00005527839,0.0004031801,0.00006883285,0.001453709,0.0003333385,0.0004218682,0.001159774,0.0005841971,0.0000288899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004662537,"about_ca_system_score_gemma":0.0003408119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002639651,"about_ca_topic_score_gemma":0.00002110988,"domain_scores_codex":[0.9955986,0.000029227,0.0005714577,0.001600525,0.001360258,0.0008399599],"domain_scores_gemma":[0.9969947,0.0001844317,0.0003816962,0.001838489,0.000383583,0.0002170459],"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.000004474718,0.00001609304,0.0000141387,0.00001658693,0.000005035641,0.000003663107,0.000191737,0.7776374,0.000005755119,0.004459505,0.00001008535,0.2176356],"study_design_scores_gemma":[0.0001179982,0.000262579,0.00001694396,0.0001451409,0.000009600365,0.00003577699,6.100121e-7,0.9952222,0.00003990412,0.001214133,0.002397696,0.0005374748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000005417238,0.00006423254,0.991424,0.0004703366,0.0003570749,0.002017242,0.000001092323,0.0002336871,0.005426908],"genre_scores_gemma":[0.01643472,0.000009677003,0.9817173,0.0005596998,0.0001384535,0.000149701,0.00002089117,0.00005546774,0.000914069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2175848,"threshold_uncertainty_score":0.999842,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008187980339184919,"score_gpt":0.2282887979623957,"score_spread":0.2201008176232107,"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."}}