{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002647943,0.0002612958,0.0002496045,0.0002141953,0.0003445056,0.0003199905,0.0005324401,0.00008230124,0.0001285725],"category_scores_gemma":[0.00005195591,0.0002002869,0.00007577141,0.0009013821,0.00009938961,0.0004929939,0.0000773053,0.0004125935,0.00009199435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004901581,"about_ca_system_score_gemma":0.0001747229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001274272,"about_ca_topic_score_gemma":0.0000135155,"domain_scores_codex":[0.9981521,0.000107686,0.0002675858,0.000602909,0.0003685832,0.0005011574],"domain_scores_gemma":[0.9988247,0.0001074574,0.0001120559,0.0005927125,0.0001717818,0.0001912739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001039979,0.0003065427,0.00008350235,0.000005701094,0.00003737693,0.00006989203,0.000711828,0.001628554,0.0001950757,0.002893948,0.003751786,0.9903054],"study_design_scores_gemma":[0.001413362,0.00165509,0.001263956,0.00005064957,0.00002336504,0.0003353651,0.0005062131,0.9841338,0.0004504256,0.0003774456,0.00919426,0.0005960356],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001683348,0.00004668288,0.9740625,0.002816768,0.0001556856,0.0002914229,0.000005598838,0.001212025,0.01972595],"genre_scores_gemma":[0.1608377,0.000008938398,0.8298716,0.002356046,0.0002501695,0.00002898721,0.00004367917,0.00002592982,0.006576906],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9897094,"threshold_uncertainty_score":0.8167462,"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."}}