{"id":"W2525766229","doi":"10.1109/tnet.2015.2480418","title":"An Asynchronous Fixed-Point Algorithm for Resource Sharing With Coupled Objectives","year":2015,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Computer science; Subgradient method; Mathematical optimization; Distributed algorithm; Asynchronous communication; Convergence (economics); Gradient descent; Resource allocation; Distributed computing; Algorithm; Mathematics","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.001602636,0.000962977,0.0009505194,0.0004515346,0.0005590516,0.0008053696,0.001571651,0.001104523,0.002418192],"category_scores_gemma":[0.002792837,0.0004133061,0.000607631,0.0007210576,0.0007681919,0.00103264,0.001140968,0.001539346,0.0005629857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007320456,"about_ca_system_score_gemma":0.001502424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00209838,"about_ca_topic_score_gemma":0.002109478,"domain_scores_codex":[0.99935,0.0002469589,0.00002910294,0.0001411713,0.0001764155,0.00005633434],"domain_scores_gemma":[0.999236,0.0004049249,0.00007609618,0.00007470568,0.0001664619,0.00004185959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007928762,0.00004982181,0.0001790779,0.00005511174,0.0000321137,0.00005115138,0.0000792632,0.8947203,0.002035049,0.03874566,0.001537373,0.06243594],"study_design_scores_gemma":[0.00001799426,0.0000202937,0.00001353023,0.000002514233,0.00000276016,0.00001013581,0.000004132824,0.993116,0.0002762549,0.006048322,0.0004853747,0.000002710313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002313951,0.00003894148,0.9966701,0.00005103606,0.00002028497,0.0000207891,0.000006820355,0.00009246462,0.0007856405],"genre_scores_gemma":[0.3325584,0.000179053,0.6621141,0.0001365981,0.00007681666,0.0003733248,0.00008854699,0.0001026692,0.004370486],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002418192,"threshold_uncertainty_score":0.008475661,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03064657258951903,"score_gpt":0.2694943851431266,"score_spread":0.2388478125536075,"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."}}