{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008732439,0.0001564674,0.0001105713,0.0000595663,0.00004400059,0.00002892022,0.0001555218,0.0000358019,0.0003629418],"category_scores_gemma":[0.0000199641,0.0001122363,0.00004389331,0.0001147366,0.00002647247,0.0001146426,0.00002334148,0.0001784709,0.0003663529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000887897,"about_ca_system_score_gemma":0.000008375092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000704318,"about_ca_topic_score_gemma":0.000002528271,"domain_scores_codex":[0.9993115,0.0000275115,0.0001119883,0.0002049201,0.0001464189,0.0001976367],"domain_scores_gemma":[0.9994131,0.00008751156,0.00002042372,0.0004034978,0.00004335346,0.00003208353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001813977,0.0003216315,0.0008382372,0.0002149975,0.0001597489,0.00004148825,0.0006269385,0.4353835,0.1668738,0.02002743,0.03322069,0.3421102],"study_design_scores_gemma":[0.0003466731,0.0003843585,0.003118013,0.0002459846,0.00001199545,0.000008589674,0.00008622672,0.6600907,0.3002046,0.002158973,0.03276675,0.0005771584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06235065,0.00007817359,0.90727,0.001066861,0.0004762535,0.001315824,0.00003440447,0.001766332,0.02564158],"genre_scores_gemma":[0.8705289,0.000006714796,0.1286783,0.0001924243,0.0000890485,0.00007488275,0.00001750743,0.0000502576,0.0003620066],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8081782,"threshold_uncertainty_score":0.4708848,"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."}}