{"id":"W4405633788","doi":"10.1109/isetc63109.2024.10797358","title":"A Data-Reuse Regularized Recursive Least-Squares Adaptive Filtering Algorithm","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Algorithms and Applications","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Recursive least squares filter; Algorithm; Reuse; Adaptive filter; Engineering","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.00006311193,0.00016297,0.0001415523,0.00007127038,0.00006091078,0.0000841303,0.0005015173,0.00005366781,0.0001780455],"category_scores_gemma":[0.00002438743,0.0001479834,0.00004139559,0.0002577996,0.00003220907,0.0004006285,0.0003049684,0.000183745,0.0002124007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004912529,"about_ca_system_score_gemma":0.00001695945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000180651,"about_ca_topic_score_gemma":0.00001150375,"domain_scores_codex":[0.9991441,0.00000724874,0.0001704997,0.0003295271,0.0001158781,0.0002327616],"domain_scores_gemma":[0.9986525,0.00006808894,0.000009855539,0.001164366,0.0000267072,0.00007848183],"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.000008240379,0.0000442998,6.778985e-7,0.0001237589,0.0003426121,0.0001342685,0.000682917,0.01792634,0.009981892,0.02897563,0.07637987,0.8653995],"study_design_scores_gemma":[0.000110654,0.00001674046,0.00001038152,0.00006334448,0.0000225605,0.0000222177,0.0002016557,0.8258095,0.002026136,0.008898817,0.1625951,0.0002228951],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003132075,0.001161343,0.9920352,0.0003161668,0.0003218755,0.0002057134,0.0005951333,0.001294467,0.003756861],"genre_scores_gemma":[0.01642363,0.0002949293,0.9798008,0.00004478529,0.0004881268,0.0001345593,0.0003270743,0.00009799811,0.002388075],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8651766,"threshold_uncertainty_score":0.6034588,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03274939772932585,"score_gpt":0.2726163546897438,"score_spread":0.239866956960418,"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."}}