{"id":"W2127300249","doi":"10.1109/tit.2009.2016018","title":"Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\\ell _{1}$-Constrained Quadratic Programming (Lasso)","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1252,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation","keywords":"Lasso (programming language); Compressed sensing; Dimension (graph theory); Algorithm; Mathematics; Quadratic programming; Quadratic equation; Gaussian; Combinatorics; Noise (video); Computer science; Applied mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence; Physics","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.008289787,0.001678433,0.002440149,0.001139095,0.0006598149,0.002049217,0.002282837,0.002660217,0.002927066],"category_scores_gemma":[0.04343861,0.001051856,0.001121499,0.00117493,0.003873799,0.004397609,0.004306234,0.004105456,0.0006585838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001383567,"about_ca_system_score_gemma":0.002228765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002034457,"about_ca_topic_score_gemma":0.001354012,"domain_scores_codex":[0.9959612,0.001617638,0.0002361489,0.0007769157,0.001061977,0.0003460287],"domain_scores_gemma":[0.9794881,0.01579533,0.001884268,0.0009654805,0.001309292,0.0005576939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007218246,0.0001684112,0.00183432,0.0008353046,0.0001707313,0.0005485772,0.0005198818,0.6609396,0.01523545,0.2449755,0.006453958,0.0675965],"study_design_scores_gemma":[0.00002769798,0.00007559649,0.0003609151,0.00005056592,0.00001128481,0.00006030039,0.00003544316,0.9337121,0.001795932,0.06325095,0.0005934231,0.00002581709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01219164,0.0004687935,0.9848579,0.0007062337,0.00003377171,0.0000420795,0.0001341888,0.0002351489,0.001330136],"genre_scores_gemma":[0.5664553,0.001432796,0.4254076,0.0009739088,0.0002592074,0.00065885,0.0008915174,0.0003978467,0.003522954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008289787,"threshold_uncertainty_score":0.04384106,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01285032071729191,"score_gpt":0.2205997337126051,"score_spread":0.2077494129953132,"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."}}