MétaCan
Menu
Back to cohort

Robust Recursive Least-Squares Algorithm with the Conjugate Gradient and the Data Reuse Approach

2025· article· W7116894886 on OpenAlex
Radu-Andrei Otopeleanu, Cristian-Lucian Stanciu, Constantin Paleologu, Jacob Benesty, Laura-Maria Dogariu, Cristian Anghel

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Language
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsConjugate gradient methodRobustness (evolution)Adaptive filterGradient methodRecursive filterRegularization (linguistics)Adaptive algorithmFilter (signal processing)

Abstract

fetched live from OpenAlex

This paper presents a recursive least-squares (RLS) adaptive algorithm for acoustic echo cancellation (AEC) based on the conjugate gradient (CG) line search method. The RLSCG method is developed with two main important features. First, it has increased tracking capabilities due to a data-reuse approach, which exploits the same input information multiple times for the same adaptive filter iteration. Second, a variable regularization technique is employed to improve the robustness of the RLS-CG in scenarios with double-talk conditions. The proposed algorithm is validated based on simulations performed in an AEC framework.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.799
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0030.004
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.033
GPT teacher head0.239
Teacher spread0.207 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207