{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216,0.001442385,0.001198277,0.0008690262,0.0006351888,0.001555817,0.001919733,0.001714276,0.006223427],"category_scores_gemma":[0.01024865,0.0004887016,0.0006337249,0.001337719,0.001319172,0.002408306,0.003116729,0.002883737,0.003276173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008287817,"about_ca_system_score_gemma":0.002448485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002421371,"about_ca_topic_score_gemma":0.003492177,"domain_scores_codex":[0.9984321,0.0002838588,0.000105917,0.0002350513,0.0008249925,0.0001181508],"domain_scores_gemma":[0.9980111,0.001008881,0.0001664457,0.0003706116,0.0003316031,0.00011148],"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.0009737054,0.0001957391,0.001076364,0.0008584189,0.0001041695,0.0003988486,0.0005380152,0.1346621,0.04560779,0.1416934,0.0263239,0.6475675],"study_design_scores_gemma":[0.00007696301,0.0001077842,0.0001915051,0.00007853299,0.0000171429,0.0004392375,0.00005493938,0.9355137,0.0158415,0.04030301,0.007327977,0.00004776367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002912538,0.0004374986,0.9926751,0.0003667371,0.0001284183,0.0001094325,0.0002024912,0.001132831,0.002034949],"genre_scores_gemma":[0.09158552,0.0007306637,0.9002077,0.0005883199,0.0001904431,0.0004820387,0.0009822493,0.0004375294,0.004795533],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006223427,"threshold_uncertainty_score":0.02081949,"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."}}