{"id":"W2939732444","doi":"10.1109/icassp.2019.8682498","title":"A Recursive Least-squares Algorithm Based on the Nearest Kronecker Product Decomposition","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Kronecker product; Algorithm; Finite impulse response; Recursive least squares filter; Adaptive filter; Computer science; Rate of convergence; Impulse response; Dimension (graph theory); System identification; Convergence (economics); Context (archaeology); Kronecker delta; Mathematics; Key (lock); 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001091242,0.0008663206,0.001036595,0.0005798595,0.0003562088,0.0007237852,0.0009437766,0.0009506702,0.001907872],"category_scores_gemma":[0.002342016,0.0004737644,0.000864647,0.0007616056,0.0007498847,0.0009431446,0.000785901,0.001541476,0.001592622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003939874,"about_ca_system_score_gemma":0.001303371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002606312,"about_ca_topic_score_gemma":0.002671615,"domain_scores_codex":[0.9991641,0.000255566,0.00004977346,0.0001802252,0.0003051415,0.00004519552],"domain_scores_gemma":[0.9993232,0.0002599106,0.00006464655,0.0001058638,0.0002207268,0.00002555415],"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.0001307806,0.0001177316,0.0006120589,0.0002198873,0.0001399747,0.000104446,0.0001701871,0.3906945,0.0405101,0.04970935,0.004274088,0.5133169],"study_design_scores_gemma":[0.00001300242,0.0000510238,0.0001550649,0.000008521746,0.00001145535,0.0000759777,0.000008356012,0.9870728,0.004644641,0.004728363,0.003209748,0.00002097058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009054703,0.00005349861,0.9985598,0.00003099246,0.00001927907,0.00001322539,0.000009127239,0.0001825987,0.0002259296],"genre_scores_gemma":[0.03838243,0.0001643525,0.9592361,0.00004750111,0.00003868297,0.00008562154,0.0001121993,0.00008940908,0.001843778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002606312,"threshold_uncertainty_score":0.006382525,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008602761274067764,"score_gpt":0.2300218503806072,"score_spread":0.2214190891065394,"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."}}