{"id":"W4401522519","doi":"10.1137/22m1538971","title":"A Levenberg–Marquardt Method for Nonsmooth Regularized Least Squares","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Office of Science","keywords":"Levenberg–Marquardt algorithm; Mathematics; Applied mathematics; Least-squares function approximation; Algorithm; Non-linear least squares; Iteratively reweighted least squares; Mathematical optimization; Artificial intelligence; Estimation theory; Statistics; Computer science; Artificial neural network; Estimator","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01346788,0.0003129676,0.000534126,0.0005730971,0.0009531,0.001767834,0.0006255808,0.0001228316,0.0002119092],"category_scores_gemma":[0.00334583,0.000250801,0.0005607876,0.001080077,0.0001795663,0.0002087073,0.0001832894,0.0008708892,0.0001066473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002401654,"about_ca_system_score_gemma":0.0002528499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002707235,"about_ca_topic_score_gemma":0.000001543985,"domain_scores_codex":[0.9959438,0.0006992142,0.000955787,0.0007559103,0.0009104653,0.000734762],"domain_scores_gemma":[0.9924927,0.006006597,0.0003650861,0.0005329199,0.0003243526,0.0002783824],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001260723,0.0002471184,0.00001328071,0.0007585597,0.0003280111,0.00009009772,0.002766497,0.001060672,0.02055823,0.2104247,0.07598116,0.6876456],"study_design_scores_gemma":[0.0004920631,0.0001725954,0.000006759937,0.00112145,0.00009705654,0.0003620308,0.0002947294,0.2957491,0.002702443,0.5497697,0.1488819,0.0003501778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004965214,0.0003351489,0.9807696,0.001358515,0.009272506,0.0004742141,0.00001626447,0.0002719035,0.002536629],"genre_scores_gemma":[0.01826418,0.000003036442,0.9762997,0.0001241758,0.0008837272,0.000008727976,0.000002452738,0.00008449866,0.004329477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6872954,"threshold_uncertainty_score":0.9999944,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1298732554335799,"score_gpt":0.4490738403391438,"score_spread":0.3192005849055639,"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."}}