{"id":"W4224005576","doi":"10.1007/s40305-022-00398-5","title":"Cubic Regularization Methods with Second-Order Complexity Guarantee Based on a New Subproblem Reformulation","year":2022,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"National Natural Science Foundation of China","keywords":"Hessian matrix; Regularization (linguistics); Mathematics; Lipschitz continuity; Minification; Trust region; Eigenvalues and eigenvectors; Applied mathematics; Regular polygon; Computational complexity theory; Mathematical optimization; Algorithm; Computer science; Mathematical analysis; 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":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006019854,0.0001459147,0.0003204162,0.0002540047,0.001413252,0.00009075679,0.0007275079,0.00006341438,0.0009672505],"category_scores_gemma":[0.001190184,0.00009534792,0.0002224051,0.002203677,0.0002795683,0.000383967,0.0002337422,0.001399398,9.882953e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005837352,"about_ca_system_score_gemma":0.001534157,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003601705,"about_ca_topic_score_gemma":0.00003428189,"domain_scores_codex":[0.9947155,0.00181937,0.0006730043,0.0001945221,0.002290983,0.0003065936],"domain_scores_gemma":[0.9965013,0.0005759475,0.0003230087,0.0005814978,0.001922214,0.0000960861],"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.0002387887,0.0003992041,0.00003755455,0.00007506357,0.0001008898,0.000001004886,0.002429881,0.9714343,0.003481627,0.01309971,0.00717271,0.001529269],"study_design_scores_gemma":[0.001846789,0.0007709494,0.000458657,0.00009185237,0.00002269813,0.00003468066,0.0008693464,0.9380937,0.005018074,0.05097611,0.001689519,0.0001276134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01977671,0.0000579049,0.9642692,0.01403664,0.00009040504,0.0009999595,0.00002951501,0.00001754128,0.0007220815],"genre_scores_gemma":[0.06104677,0.00002852429,0.9322354,0.0001343768,0.00009534402,0.00002805024,0.00001668458,0.00004467991,0.006370124],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04127006,"threshold_uncertainty_score":0.999946,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.136753856636964,"score_gpt":0.4532613657135169,"score_spread":0.3165075090765529,"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."}}