{"id":"W4414845944","doi":"10.1080/10556788.2025.2545846","title":"Near-optimal algorithm with complexity separation for strongly convex-strongly concave composite saddle point problems","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Optech (Canada)","funders":"Ministry of Science and Higher Education of the Russian Federation","keywords":"Saddle point; Separation (statistics); Point (geometry); Composite number; Computational complexity theory; Separation method","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007802424,0.0003418242,0.0004958263,0.0002719198,0.0006037888,0.0005975144,0.000561661,0.000151042,0.000128707],"category_scores_gemma":[0.0001554069,0.0003192572,0.0001549743,0.001312807,0.0001654747,0.0007993724,0.0001630377,0.0001595081,0.000006102866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001345199,"about_ca_system_score_gemma":0.0003201025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005807124,"about_ca_topic_score_gemma":0.00001399436,"domain_scores_codex":[0.99748,0.0004371112,0.000576328,0.0007615262,0.0003574652,0.0003875629],"domain_scores_gemma":[0.9975109,0.000441494,0.0004031511,0.0005696308,0.0009257347,0.0001491114],"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.00003248642,0.0001095373,0.0004918662,0.0000407203,0.000168045,6.501029e-7,0.0002400101,0.9707047,0.00001668295,0.01878915,0.0009871909,0.008418981],"study_design_scores_gemma":[0.001532635,0.0001513911,0.0002737537,0.00004920115,0.0001146881,0.000004642807,0.00004946433,0.9936942,0.0002418113,0.0008624662,0.002677372,0.0003483341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000177696,0.00008888775,0.9961523,0.001091772,0.0001975489,0.0009683821,0.00008484699,0.0006740179,0.0007245002],"genre_scores_gemma":[0.0004287802,0.00001211975,0.9959012,0.0004584301,0.00004326015,0.0002000717,0.000632296,0.00004312029,0.002280667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02298956,"threshold_uncertainty_score":0.999926,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02667676483093195,"score_gpt":0.3373874385405367,"score_spread":0.3107106737096047,"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."}}