{"id":"W3048518979","doi":"10.1109/tsp.2020.3016571","title":"Signal-Dependent Performance Analysis of Orthogonal Matching Pursuit for Exact Sparse Recovery","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Matching pursuit; Upper and lower bounds; Combinatorics; Mathematics; Compressed sensing; Matrix (chemical analysis); Infinity; Matching (statistics); Exact solutions in general relativity; Random matrix; Algorithm; Discrete mathematics; Statistics; Physics; Mathematical analysis; Quantum mechanics","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.0001388766,0.000232186,0.0004028585,0.0003141639,0.000162535,0.00007311967,0.0001983596,0.0001015315,0.0001018912],"category_scores_gemma":[0.000001662111,0.0002404352,0.0002656611,0.0006877401,0.00003490876,0.0003273696,0.000001679269,0.0002697589,0.000004670372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005099299,"about_ca_system_score_gemma":0.00004335655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005678642,"about_ca_topic_score_gemma":0.000006973874,"domain_scores_codex":[0.9987102,0.00002149454,0.0004011903,0.0002874645,0.000315343,0.0002643251],"domain_scores_gemma":[0.9994506,0.0001002575,0.0001025358,0.0001332831,0.0001133197,0.00009995869],"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.0001358399,0.00003924018,0.00001495534,0.0001271488,0.0003847723,0.000002615175,0.000304984,0.7966441,0.082793,0.000002046552,0.00003463365,0.1195167],"study_design_scores_gemma":[0.0001872935,0.00014491,0.00005992753,0.0001256032,0.0005509463,0.000002590363,0.00007129586,0.6146124,0.3839074,0.00006143119,0.0000579143,0.0002182618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2407602,0.00009677588,0.7582847,0.00003596559,0.00005460658,0.0001567438,0.00004312828,0.0003526045,0.0002152741],"genre_scores_gemma":[0.9951355,0.00004704299,0.004505352,0.0001344732,0.00006135179,0.00003427653,0.000008365656,0.00004969618,0.00002392819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7543753,"threshold_uncertainty_score":0.9804664,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03035995410803876,"score_gpt":0.2429023414116953,"score_spread":0.2125423873036565,"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."}}