{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001530551,0.00008334209,0.0001297056,0.00009136573,0.00006532,0.0001253475,0.00007654323,0.00003715356,0.000004156676],"category_scores_gemma":[0.00006809779,0.00005347012,0.00004247625,0.00008156285,0.00005757636,0.00006150044,0.000006032913,0.0002149466,3.177886e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009101529,"about_ca_system_score_gemma":0.00002132262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002659164,"about_ca_topic_score_gemma":1.697422e-7,"domain_scores_codex":[0.99952,0.00001409244,0.0001869126,0.00006546682,0.0001028075,0.0001106976],"domain_scores_gemma":[0.9985846,0.001224468,0.00002794407,0.00005401311,0.00005837564,0.00005054371],"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.000469957,0.0002051399,0.003362796,0.001185327,0.001186887,0.0004542279,0.001690139,0.5654952,0.01748058,0.1375782,0.1542126,0.116679],"study_design_scores_gemma":[0.0001880293,0.000180281,0.001624535,0.0003671407,0.00008373413,0.00005165561,0.00004831716,0.9774581,0.00101889,0.01749749,0.001364333,0.0001175265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004902343,0.001779077,0.9926582,0.0000633038,0.000138153,0.00005630065,0.00002860014,0.00008391831,0.0002900776],"genre_scores_gemma":[0.934203,0.00005428637,0.06560361,0.00005045606,0.00006724713,0.000004163007,0.000005274182,0.000009713846,0.000002250482],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9293007,"threshold_uncertainty_score":0.2180448,"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."}}