{"id":"W4396700653","doi":"10.4171/mems/13","title":"On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples","year":2024,"lang":"en","type":"book","venue":"Memoirs of the European Mathematical Society","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Algorithm; Polynomial; Mathematics; Approximations of π; Computer science; Discrete mathematics; Applied mathematics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.001390274,0.0005426469,0.0008122077,0.00006218768,0.0006255418,0.0003441803,0.001763239,0.0001746048,0.00003859884],"category_scores_gemma":[0.0006184024,0.00036645,0.001172373,0.0004427515,0.0002847158,0.00004906499,0.001611423,0.0006721616,0.0005169198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002364702,"about_ca_system_score_gemma":0.0001953538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001593439,"about_ca_topic_score_gemma":3.116621e-7,"domain_scores_codex":[0.9963422,0.0003879788,0.0009242713,0.0009882174,0.0008608942,0.0004964094],"domain_scores_gemma":[0.9950485,0.002774948,0.0003872328,0.001330176,0.0001999755,0.0002591853],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004070779,0.001742121,3.226628e-7,0.001006133,0.001337278,0.00001038069,0.005602792,0.02534041,0.0006198672,0.1745098,0.6855687,0.1042215],"study_design_scores_gemma":[0.0006149972,0.0003001736,0.00002063017,0.001696681,0.0003630598,0.000006865438,0.00006512122,0.8704303,0.0001777728,0.1013556,0.02420976,0.000759033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004025346,0.00009652105,0.9796495,0.002704183,0.001788986,0.001216712,0.0005075734,0.0002460303,0.01338797],"genre_scores_gemma":[0.0002527179,0.00000155614,0.9510857,0.000942867,0.0008257426,0.0000265141,0.00006470198,0.0001363663,0.04666385],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8450899,"threshold_uncertainty_score":0.9998788,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03900926662789469,"score_gpt":0.2779253581838381,"score_spread":0.2389160915559434,"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."}}