{"id":"W2118163005","doi":"","title":"Optimizing Costly Functions with Simple Constraints: A Limited-Memory Projected Quasi-Newton Algorithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":222,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematical optimization; Algorithm; Orthant; Descent direction; Mathematics; Convex function; Stochastic gradient descent; Broyden–Fletcher–Goldfarb–Shanno algorithm; Quadratic equation; Computer science; Gradient descent; Regular polygon; Applied mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148747,0.001217369,0.001659649,0.000647564,0.0004833816,0.0008849313,0.00209899,0.002098422,0.004079922],"category_scores_gemma":[0.004097518,0.00128833,0.0006674204,0.0007733511,0.001018715,0.001112573,0.001307845,0.001630231,0.001541158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007994476,"about_ca_system_score_gemma":0.002242841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006509001,"about_ca_topic_score_gemma":0.00825369,"domain_scores_codex":[0.9994414,0.0002494626,0.0000180937,0.00006202098,0.0001865965,0.00004242273],"domain_scores_gemma":[0.9986279,0.0008845103,0.00008721124,0.0001160868,0.0002186381,0.00006561651],"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.00008150313,0.00005919732,0.0002219384,0.0001373755,0.00005208346,0.00009342437,0.00005686103,0.9187517,0.00126098,0.02415222,0.004537421,0.05059533],"study_design_scores_gemma":[0.00001515903,0.000008355771,0.00001883185,0.000004945939,0.000001905339,0.000006533884,0.000002147817,0.9960445,0.00009364764,0.003365003,0.0004355045,0.000003509401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002701067,0.0001365605,0.9951425,0.0001552897,0.00003327944,0.00005319018,0.00004114313,0.0003254747,0.001411542],"genre_scores_gemma":[0.07125906,0.0001605916,0.9237871,0.0001775191,0.000052476,0.0003767744,0.0001608597,0.0002873853,0.00373835],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006509001,"threshold_uncertainty_score":0.01364863,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01017784147900268,"score_gpt":0.2421697917682596,"score_spread":0.2319919502892569,"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."}}