{"id":"W4388184463","doi":"10.48550/arxiv.2310.20142","title":"Alternating Proximal Point Algorithm with Gradient Descent and Ascent Steps for Convex-Concave Saddle-Point Problems","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Saddle point; Mathematics; Convex function; Function (biology); Gradient descent; Minimax; Proximal Gradient Methods; Concave function; Regular polygon; Convergence (economics); Mathematical analysis; Sequence (biology); Saddle; Applied mathematics; Mathematical optimization; Combinatorics; Geometry; Computer science","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.0004294156,0.0003579171,0.0004186743,0.0003400334,0.0002553323,0.0002840683,0.0007621451,0.000145317,0.000009577581],"category_scores_gemma":[0.00003284883,0.0003450676,0.0001845088,0.0005219803,0.00008490242,0.0003466711,0.001129913,0.0003091989,0.00001398902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003102937,"about_ca_system_score_gemma":0.0002007969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000188356,"about_ca_topic_score_gemma":0.00007343124,"domain_scores_codex":[0.9976853,0.00009673707,0.0003254724,0.001298883,0.0001923318,0.0004013083],"domain_scores_gemma":[0.9981441,0.0001323581,0.000444385,0.0005877648,0.0004575909,0.0002337815],"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.00005115127,0.0002602011,0.003827462,0.0003062131,0.0006934204,0.0001299403,0.00106275,0.7518286,0.0000102733,0.2394666,0.0001379591,0.00222546],"study_design_scores_gemma":[0.001080391,0.0001548139,0.001076193,0.000175493,0.0001465696,0.00000743952,0.0001253782,0.9787871,0.00006252121,0.01784857,0.0000943034,0.0004411812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009829251,0.00002522371,0.9875469,0.0008275045,0.0002913931,0.001042006,0.00005069956,0.0002505008,0.0001365713],"genre_scores_gemma":[0.9016868,0.0001613763,0.09622995,0.0001971032,0.0001000732,0.00002297689,0.0001095609,0.0000426071,0.00144953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8918576,"threshold_uncertainty_score":0.9999002,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07343936484998281,"score_gpt":0.1911477443131127,"score_spread":0.1177083794631298,"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."}}