{"id":"W3130019250","doi":"10.1109/globecom42002.2020.9348092","title":"Construction of Polar Codes with Reinforcement Learning","year":2020,"lang":"en","type":"article","venue":"","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Traverse; Code (set theory); Polar code; Reinforcement learning; Algorithm; Decoding methods; Sorting; Polar; Frame (networking); Equivalence (formal languages); Artificial intelligence; Mathematics; Telecommunications; Programming language","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008232168,0.00005569548,0.00008594341,0.00003270798,0.00003702808,0.00002173187,0.0002309714,0.00001835431,0.00001636758],"category_scores_gemma":[0.00003949015,0.00004459863,0.00001778404,0.0002224444,0.00003233004,0.0001815969,0.00009435272,0.00009135297,0.000005177724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001107263,"about_ca_system_score_gemma":0.00002879516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006018443,"about_ca_topic_score_gemma":0.000003894706,"domain_scores_codex":[0.9994879,0.00002242792,0.0001154736,0.0001401822,0.0001499392,0.00008412507],"domain_scores_gemma":[0.9996557,0.00002628281,0.00008256247,0.0001320007,0.00006495277,0.00003850285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001251502,0.00004965124,0.07934145,0.0001885138,0.0001238378,0.00002471931,0.01022991,0.02734378,0.06718815,0.6678523,0.001654088,0.1458785],"study_design_scores_gemma":[0.0004573987,0.002733076,0.0007863612,0.00008068761,0.0000121145,0.00006404136,0.000774516,0.4212247,0.5690489,0.001252812,0.003167895,0.0003974382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01597189,0.000007760949,0.9717548,0.0006432872,0.00002614539,0.00006553865,4.942411e-8,0.0005514405,0.01097902],"genre_scores_gemma":[0.7079568,0.000002251405,0.2918435,0.0001349369,0.000007378903,0.000001515938,3.022709e-7,0.000002624026,0.00005067729],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6919849,"threshold_uncertainty_score":0.1818679,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01538524605428178,"score_gpt":0.230808551317306,"score_spread":0.2154233052630243,"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."}}