{"id":"W2805646502","doi":"10.1109/syscon.2018.8369536","title":"Applying expectation-maximization evaluation on approximate optimal control","year":2018,"lang":"en","type":"article","venue":"2018 Annual IEEE International Systems Conference (SysCon)","topic":"Adaptive Dynamic Programming Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Maximization; Iterative learning control; Reinforcement learning; Computer science; Frame (networking); Optimal control; Trajectory; Convergence (economics); Tracking (education); Task (project management); Generator (circuit theory); Artificial intelligence; Mathematical optimization; Expectation–maximization algorithm; Control theory (sociology); Control (management); Mathematics; Power (physics); Engineering; Maximum likelihood","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.00728639,0.001400636,0.001943183,0.0008148231,0.0004376568,0.00156332,0.001596063,0.001607633,0.002412819],"category_scores_gemma":[0.01757002,0.000681176,0.0006232713,0.0007458812,0.00193935,0.002049928,0.001984987,0.001602842,0.0004158108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001980444,"about_ca_system_score_gemma":0.001626753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004090538,"about_ca_topic_score_gemma":0.002206877,"domain_scores_codex":[0.9973782,0.001593657,0.0001117744,0.0002452391,0.0005135232,0.0001576028],"domain_scores_gemma":[0.9947193,0.003972937,0.0002412231,0.0002748491,0.000684206,0.0001074859],"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.00006086091,0.00002758035,0.0002266774,0.00007600855,0.00003442855,0.00003415281,0.00004671957,0.9354173,0.0004943068,0.04247491,0.0004325754,0.02067456],"study_design_scores_gemma":[0.000003670121,0.00001696728,0.00001904347,0.000006829279,0.000002081847,0.000004429308,0.000002400693,0.9924825,0.0001660743,0.007159095,0.0001340771,0.000002766382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003003718,0.0001171037,0.9954565,0.0001069021,0.00001478747,0.00002203386,0.000006917055,0.0001026707,0.00116945],"genre_scores_gemma":[0.6522849,0.0003745944,0.3423616,0.0003093212,0.0001098528,0.0003569663,0.0001233919,0.0002594492,0.00381989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00728639,"threshold_uncertainty_score":0.03853452,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03501510710701004,"score_gpt":0.3010516916635031,"score_spread":0.266036584556493,"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."}}