{"id":"W4407287089","doi":"10.1007/s43670-025-00098-0","title":"The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit","year":2025,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Matching pursuit; Lasso (programming language); Greedy algorithm; Algorithm; Computer science; Mathematics; Function (biology); Matching (statistics); Mathematical optimization; Compressed sensing; Statistics; Biology","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.001109605,0.000219585,0.0003324485,0.0002021124,0.0006082873,0.0002419675,0.000708317,0.00009533815,0.000008145877],"category_scores_gemma":[0.00008843149,0.0001448652,0.0001794238,0.000913596,0.0001447736,0.0001831216,0.0001782148,0.0002160705,4.548081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002659912,"about_ca_system_score_gemma":0.0001336899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006895239,"about_ca_topic_score_gemma":0.00008726523,"domain_scores_codex":[0.9986359,0.00009332698,0.0003992175,0.000381272,0.0002244757,0.000265832],"domain_scores_gemma":[0.9978609,0.001046424,0.00016268,0.0007500346,0.0001289921,0.00005095841],"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.0004949501,0.0000501933,0.0009520818,0.0002317072,0.00275925,0.000001971618,0.0001075072,0.1535787,0.007177078,0.002552551,0.0009806423,0.8311134],"study_design_scores_gemma":[0.0002543807,0.00002309956,0.0005787719,0.0002798372,0.002361537,0.000001673588,0.00009345078,0.7229531,0.003159852,0.2688781,0.001198019,0.0002180722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008483324,0.002465531,0.9881256,0.0001937069,0.000131306,0.0001521653,0.000105306,0.0001982677,0.0001447907],"genre_scores_gemma":[0.9824386,0.00006112202,0.01680266,0.0002131876,0.0001172863,0.00001192287,0.0001783116,0.00002997826,0.0001469542],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9739553,"threshold_uncertainty_score":0.5907431,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02961198463878358,"score_gpt":0.2807382421831374,"score_spread":0.2511262575443538,"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."}}