{"id":"W4389923777","doi":"10.1109/tit.2023.3344141","title":"Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Regular polygon; Computer science; Order (exchange); Convex function; Convex optimization; Mathematical optimization; Mathematics; Economics","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.01417746,0.006261138,0.007460869,0.002618856,0.001716197,0.006082758,0.007836765,0.00660298,0.01336577],"category_scores_gemma":[0.05551649,0.002132025,0.002491168,0.003427797,0.003668603,0.01217124,0.0074394,0.009769408,0.004069444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006582715,"about_ca_system_score_gemma":0.006869127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006455374,"about_ca_topic_score_gemma":0.006869033,"domain_scores_codex":[0.9926147,0.002395772,0.0004336079,0.001726518,0.001488166,0.001341188],"domain_scores_gemma":[0.9523594,0.03746975,0.001596492,0.003990506,0.002748369,0.001835553],"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.001701374,0.000609568,0.001715012,0.001118263,0.0003280783,0.0002313646,0.0002529112,0.808013,0.001216758,0.06752307,0.01668587,0.1006047],"study_design_scores_gemma":[0.00005495841,0.0001169559,0.0001863915,0.00006481491,0.0000368067,0.0000438814,0.0000313388,0.9354183,0.0005422297,0.06280068,0.0006807236,0.00002282013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03054974,0.003889034,0.9489247,0.00295847,0.0003283791,0.0002642907,0.001241141,0.002483992,0.009360222],"genre_scores_gemma":[0.6225826,0.003503314,0.3347022,0.002566135,0.001187622,0.001355744,0.005886774,0.001881083,0.02633454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01417746,"threshold_uncertainty_score":0.07497847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03241622595127306,"score_gpt":0.2781650566507077,"score_spread":0.2457488306994346,"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."}}