MétaCan
Menu
Back to cohort
Record W2548760702

An efficient iterative method for basis pursuit adaptive filters for sparse systems

2012· article· en· W2548760702 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

VenueAsia-Pacific Signal and Information Processing Association Annual Summit and Conference · 2012
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsBasis pursuitConvergence (economics)Adaptive filterAlgorithmComputer scienceIterative methodBasis (linear algebra)Impulse responseFinite impulse responseMatching pursuitMathematical optimizationMathematicsCompressed sensing
DOInot available

Abstract

fetched live from OpenAlex

The “proportionate” family of adaptive filters has been in use over the past decade. Their fast convergence for sparse systems makes them particularly useful in the network echo canceller application. Recently, an iterative form of the proportionate affine projection algorithm (PAPA), derived from the basic principles of basis pursuit, has been shown to have remarkably fast convergence for such sparse systems. The number of samples for convergence is proportional to the sparseness of the system which means that often full convergence occurs in fewer samples than the length of the system's impulse response. Here, we introduce a lower complexity implementation with the same performance that is an iterative version of proportionate normalized least mean squares (PNLMS).

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 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.959
Threshold uncertainty score0.778

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.003
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.017
GPT teacher head0.258
Teacher spread0.241 · 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