{"id":"W2072327470","doi":"10.1016/j.acha.2009.08.002","title":"Sparse recovery by non-convex optimization – instance optimality","year":2009,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":111,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"American Institute of Mathematics","keywords":"Mathematics; Minification; Regular polygon; Convex optimization; Class (philosophy); Compressed sensing; Algorithm; Matrix (chemical analysis); Restricted isometry property; Mathematical optimization; Computer science; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"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.0000683315,0.0001495999,0.0002483262,0.0001358137,0.00008182339,0.00005722277,0.00008378148,0.00006291529,0.0000320005],"category_scores_gemma":[0.00000182119,0.0001610378,0.00007784745,0.0004976408,0.00002992179,0.00009012994,0.00001343281,0.00009405526,0.000005452608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003485152,"about_ca_system_score_gemma":0.00001081561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006828077,"about_ca_topic_score_gemma":6.952276e-7,"domain_scores_codex":[0.9992473,0.000009457296,0.0002120884,0.0002295442,0.0001520336,0.0001496022],"domain_scores_gemma":[0.9996794,0.00003608598,0.00004948547,0.0001308388,0.00004523134,0.00005891243],"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.00001062307,0.0000206307,0.00004387492,0.000002443581,0.0002354309,0.00000128079,0.00002757559,0.9886784,0.0005170861,0.0009195517,0.00170268,0.007840401],"study_design_scores_gemma":[0.0001736122,0.00001669144,0.002734498,0.000005597391,0.000207515,0.000001323304,0.00001608328,0.990061,0.001063669,0.005359868,0.000161532,0.000198616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06923656,0.0003492061,0.9252796,0.00009052706,0.00001901178,0.00008844354,0.00001217743,0.0002660787,0.004658467],"genre_scores_gemma":[0.9591684,0.0001912567,0.04006,0.0003409063,0.00002243907,0.000007298817,0.0001757962,0.00001008154,0.00002377384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8899319,"threshold_uncertainty_score":0.6566933,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006347213519459692,"score_gpt":0.2035570372072244,"score_spread":0.1972098236877647,"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."}}