{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002364819,0.001569113,0.002084322,0.001178924,0.0008165988,0.001694036,0.002179395,0.00261487,0.004389616],"category_scores_gemma":[0.0109311,0.0013888,0.001240057,0.002405591,0.002016898,0.002937543,0.002580327,0.003340842,0.0006769713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291087,"about_ca_system_score_gemma":0.001616866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005562812,"about_ca_topic_score_gemma":0.005585606,"domain_scores_codex":[0.9990568,0.0005241621,0.00004546697,0.0001347535,0.0001861627,0.00005273834],"domain_scores_gemma":[0.9970475,0.002273088,0.0001394585,0.0001643621,0.0002662868,0.0001094005],"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.00004606776,0.00004633194,0.0003431875,0.00009138483,0.00005934361,0.00004672459,0.00006153781,0.8111172,0.0002536834,0.1219256,0.001946903,0.0640621],"study_design_scores_gemma":[0.000006384874,0.00000924496,0.00002825008,0.000007190121,0.000005174762,0.00001073309,0.000004504538,0.9400777,0.00004687878,0.05925135,0.0005472461,0.000005251904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002081796,0.0005582009,0.9950733,0.0001568173,0.00004527044,0.0000140438,0.00002206368,0.00008349688,0.001965076],"genre_scores_gemma":[0.2168352,0.002074896,0.7704574,0.0001761288,0.0001946497,0.0003190157,0.000161667,0.0002775132,0.009503477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005562812,"threshold_uncertainty_score":0.01468474,"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."}}