{"id":"W3087095379","doi":"10.48550/arxiv.2009.09277","title":"Construction of Polar Codes with Reinforcement Learning","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Traverse; Computer science; Code (set theory); Polar code; Algorithm; Sorting; Reinforcement learning; Decoding methods; Polar; Frame (networking); Equivalence (formal languages); Mathematics; Artificial intelligence; Programming language; Telecommunications; Discrete mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009957398,0.0006627287,0.0005162833,0.0006334547,0.0004046072,0.0006494995,0.0008343116,0.0006627467,0.00241191],"category_scores_gemma":[0.005897713,0.0003498429,0.000442539,0.0004332627,0.001585883,0.000974649,0.0017678,0.001372393,0.0005587483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000652795,"about_ca_system_score_gemma":0.00141735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001500529,"about_ca_topic_score_gemma":0.001048941,"domain_scores_codex":[0.9992713,0.0002718094,0.00002934388,0.0001107727,0.0002303418,0.00008634439],"domain_scores_gemma":[0.9975988,0.001480386,0.0002015039,0.0002214462,0.000372643,0.0001252673],"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.0002017734,0.00006997911,0.0009219884,0.0001448736,0.00002523384,0.0001645015,0.000184538,0.7554161,0.006910928,0.1580634,0.001497583,0.07639903],"study_design_scores_gemma":[0.00002689661,0.00005108863,0.00004809252,0.00001274975,0.000005125647,0.00003924149,0.00001903763,0.9628229,0.003202127,0.03260077,0.001161151,0.00001078649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01602559,0.00006117484,0.9808006,0.00009663793,0.0000216812,0.0000500621,0.00002866204,0.0001830652,0.002732513],"genre_scores_gemma":[0.5743107,0.0003197192,0.4195789,0.0001750225,0.00003783713,0.0002681704,0.0002115632,0.0001315295,0.004966404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00241191,"threshold_uncertainty_score":0.008068621,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05201346662222839,"score_gpt":0.1870268462632307,"score_spread":0.1350133796410023,"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."}}