MétaCan
Menu
Back to cohort
Record W2008429680 · doi:10.1109/acc.2010.5531317

A convex method for selecting optimal Laguerre filter banks in system modelling and identification

2010· article· en· W2008429680 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
TopicControl Systems and Identification
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsLaguerre polynomialsConvergence (economics)Identification (biology)System identificationFunction (biology)Maxima and minimaPosition (finance)Mathematical optimizationLaguerre's methodMathematicsFilter (signal processing)Control theory (sociology)Applied mathematicsComputer scienceAlgorithmData modelingMathematical analysisOrthogonal polynomials

Abstract

fetched live from OpenAlex

When approximating dynamic systems with Laguerre Basis Functions it is important to tune the Laguerre pole such that the expansion is both parsimonious and accurate. The sum of squared error (SSE) objective function has many local minima and therefore cannot be optimized directly. Two alternative objective functions have been proposed in the literature: an asymptotically optimal objective function, and an enforced convergence criterion (ECC). Currently both objective functions can only be evaluated in a system modelling framework. Two questions that will be addressed in this paper are: (1) does minimizing the ECC lead to a good estimate of the optimal Laguerre pole position (in the SSE sense), and (2) is it possible to use the ECC in a system identification framework?

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: Empirical · Consensus signal: none
Teacher disagreement score0.761
Threshold uncertainty score0.352

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.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.011
GPT teacher head0.235
Teacher spread0.224 · 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

Citations4
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicControl Systems and IdentificationFrench-language works237,207