MétaCan
Menu
Back to cohort
Record W2139810527 · doi:10.1109/ccece.2009.5090257

A set-membership affine projection algorithm with adaptive error bound

2009· article· en· W2139810527 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsConvergence (economics)AlgorithmAdaptive filterSet (abstract data type)Computer scienceProjection (relational algebra)Upper and lower boundsTracking errorAffine transformationTracking (education)MathematicsMathematical optimizationArtificial intelligence

Abstract

fetched live from OpenAlex

A new set-membership affine projection (SM-AP) algorithm for adaptive filtering applications is proposed. The new SMAP algorithm eliminates the error-bound estimation problem of the conventional SM-AP algorithm. The poor tracking performance in nonstationary environments of the conventional SM-AP algorithm is also considered. A solution to this problem is proposed by incorporating a switching mechanism in the proposed SM-AP algorithm. The new SM-AP algorithm has better convergence efficiency and yields lower misadjustment than the conventional AP algorithm. On the other hand, with the switching mechanism it has better convergence efficiency and yields lower misadjustment than the conventional SM-AP algorithm in nonstationary environments.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.873
Threshold uncertainty score0.692

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.026
GPT teacher head0.254
Teacher spread0.228 · 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

Citations5
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207