MétaCan
Menu
Back to cohort
Record W2119544044 · doi:10.1109/lsp.2002.805312

A new NLMS algorithm for slow noise magnitude variation

2002· article· en· W2119544044 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

VenueIEEE Signal Processing Letters · 2002
Typearticle
Languageen
FieldEngineering
TopicControl Systems and Identification
Canadian institutionsQueen's University
Fundersnot available
KeywordsMagnitude (astronomy)AlgorithmNoise (video)Bounding overwatchA priori and a posterioriEllipsoidComputer scienceNoise measurementSet (abstract data type)Variation (astronomy)MathematicsArtificial intelligenceNoise reductionImage (mathematics)

Abstract

fetched live from OpenAlex

A set-membership (SM) normalized least-mean-square (NLMS) (SMNLMS) algorithm is developed using SM theory in the class of optimal bounding ellipsoid (OBE) algorithms. This signed version of NLMS algorithm requires a priori knowledge of a bound for the error magnitude, which is unknown in most applications. A very simple algorithm is proposed for the case in which the unknown magnitude of the measurement noise is slowly time-varying. The proposed algorithm is able to extract the noise magnitude information and exploit this magnitude to enhance or accelerate the learning process without risk of overbounding or performance loss due to underbounding. The performance of the proposed algorithm is compared with that of SMNLMS using some simulation examples.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.979
Threshold uncertainty score0.580

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.000
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.012
GPT teacher head0.197
Teacher spread0.185 · 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