{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003943516,0.003197929,0.002780982,0.00183796,0.001075134,0.002838334,0.002848879,0.001943647,0.00899901],"category_scores_gemma":[0.02388284,0.001153925,0.001737487,0.004710587,0.002928774,0.006833754,0.004622126,0.005859402,0.005747497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001658917,"about_ca_system_score_gemma":0.002177482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003299219,"about_ca_topic_score_gemma":0.004269588,"domain_scores_codex":[0.9973598,0.0008057539,0.0001817111,0.0003927234,0.001042437,0.0002175807],"domain_scores_gemma":[0.9914578,0.006559794,0.000224032,0.0009747167,0.0006208991,0.0001627973],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008403661,0.0002371083,0.0006745901,0.0006853441,0.0002583746,0.0001854035,0.0004377921,0.2142708,0.006397935,0.1901989,0.0659665,0.519847],"study_design_scores_gemma":[0.0001217479,0.00009124682,0.0003896331,0.00008991754,0.00005008609,0.0001791609,0.00008847759,0.7347051,0.003512019,0.2442883,0.016438,0.00004632259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002632326,0.002360849,0.9896061,0.0004562416,0.0003315791,0.00005490648,0.0001677493,0.0009420377,0.003448308],"genre_scores_gemma":[0.04685449,0.003121677,0.9298657,0.0006493994,0.0006324701,0.000435428,0.001241546,0.0009978312,0.01620161],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00899901,"threshold_uncertainty_score":0.0301047,"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."}}