{"id":"W4315489007","doi":"10.1109/cdc51059.2022.9993165","title":"Near Optimality of Finite Memory Policies for POMPDs with Continuous Spaces","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"National Science Foundation","keywords":"Discretization; Markov decision process; Uncountable set; Convergence (economics); Computer science; State space; Mathematical optimization; Focus (optics); Reduction (mathematics); Applied mathematics; Controllability; Optimal control; Markov process; Stability (learning theory); Filter (signal processing); Mathematics; Discrete mathematics; Mathematical analysis; Machine learning","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.0008161467,0.0002395993,0.0005147911,0.0001589981,0.0005453967,0.0003104975,0.0007861606,0.00004920608,0.0001713125],"category_scores_gemma":[0.0001517511,0.0001902463,0.0001089253,0.0003143836,0.0001497698,0.00015491,0.0001934964,0.0003391468,0.000006297453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002321517,"about_ca_system_score_gemma":0.0001680184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002070955,"about_ca_topic_score_gemma":0.00002061949,"domain_scores_codex":[0.9978788,0.0002193378,0.0003570773,0.0005616146,0.0006358417,0.0003472497],"domain_scores_gemma":[0.9979159,0.0009025946,0.0002749215,0.0005714091,0.0001938537,0.0001413698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003235044,0.0008048961,0.003563247,0.0000815956,0.0002540091,0.00008495797,0.004345664,0.04958319,0.002963395,0.09730528,0.005251276,0.8325275],"study_design_scores_gemma":[0.006156935,0.003439058,0.003172335,0.0000607522,0.0000399087,0.00003868932,0.000849378,0.9628533,0.0003295053,0.003875304,0.01868742,0.0004974814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2876696,0.0003149494,0.7035375,0.003767927,0.0005699703,0.0007676652,0.0001467286,0.0001645095,0.003061102],"genre_scores_gemma":[0.9880972,0.00002454141,0.009567857,0.0009012372,0.00005509234,0.0001104024,0.000005134681,0.00001522003,0.001223335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9132701,"threshold_uncertainty_score":0.7758017,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01664345864876279,"score_gpt":0.2640921500093241,"score_spread":0.2474486913605613,"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."}}