{"id":"W2127125401","doi":"10.1109/tsp.2008.2010643","title":"A Fast Robust Recursive Least-Squares Algorithm","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Recursive least squares filter; Adaptive filter; Computer science; System identification; Norm (philosophy); Filtering theory; Least-squares function approximation; Constraint (computer-aided design); Mathematical optimization; Mathematics; Data modeling","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00004950171,0.0002692656,0.0002144439,0.0002065931,0.0003508499,0.00003371741,0.0001655202,0.0001073253,0.00007957399],"category_scores_gemma":[0.000001383318,0.000288917,0.0000898592,0.0003315629,0.0001188442,0.0004723008,0.000001054118,0.0004531219,0.00004209586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001519443,"about_ca_system_score_gemma":0.0000374563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004996614,"about_ca_topic_score_gemma":0.000003019099,"domain_scores_codex":[0.9988812,0.00001962866,0.0002386525,0.0002796392,0.000239625,0.0003413082],"domain_scores_gemma":[0.9995649,0.00003928707,0.00004084885,0.0001584903,0.00009489285,0.0001015522],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002015748,0.0000598055,0.000001487704,0.00005595075,0.00002569492,0.00004440532,0.0005087883,0.5291421,0.008856058,0.000004414577,0.0001023831,0.4611788],"study_design_scores_gemma":[0.0005754764,0.0003022697,0.00005562801,0.0005714316,0.00004583066,0.0003511743,0.000312637,0.4848758,0.509715,0.0006285448,0.001598847,0.0009673785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002883211,0.0001954541,0.9940357,0.00001998603,0.0001436122,0.0001665033,0.00003302754,0.001627354,0.000895215],"genre_scores_gemma":[0.8590524,0.00006706126,0.1403565,0.00003444987,0.00008595936,0.00007428632,0.000002295331,0.00008186974,0.0002451758],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8561692,"threshold_uncertainty_score":0.9999563,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02841504991357172,"score_gpt":0.2353016650292129,"score_spread":0.2068866151156412,"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."}}