{"id":"W2983399346","doi":"10.48550/arxiv.1911.05979","title":"Towards an $O(\\frac{1}{t})$ convergence rate for distributed dual averaging","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Smoothness; Convergence (economics); Rate of convergence; Bounded function; Dual (grammatical number); Mathematics; Computer science; Lasso (programming language); Mathematical optimization; Order (exchange); Applied mathematics; Algorithm; Key (lock); Mathematical analysis","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.006861211,0.001365791,0.001338867,0.0008152708,0.0007476826,0.001489371,0.00176486,0.001546765,0.002652194],"category_scores_gemma":[0.01802104,0.0005125427,0.0008431937,0.0006423591,0.001654237,0.002420017,0.003403221,0.004168856,0.0007657062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001001891,"about_ca_system_score_gemma":0.001226054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00171016,"about_ca_topic_score_gemma":0.001635621,"domain_scores_codex":[0.9974732,0.001005826,0.0001110361,0.0004064979,0.000833375,0.0001700209],"domain_scores_gemma":[0.9909099,0.0058446,0.0006198515,0.001083471,0.001283719,0.0002585321],"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.0003998157,0.0001526657,0.001146965,0.0003351792,0.0001073127,0.0001757152,0.0003005509,0.713475,0.01686182,0.136916,0.004376561,0.1257524],"study_design_scores_gemma":[0.000007460207,0.00002351694,0.00004935683,0.000008109184,0.000003707772,0.00001898252,0.000009494367,0.988804,0.001359262,0.009102072,0.0006085082,0.000005408629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003484046,0.0001799141,0.9945956,0.0002318687,0.00003885079,0.00002550316,0.00001114556,0.0001641865,0.001268872],"genre_scores_gemma":[0.3500215,0.0006268573,0.6435975,0.0003399967,0.0002351675,0.00030803,0.0001312,0.0003834205,0.004356343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006861211,"threshold_uncertainty_score":0.036286,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07221875020827936,"score_gpt":0.208589234506438,"score_spread":0.1363704842981587,"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."}}