{"id":"W4402263848","doi":"10.23919/acc60939.2024.10645022","title":"Near-Optimality of Finite-Memory Codes and Reinforcement Learning for Zero-Delay Coding of Markov Sources","year":2024,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Markov chain; Coding (social sciences); Markov process; Zero (linguistics); Algorithm; Mathematics; Artificial intelligence; Machine learning","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001881429,0.0005837122,0.000857935,0.0005183996,0.0004985903,0.0008360943,0.0009377375,0.001042745,0.001262383],"category_scores_gemma":[0.01193501,0.0004053848,0.0004229018,0.00036587,0.002257326,0.001391971,0.00124609,0.001544836,0.0001450848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001810123,"about_ca_system_score_gemma":0.001942115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005369697,"about_ca_topic_score_gemma":0.003440778,"domain_scores_codex":[0.9994523,0.0002305299,0.0000240536,0.0000838353,0.0001127287,0.00009661484],"domain_scores_gemma":[0.9907283,0.008034068,0.0004386322,0.0001782663,0.0004226608,0.0001981302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006347374,0.00002511143,0.000384768,0.00002592768,0.00001149516,0.00003673494,0.0000491633,0.9628785,0.0008263519,0.03103786,0.0001241863,0.004536437],"study_design_scores_gemma":[0.000006275751,0.00001300254,0.0000273799,0.00000422171,0.000001360008,0.000003897419,0.00000416374,0.9880882,0.0003866869,0.01143522,0.00002648843,0.000003146741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1685846,0.0003107519,0.8279638,0.0005537436,0.00003269728,0.00003873592,0.00004430959,0.0001761563,0.002295235],"genre_scores_gemma":[0.9667175,0.0001312229,0.03157209,0.00007177678,0.00001357404,0.00004873901,0.00003929594,0.00003394753,0.001371885],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005369697,"threshold_uncertainty_score":0.01313341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02162692926589364,"score_gpt":0.2806319609386435,"score_spread":0.2590050316727498,"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."}}