{"id":"W4313913688","doi":"10.13140/rg.2.2.28438.01604","title":"A LEVENBERG-MARQUARDT METHOD FOR NONSMOOTH REGULARIZED LEAST SQUARES","year":2022,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Office of Science; Advanced Scientific Computing Research; Sandia National Laboratories; U.S. Department of Energy","keywords":"Levenberg–Marquardt algorithm; Trust region; Mathematics; Jacobian matrix and determinant; Lipschitz continuity; Stationary point; Regularization (linguistics); Nonlinear system; Applied mathematics; Least-squares function approximation; Separable space; Lasso (programming language); Convergence (economics); Algorithm; Non-linear least squares; Mathematical optimization; Computer science; Estimation theory; Artificial neural network; Mathematical analysis; Artificial intelligence","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.001591246,0.001661721,0.00126081,0.0008086933,0.000575308,0.001010098,0.001923013,0.002062047,0.005116537],"category_scores_gemma":[0.003784209,0.0008056064,0.00143518,0.0009748297,0.001028698,0.0009254986,0.001604985,0.003618139,0.004079577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008183983,"about_ca_system_score_gemma":0.001906227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004427403,"about_ca_topic_score_gemma":0.005742224,"domain_scores_codex":[0.998655,0.000427905,0.00006633013,0.0002307395,0.0005525143,0.00006753899],"domain_scores_gemma":[0.9988365,0.0004844634,0.0001110076,0.0001437224,0.0003622931,0.00006202388],"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.00007320686,0.00009915841,0.0003966037,0.0003538191,0.0001525165,0.000158508,0.000138909,0.7120385,0.0120803,0.0540439,0.01168603,0.2087785],"study_design_scores_gemma":[0.000008879499,0.00002239408,0.00005142739,0.000009493543,0.00000599799,0.00002718041,0.000007127159,0.9848016,0.001499022,0.007292478,0.006259928,0.00001441942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000222485,0.00005645014,0.9990558,0.00004745452,0.00002109104,0.00001817102,0.00001758859,0.0002245929,0.0003363152],"genre_scores_gemma":[0.01504376,0.0001489176,0.9808729,0.00009168112,0.00005141363,0.0002060533,0.0001510621,0.0003741683,0.003060034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005116537,"threshold_uncertainty_score":0.01711649,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01773879989375323,"score_gpt":0.2613400141168413,"score_spread":0.2436012142230881,"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."}}