{"id":"W1964212566","doi":"10.1109/spawc.2012.6292898","title":"A sufficient convergence condition for the quantized iterative water-filling algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Quantization (signal processing); Convergence (economics); Algorithm; Iterative method; Noise (video); Interference (communication); Computer science; Mathematical optimization; Mathematics; Nash equilibrium; Applied mathematics; Artificial intelligence; Telecommunications","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":[],"consensus_categories":[],"category_scores_codex":[0.0002113305,0.0000694076,0.0000655531,0.00002387435,0.0001307474,0.00002239056,0.0001230794,0.00002268585,0.0001889234],"category_scores_gemma":[0.000009439776,0.0000391361,0.00004085477,0.00004947931,0.00002087788,0.0001234288,0.00002325591,0.00005668374,0.00006128229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001776495,"about_ca_system_score_gemma":0.000002803554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007456105,"about_ca_topic_score_gemma":0.000002278775,"domain_scores_codex":[0.9995769,0.00001373067,0.0001220089,0.00004727226,0.00004797157,0.0001921761],"domain_scores_gemma":[0.9995499,0.0001452782,0.000009633713,0.0002176047,0.00004212946,0.00003541568],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001446668,0.001757442,0.002367336,0.0004466244,0.001609184,0.000002590786,0.08559901,0.1287637,0.3445065,0.2424293,0.07784528,0.1145283],"study_design_scores_gemma":[0.0002481135,0.00001482796,0.0002396588,0.000007530416,0.00001789396,0.000001954497,0.0003884865,0.8649505,0.06066217,0.00005632803,0.0732967,0.000115781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07143808,0.001024222,0.9252292,0.0001795196,0.000614606,0.0002936099,0.00002586691,0.0001568292,0.001038101],"genre_scores_gemma":[0.9895595,0.0001184223,0.009818937,0.00004298197,0.00007077417,0.0001077596,0.0000450732,0.00001107229,0.0002255253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9181214,"threshold_uncertainty_score":0.2068579,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02394721783106597,"score_gpt":0.2709322145259421,"score_spread":0.2469849966948762,"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."}}