{"id":"W2141050197","doi":"10.4304/jcp.2.1.12-19","title":"Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization","year":2007,"lang":"en","type":"article","venue":"Journal of Computers","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Dynamic programming; Computer science; Sharpe ratio; Reinforcement learning; Mathematical optimization; Portfolio; Markov decision process; Kernel (algebra); Controller (irrigation); Artificial intelligence; Markov process; Mathematics; Algorithm; Finance","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.001950712,0.0008842945,0.001273054,0.0004502664,0.0004555154,0.0008147105,0.0009614674,0.001426699,0.002285657],"category_scores_gemma":[0.007234935,0.0006959806,0.0005515816,0.0006884267,0.001330989,0.001299737,0.001427423,0.001724639,0.0003067717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001125646,"about_ca_system_score_gemma":0.001173757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002763801,"about_ca_topic_score_gemma":0.002072092,"domain_scores_codex":[0.9991547,0.0004303289,0.00004329907,0.0001399672,0.0001879551,0.00004375878],"domain_scores_gemma":[0.9976115,0.00177743,0.0001642259,0.0001617422,0.000216577,0.00006854233],"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.00005874312,0.00003795115,0.0002163721,0.00003573561,0.00002237581,0.00002807473,0.00003113752,0.9559172,0.000730832,0.01605489,0.0003441145,0.0265227],"study_design_scores_gemma":[0.000003463382,0.000007925673,0.00001366743,0.00000159269,9.415853e-7,0.000002775082,9.341144e-7,0.9953969,0.0001493464,0.004346464,0.00007444484,0.000001496127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006583329,0.00009293699,0.9924873,0.0001241768,0.00001294423,0.00001693202,0.00001163577,0.0001708143,0.0004999828],"genre_scores_gemma":[0.50016,0.0001724148,0.4971606,0.0001217083,0.00003421004,0.0002270602,0.00007843102,0.0001255667,0.001920046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002763801,"threshold_uncertainty_score":0.01031649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007554112725446023,"score_gpt":0.260925085287421,"score_spread":0.253370972561975,"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."}}