{"id":"W3113771923","doi":"10.1109/tit.2021.3124598","title":"NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Logarithm; Compressed sensing; Rate of convergence; Algorithm; Inverse; Approximation error; Square root; Mathematics; Convergence (economics); Thresholding; Word error rate; Binary number; Mean squared error; Computer science; Key (lock); Arithmetic; Statistics; Mathematical analysis; Artificial intelligence; Image (mathematics)","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003285299,0.0004286324,0.0003937419,0.0003599316,0.0002409929,0.0003121443,0.0002107229,0.0003093876,0.00003455506],"category_scores_gemma":[0.000002877854,0.0004220236,0.0001858631,0.0001514721,0.00007960022,0.0004508863,0.000005331663,0.0006542514,0.00001255414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336849,"about_ca_system_score_gemma":0.00008930976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001284181,"about_ca_topic_score_gemma":0.000005646925,"domain_scores_codex":[0.998587,0.0001106745,0.0004945296,0.0002508252,0.0002386372,0.0003182949],"domain_scores_gemma":[0.9985911,0.0001725471,0.0001531802,0.0006316733,0.0003378947,0.000113559],"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.00007868931,0.0000399879,1.36742e-8,0.0000870661,0.0001426181,0.000003516304,0.001262475,0.8826385,0.0004401558,0.00006221115,0.00004950663,0.1151952],"study_design_scores_gemma":[0.000478811,0.00008368479,0.000001905767,0.0003448511,0.0001149774,0.00002028321,0.0006438238,0.8060954,0.1913039,0.0001175306,0.000364969,0.0004298278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02136574,0.0000404026,0.9743541,0.00001360319,0.001205748,0.0008426246,0.0002170773,0.001403193,0.0005574655],"genre_scores_gemma":[0.8190459,0.00003487461,0.1801926,0.0001481555,0.00006953,0.0001383517,0.0002520941,0.00008401325,0.00003447053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7976801,"threshold_uncertainty_score":0.9998232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01472685111849848,"score_gpt":0.2387816673977413,"score_spread":0.2240548162792429,"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."}}