{"id":"W1506128430","doi":"","title":"Compact, convex upper bound iteration for approximate POMDP planning","year":2006,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Partially observable Markov decision process; Mathematical optimization; Markov decision process; Upper and lower bounds; Bellman equation; Bounded function; Computer science; Piecewise; Heuristic; Linear programming; Convex optimization; Semidefinite programming; Time horizon; Mathematics; Function (biology); Regular polygon; Markov process","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":[],"consensus_categories":[],"category_scores_codex":[0.000175083,0.00009424931,0.0001055274,0.00006255416,0.000183555,0.0004301515,0.0002342617,0.00003108884,0.00002118464],"category_scores_gemma":[0.00001123067,0.00007768851,0.00004451176,0.00009943464,0.0000151474,0.0003329234,0.00003229314,0.00007387656,0.00002826536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000128251,"about_ca_system_score_gemma":0.00001640392,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001172747,"about_ca_topic_score_gemma":0.000002018555,"domain_scores_codex":[0.9992858,0.00001812343,0.000141702,0.0002230113,0.000120778,0.0002105848],"domain_scores_gemma":[0.9996253,0.00006336305,0.00005222364,0.0001861017,0.00004372995,0.00002929864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001823076,0.0001719089,0.02028023,0.00006906757,0.00002424841,0.0000121619,0.0008388627,0.01827791,0.002104612,0.8776152,0.06182645,0.0187611],"study_design_scores_gemma":[0.0003234071,0.0000406517,0.003399289,0.000009642265,0.000001535054,0.00001089439,0.000008731258,0.9532788,0.0007987392,0.007595003,0.03439911,0.0001341802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01258578,0.00005715311,0.9670003,0.001361357,0.0002455597,0.0001305484,0.00000141754,0.0002748191,0.01834309],"genre_scores_gemma":[0.8736078,3.439928e-7,0.1189253,0.0007632549,0.000373911,0.00001115672,0.00003576141,0.00001098198,0.00627144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9350009,"threshold_uncertainty_score":0.4147961,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01338592560030774,"score_gpt":0.2710485755621948,"score_spread":0.257662649961887,"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."}}