{"id":"W2804176675","doi":"10.1007/978-3-319-92007-8_38","title":"The Hierarchical Continuous Pursuit Learning Automation for Large Numbers of Actions","year":2018,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hierarchy; Action (physics); Computer science; Operator (biology); Scheme (mathematics); Curse of dimensionality; Discretization; Artificial intelligence; Theoretical computer science; Mathematics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":true,"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.0006966694,0.0001340493,0.0002049906,0.0004574706,0.0004482192,0.0001239956,0.001057302,0.0002834203,0.00002002061],"category_scores_gemma":[0.0002634035,0.0001178467,0.00004401058,0.000189044,0.0003436415,0.001255055,0.0003909463,0.0004736928,0.0000179387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005373608,"about_ca_system_score_gemma":0.0000709488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001750203,"about_ca_topic_score_gemma":0.00005598764,"domain_scores_codex":[0.9988131,0.00004652147,0.0006388852,0.0001319746,0.0001864623,0.0001830722],"domain_scores_gemma":[0.9979253,0.0003535889,0.0006300975,0.0006733831,0.0003887601,0.00002882992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007063272,0.000006607345,0.00001669031,0.00002441319,0.000006922696,2.057767e-8,0.0004511942,0.0001000984,9.946988e-7,0.8314465,0.0001650513,0.1677745],"study_design_scores_gemma":[0.000355545,0.00008720149,0.00001057921,0.00007409441,0.000003164551,0.000004487759,0.0002931993,0.0362839,0.00002051808,0.1923652,0.7703976,0.0001045105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003871198,0.003367876,0.8000818,0.005498679,0.0002109056,0.001158827,0.00001923338,0.0004406861,0.1891833],"genre_scores_gemma":[0.1698224,0.2555403,0.4476107,0.001745223,0.0001284936,0.002453089,0.001437876,0.0001397743,0.1211222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7702326,"threshold_uncertainty_score":0.4805649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01136738727216512,"score_gpt":0.2856070731466235,"score_spread":0.2742396858744583,"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."}}