{"id":"W2963596156","doi":"10.1109/cdc.2017.8264076","title":"Superlinearly convergent asynchronous distributed network newton method","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"Science North","funders":"","keywords":"Asynchronous communication; Sublinear function; Rate of convergence; Computer science; Mathematical optimization; Bounded function; Convergence (economics); Distributed algorithm; Algorithm; Distributed computing; Mathematics; Discrete mathematics; Key (lock)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001812443,0.000972871,0.001464095,0.0001323517,0.0005471361,0.002539116,0.007624754,0.00076056,0.0001399189],"category_scores_gemma":[0.0002842934,0.0009078673,0.0006927331,0.0002328524,0.00009991288,0.0005499233,0.005539861,0.001208746,0.0006200277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005213714,"about_ca_system_score_gemma":0.0008522864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001916758,"about_ca_topic_score_gemma":0.0001444966,"domain_scores_codex":[0.993611,0.0006543913,0.001209932,0.002129083,0.001003614,0.001392021],"domain_scores_gemma":[0.9916216,0.0003128353,0.0009777959,0.005940743,0.0005386796,0.0006083302],"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.0001148149,0.0008628168,0.006503547,0.0008223571,0.003222168,0.000947871,0.000728098,0.1686963,0.0003827246,0.3215353,0.3885417,0.1076423],"study_design_scores_gemma":[0.001483334,0.0001037083,0.005043048,0.0002951977,0.0001406742,0.00004881663,0.00001243351,0.8757104,0.0003031696,0.008808592,0.1064992,0.00155146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003209245,0.0007988338,0.9773104,0.003384752,0.01141714,0.001471947,0.0004336286,0.001188825,0.003673562],"genre_scores_gemma":[0.495047,0.0002143846,0.4859934,0.0009598344,0.005339765,0.0009457764,0.00352537,0.0002192048,0.007755312],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7070141,"threshold_uncertainty_score":0.9993372,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02900716135223206,"score_gpt":0.2968020209197903,"score_spread":0.2677948595675582,"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."}}