MétaCan
Menu
Back to cohort
Record W2110158354 · doi:10.1109/icassp.1997.604719

Accurate subspace tracking algorithms based on cross-space properties

2002· article· en· W2110158354 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 institutionsInstitut National de la Recherche Scientifique
Fundersnot available
KeywordsSubspace topologyLinear subspaceSignal subspaceAlgorithmDimension (graph theory)Computer scienceTracking (education)Singular value decompositionNoise (video)SIGNAL (programming language)Computational complexity theoryMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, we analyse the issue of efficiently using Givens rotations to perform a more accurate SVD-based subspace tracking. We propose an alternative type of decomposition which allows a more versatile use of Givens rotations. We also show the direct effect of the latter on the tracking error, and develop a cross-terms cancellation concept which leads to a class of high performance algorithms with very low complexity: O(N/sup 2/) if signal and noise subspaces are tracked, O(Nr) if only the signal subspace is tracked, where N is the data vector dimension, and r the number of sources. Comparative simulation experiments support the theoretical work.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.912
Threshold uncertainty score0.792

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.061
GPT teacher head0.264
Teacher spread0.203 · 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
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207