{"id":"W2924103313","doi":"10.1109/tnnls.2019.2900639","title":"A Conclusive Analysis of the Finite-Time Behavior of the Discretized Pursuit Learning Automaton","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotonic function; Discretization; Markov chain; Automaton; Property (philosophy); Convergence (economics); Combinatorial analysis; Computer science; Finite-state machine; Asymptotic analysis; Monotone polygon; Mathematical economics; Dilemma; Mathematics; Applied mathematics; Theoretical computer science; Algorithm; Combinatorics; Machine learning; Epistemology; Mathematical analysis; Economics; Philosophy","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.0004678381,0.0001370337,0.0003516581,0.0001402976,0.0003971639,0.0001192746,0.0005228997,0.00008612919,0.00003757445],"category_scores_gemma":[0.00001614254,0.00008253525,0.000260334,0.001450013,0.00009773515,0.0001441637,0.00001908032,0.0006168367,0.000002481166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001866321,"about_ca_system_score_gemma":0.00002613957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001104928,"about_ca_topic_score_gemma":0.0000106863,"domain_scores_codex":[0.9979346,0.0008503136,0.0003613017,0.0002628604,0.0003857217,0.0002052351],"domain_scores_gemma":[0.9986449,0.000486972,0.0003270393,0.0003793499,0.000109403,0.00005237436],"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.000009263051,0.00002721261,0.003196276,0.00001619298,0.0001158976,3.354891e-7,0.0005767752,0.993799,0.0005471786,0.0001004401,0.000005050464,0.001606362],"study_design_scores_gemma":[0.0002992395,0.0001163548,0.003114355,0.00007646459,0.0001617569,0.000003736972,0.0001192549,0.9958048,0.00009319375,6.84448e-7,0.0001181613,0.00009199233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3854905,0.0001201018,0.6122376,0.0002848412,0.0007939615,0.0007963807,0.000005188726,0.0001010538,0.0001704197],"genre_scores_gemma":[0.9968819,0.00001984576,0.00006027652,0.00003134457,0.00001134341,0.00002562844,0.000001312469,0.00001066788,0.002957676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6121773,"threshold_uncertainty_score":0.336569,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007687722662617119,"score_gpt":0.2237397000292167,"score_spread":0.2160519773665996,"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."}}