{"id":"W2051890519","doi":"10.1007/s10107-003-0502-7","title":"An optimal adaptive algorithm for the approximation of concave functions","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Concave function; Knot (papermaking); Bellman equation; Mathematical optimization; Oracle; Parametric statistics; Convex function; Regular polygon; Piecewise; Algorithm; Applied mathematics; Mathematical analysis; Computer science","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.0009208569,0.0001850564,0.0003068549,0.0000875451,0.0002709468,0.00006983965,0.0003029927,0.0001000416,0.0002112656],"category_scores_gemma":[0.0007783672,0.0001306886,0.0001381448,0.000292956,0.0002500622,0.0003308349,0.00005993736,0.0002020618,0.00002536164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008047918,"about_ca_system_score_gemma":0.0000479922,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.807777e-7,"about_ca_topic_score_gemma":0.000001562703,"domain_scores_codex":[0.9982332,0.00007402556,0.0005683564,0.0002667701,0.0004671417,0.0003904853],"domain_scores_gemma":[0.9968764,0.001907363,0.0002184928,0.0004516871,0.0004277891,0.0001182922],"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.00003448916,0.0006272133,7.892182e-7,0.00009480741,0.00008222922,4.506678e-7,0.001144115,0.004983225,0.00005026455,0.0749463,0.0001481792,0.9178879],"study_design_scores_gemma":[0.0005509365,0.0002507139,0.000001169566,0.00003327106,0.00007333779,0.000009850369,0.002328221,0.9618963,0.001234339,0.031636,0.001836191,0.0001496911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002572997,0.00005604362,0.9968262,0.0002689722,0.00003411239,0.001890796,0.00002243248,0.0001544667,0.0004896656],"genre_scores_gemma":[0.02029687,0.000003101726,0.9782328,0.00002030663,0.0001854361,0.0007083357,0.00001704341,0.00005189994,0.0004842274],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9569131,"threshold_uncertainty_score":0.5329325,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07302452284193485,"score_gpt":0.3786374860033176,"score_spread":0.3056129631613828,"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."}}