MétaCan
Menu
Back to cohort
Record W1485477320

Adaptive regularization in frequency-domain NLMS filters

2012· article· en· W1485477320 on OpenAlex

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

VenueEuropean Signal Processing Conference · 2012
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsRegularization (linguistics)Regularization perspectives on support vector machinesAdaptive filterFrequency domainBinAlgorithmKernel adaptive filterMathematicsComputer scienceMathematical optimizationDigital filterFilter (signal processing)Inverse problemArtificial intelligenceMathematical analysisTikhonov regularization
DOInot available

Abstract

fetched live from OpenAlex

Regularization is an important part of adaptive filter design. Traditionally, the regularization parameter has been empirically selected, as there has not been a lot of work in the literature for determining an optimal method for finding its best value. In this work, we propose an adaptive method for finding the regularization parameter in the normalized least-mean-square (NLMS) algorithm. Furthermore, we apply this regularization approach in a frequency-domain version of the NLMS algorithm, in which a separate regularization parameter is computed for each frequency bin. Simulation results show that computing the regularization parameter for each frequency bin separately provided better performance for the filter, for the common case of colored noise excitation.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.867
Threshold uncertainty score0.993

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
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.029
GPT teacher head0.234
Teacher spread0.205 · 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