{"id":"W2107230901","doi":"10.1109/ccece.2008.4564897","title":"A set-membership nlms algorithm with adaptive error bound","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Convergence (economics); Algorithm; Adaptive filter; Upper and lower bounds; Set (abstract data type); Adaptive algorithm; Computer science; Computational complexity theory; Least mean squares filter; Mathematics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"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.001545121,0.0005940163,0.001028537,0.0006052707,0.0005977468,0.001118786,0.001922891,0.00187343,0.002521357],"category_scores_gemma":[0.005934332,0.0003736216,0.0005332797,0.0009899244,0.0008281111,0.00175176,0.001275222,0.00181155,0.001288285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006411448,"about_ca_system_score_gemma":0.0009087489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002000513,"about_ca_topic_score_gemma":0.001733412,"domain_scores_codex":[0.9988601,0.0003050434,0.00006129326,0.000248323,0.0004644574,0.00006071186],"domain_scores_gemma":[0.998138,0.0008938588,0.0001397069,0.0002203979,0.0005486296,0.00005943329],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002912506,0.0001143621,0.000594745,0.0001851698,0.00008604702,0.00008659619,0.0003043294,0.2676439,0.01961781,0.04718838,0.003582295,0.6603051],"study_design_scores_gemma":[0.00001736574,0.00003452408,0.00006861823,0.000008706483,0.000006589037,0.00004836965,0.00001188551,0.9895229,0.002928454,0.005273525,0.002067415,0.00001157118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001472569,0.00005280681,0.997827,0.00005675575,0.00002636638,0.00001384959,0.000006112727,0.0001433748,0.000401136],"genre_scores_gemma":[0.1215636,0.0001176164,0.874543,0.0001465933,0.00009950571,0.000144642,0.00008466939,0.00006342799,0.003236976],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002521357,"threshold_uncertainty_score":0.008434832,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03047876134727521,"score_gpt":0.2036761486465791,"score_spread":0.1731973872993039,"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."}}