{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006905539,0.0005423057,0.0004438995,0.0004478174,0.0001876503,0.0001710476,0.0003531764,0.0001882396,0.00003919573],"category_scores_gemma":[0.00001404814,0.0005274525,0.00004700805,0.0004965598,0.0001283412,0.0003709793,0.00004332502,0.0007137316,0.00001470263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003166955,"about_ca_system_score_gemma":0.0002350187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006948485,"about_ca_topic_score_gemma":0.0004198332,"domain_scores_codex":[0.9979776,0.000006046973,0.0002608029,0.0005714294,0.0002325289,0.0009516397],"domain_scores_gemma":[0.9987531,0.00004235785,0.0000446446,0.0001553259,0.0002528985,0.0007516255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003264124,0.0001920166,0.00380307,0.0007766287,0.001108813,0.002270446,0.01154356,0.01994767,0.008200184,0.5274196,0.007136119,0.4172755],"study_design_scores_gemma":[0.0003242789,0.000639443,0.001675451,0.0002265207,0.00001517572,0.0003153322,0.00005267615,0.9924747,0.001270728,0.0008603508,0.001313435,0.0008318555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1932739,0.0002111877,0.7972062,0.0002326932,0.000226072,0.0007638087,0.00004632274,0.002191969,0.005847873],"genre_scores_gemma":[0.9673437,0.00009809425,0.03202948,0.0001100795,0.00015551,0.00009849319,0.000007639193,0.00007801086,0.00007900509],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9725271,"threshold_uncertainty_score":0.9997177,"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."}}