{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001196899,0.001137361,0.001371839,0.001000382,0.0004293368,0.0003875646,0.001567464,0.001068946,0.0001495991],"category_scores_gemma":[0.0002193844,0.00131855,0.0009614248,0.0004935609,0.00009389078,0.0001769599,0.001411392,0.00214213,0.000007213142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001226881,"about_ca_system_score_gemma":0.0004288354,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00533367,"about_ca_topic_score_gemma":0.0008661264,"domain_scores_codex":[0.9955153,0.0003554881,0.001025594,0.001162192,0.0006318743,0.001309573],"domain_scores_gemma":[0.9960909,0.00040732,0.000392377,0.00252636,0.000220532,0.0003624536],"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.0007092321,0.0005651897,0.0008525503,0.001231089,0.001631455,0.0002220664,0.001009935,0.5737568,0.05760799,0.02515797,0.1891739,0.1480818],"study_design_scores_gemma":[0.0006355254,0.0001950119,0.0007794027,0.0003508744,0.0002883522,0.0001070274,0.0001187299,0.8313279,0.03688359,0.03177017,0.09580012,0.0017433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005488033,0.004194788,0.9744072,0.001243461,0.0009188938,0.003210068,0.000728093,0.007885158,0.001924301],"genre_scores_gemma":[0.1155858,0.0007743168,0.8709883,0.001047129,0.000581225,0.008159553,0.0005950645,0.0006637239,0.001604888],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2575711,"threshold_uncertainty_score":0.9989264,"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."}}