{"id":"W2954099021","doi":"10.1016/j.neunet.2019.06.015","title":"Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm","year":2019,"lang":"en","type":"article","venue":"Neural Networks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Algorithm; Regularization (linguistics); Proximal Gradient Methods; Computer science; Operator (biology); Generalization; Norm (philosophy); Rate of convergence; Balanced flow; Convergence (economics); Mathematics; Mathematical optimization; Gradient descent; Key (lock); Artificial neural network; 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.00006466662,0.0002099583,0.0002280647,0.00006432732,0.00006885569,0.00004864881,0.0001680815,0.0001208884,0.00001468971],"category_scores_gemma":[0.000004595515,0.0001931034,0.000101951,0.0001366248,0.00001725238,0.00003998515,0.00004998702,0.0002661617,0.000004725191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005385845,"about_ca_system_score_gemma":0.000004379076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008558956,"about_ca_topic_score_gemma":0.000003977785,"domain_scores_codex":[0.998999,0.00001371116,0.0001820967,0.0002564706,0.0001280422,0.0004206585],"domain_scores_gemma":[0.9995025,0.00005062145,0.00004051613,0.0002877227,0.00004551032,0.00007315276],"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.0000199425,0.00001047592,0.0004463428,0.0000144977,0.00002271327,0.000004942495,0.00005234802,0.9841889,0.002060823,0.00005940981,0.001392784,0.01172681],"study_design_scores_gemma":[0.0002909756,0.00008771953,0.001690471,0.00003916534,0.00001594685,0.00001471825,0.000009514094,0.9899849,0.006792759,0.00004300986,0.0007997612,0.0002310926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9455215,0.0002304995,0.05069087,0.00002848548,0.001557997,0.0007139857,0.000005298692,0.0007770085,0.0004743215],"genre_scores_gemma":[0.9964112,0.000007331771,0.002958874,0.00008183105,0.0004228597,0.000018428,0.00001792146,0.00004804198,0.0000335288],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05088965,"threshold_uncertainty_score":0.7874529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01475702973620678,"score_gpt":0.2234007007286691,"score_spread":0.2086436709924623,"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."}}