{"id":"W2771039244","doi":"10.1016/j.automatica.2019.108691","title":"A Lie bracket approximation approach to distributed optimization over directed graphs","year":2019,"lang":"en","type":"preprint","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University; Kingston Health Sciences Centre","funders":"","keywords":"Computation; Saddle point; Mathematical optimization; Simple (philosophy); Computer science; Bracket; Lie group; Topological graph theory; Invariant (physics); Graph; Mathematics; Topology (electrical circuits); Theoretical computer science; Algorithm; Voltage graph; Pure mathematics; Combinatorics","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.001415573,0.0007849355,0.001547101,0.000963769,0.0006412131,0.001289536,0.001795484,0.001144128,0.003707689],"category_scores_gemma":[0.003471598,0.0005183867,0.0008012165,0.00142592,0.001265331,0.001946989,0.001850992,0.002056386,0.0006909517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001338369,"about_ca_system_score_gemma":0.001099628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006010309,"about_ca_topic_score_gemma":0.004730118,"domain_scores_codex":[0.9993074,0.0003300352,0.00002075867,0.00007462008,0.0002154247,0.00005186671],"domain_scores_gemma":[0.9990387,0.0005405971,0.00005834608,0.0001012731,0.0001756157,0.00008548498],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002977653,0.00005537205,0.0001421864,0.00004493057,0.00003839459,0.00004648214,0.00007135527,0.3668714,0.0006060024,0.6182746,0.001853062,0.01196637],"study_design_scores_gemma":[0.0000049802,0.000006848194,0.00001584574,0.000003110775,0.000003438136,0.000004221042,0.000007500676,0.8524876,0.00008095239,0.1467133,0.0006693139,0.000003014618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006883381,0.0002062095,0.9874331,0.0002777433,0.00008134588,0.0000196057,0.00003928014,0.00007170141,0.004987532],"genre_scores_gemma":[0.5521647,0.001237259,0.4163411,0.0004031423,0.0004183945,0.0003369226,0.0002996219,0.0003616018,0.02843734],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006010309,"threshold_uncertainty_score":0.01240343,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01629249398203245,"score_gpt":0.2423224211310963,"score_spread":0.2260299271490639,"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."}}