MétaCan
Menu
Back to cohort

A Third-Order Tensor Decomposition Based Linear-In-The-Parameters Nonlinear Adaptive Filter

2024· article· en· W4403126750 on OpenAlex
Vinal Patel, Sankha Subhra Bhattacharjee, Constantin Paleologu, Mads Græsbøll Christensen, Jacob Benesty, Jesper Rindom Jensen

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 ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsNonlinear systemTensor (intrinsic definition)Tensor decompositionFilter (signal processing)Adaptive filterOrder (exchange)Computer scienceMathematicsAlgorithmPhysicsComputer visionGeometry

Abstract

fetched live from OpenAlex

Linear-in-the-parameters (LIP) nonlinear adaptive filters are widely used for modelling nonlinear systems. However, one major draw-back of LIP nonlinear filters is the need to use high expansion orders to achieve accurate modelling, leading to a large number of inactive coefficients, hence overfitting issues and slow convergence. To overcome these issues, in this paper, we propose a third-order tensor (TOT) decomposition based functional link network (FLN) and propose the TOT-decomposition based FLN recursive least-squares algorithm (FLN-RLS-TOT). The decomposition technique significantly reduces the number of adaptive estimation parameters, thus allowing the use of a high expansion order to achieve accurate modelling while avoiding overfitting and convergence issues. Simulation results for nonlinear system identification show improved tracking, with similar or better modelling accuracy compared to existing algorithms.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.330
Threshold uncertainty score0.663

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.022
GPT teacher head0.278
Teacher spread0.256 · 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

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207