{"id":"W4401477174","doi":"10.1016/j.jspi.2024.106221","title":"A graph decomposition-based approach for the graph-fused lasso","year":2024,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Lasso (programming language); Rate of convergence; Graph; Algorithm; Mathematical optimization; Convergence (economics); Penalty method; Applied mathematics; Computer science; Key (lock); Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001365849,0.0017544,0.001771603,0.001533401,0.0007313992,0.001282061,0.002342161,0.002013479,0.006724562],"category_scores_gemma":[0.005161834,0.0008265353,0.001598513,0.002092882,0.001194897,0.002055506,0.002721036,0.003719029,0.002688124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006520769,"about_ca_system_score_gemma":0.001711434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003832593,"about_ca_topic_score_gemma":0.006434635,"domain_scores_codex":[0.9987612,0.0004947581,0.0000513973,0.0002476951,0.0003470173,0.00009789193],"domain_scores_gemma":[0.9979575,0.0010868,0.0001524988,0.0003112031,0.0003701682,0.0001217573],"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.0001989933,0.0001794937,0.0004761723,0.0003062138,0.0002077189,0.0001956735,0.0001471068,0.6004568,0.01062761,0.1273533,0.01796836,0.2418824],"study_design_scores_gemma":[0.000007666593,0.00002197057,0.0000572963,0.00001143625,0.00001331383,0.00003309333,0.00001201101,0.9694797,0.0005652579,0.02794757,0.001839346,0.0000112977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005107861,0.00007906926,0.9984661,0.000105954,0.0000350296,0.00001674164,0.00006502615,0.0001607757,0.0005605898],"genre_scores_gemma":[0.06782657,0.0005257819,0.9243823,0.0004222571,0.000276498,0.0002656581,0.001028843,0.000519044,0.004752985],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006724562,"threshold_uncertainty_score":0.02249593,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02833459730021566,"score_gpt":0.310985428997932,"score_spread":0.2826508316977164,"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."}}