{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008843,0.0001162631,0.0002164302,0.0001108136,0.00009142738,0.0001103232,0.0003196934,0.00005404758,0.00001259769],"category_scores_gemma":[0.00022874,0.0001030813,0.00007550167,0.0002184376,0.0000970429,0.0002443859,0.0002971182,0.0001300918,8.900477e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002193352,"about_ca_system_score_gemma":0.00005632077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001457104,"about_ca_topic_score_gemma":0.000006944934,"domain_scores_codex":[0.9989473,0.00004861586,0.0003465172,0.0002882557,0.0001897704,0.0001795973],"domain_scores_gemma":[0.9985759,0.0009047388,0.0001209199,0.0002580024,0.0001011367,0.00003924841],"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.0002905903,0.0002454258,0.02523791,0.009578763,0.0006166417,0.00004199244,0.05526223,0.1471698,0.09194092,0.3126739,0.01171638,0.3452255],"study_design_scores_gemma":[0.0001091846,0.0002982036,0.0001318828,0.0002487595,0.00001417657,0.00000657852,0.0001417189,0.9273817,0.0691593,0.001502077,0.0008676342,0.0001388233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08592279,0.0002305083,0.9081319,0.00009204353,0.0000906044,0.0002089563,8.632762e-7,0.0004181599,0.004904186],"genre_scores_gemma":[0.8427207,0.00002181649,0.1562562,0.00003776198,0.00001029604,0.00001424015,0.000001322816,0.000008764127,0.0009288597],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7802119,"threshold_uncertainty_score":0.4203535,"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."}}