{"id":"W2950148570","doi":"10.48550/arxiv.1611.00724","title":"Computing proximal points of convex functions with inexact subgradients","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subgradient method; Mathematics; Mathematical optimization; Bounded function; Function (biology); Subderivative; Regular polygon; Saddle point; Oracle; Point (geometry); Convex function; Minification; Applied mathematics; Lipschitz continuity; Convex optimization; Computer science; Mathematical analysis; Geometry","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.003263107,0.001922367,0.002243509,0.001641019,0.0007071482,0.002063162,0.001781354,0.002044808,0.002939652],"category_scores_gemma":[0.01869855,0.001348454,0.001252477,0.001165325,0.002475819,0.003150657,0.004332236,0.004067143,0.001550062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00120566,"about_ca_system_score_gemma":0.00205234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002358322,"about_ca_topic_score_gemma":0.002328911,"domain_scores_codex":[0.9984628,0.0005770172,0.00008390484,0.0002458621,0.0005081446,0.0001223366],"domain_scores_gemma":[0.9956977,0.002553556,0.0004048613,0.0005379367,0.0005904533,0.0002154893],"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.0002331663,0.00009257333,0.001207822,0.0002776543,0.0000886377,0.0002232431,0.0002997843,0.8155417,0.004007384,0.09783023,0.002482112,0.07771567],"study_design_scores_gemma":[0.00001504194,0.00005398066,0.0001090754,0.00002437835,0.000007805257,0.00004068267,0.00002904276,0.950682,0.002072274,0.04603512,0.0009194307,0.00001122772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005745473,0.00009498139,0.9933729,0.00007666254,0.00001825113,0.00002778228,0.00001949562,0.0001520516,0.0004923396],"genre_scores_gemma":[0.2262764,0.0004244524,0.7686644,0.0001021367,0.00008246186,0.0002220219,0.0002251862,0.0003593414,0.003643524],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003263107,"threshold_uncertainty_score":0.01725715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1115400300633398,"score_gpt":0.2485491165591777,"score_spread":0.1370090864958379,"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."}}