MétaCan
Menu
Back to cohort
Record W2009999628 · doi:10.1109/acc.2010.5530656

Incorporating term selection into nonlinear block structured system identification

2010· article· en· W2009999628 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
KeywordsLasso (programming language)Nonlinear systemBlock (permutation group theory)Term (time)Selection (genetic algorithm)AlgorithmLaguerre polynomialsSystem identificationPolynomialComputer scienceNonlinear system identificationMathematical optimizationLinear modelMathematicsApplied mathematicsData modelingArtificial intelligenceMachine learning

Abstract

fetched live from OpenAlex

Subset selection and shrinkage methods locate and remove insignificant terms from identified models. The least absolute shrinkage and selection operator (Lasso) is a term selection method that shrinks some coefficients and sets others to zero. In this paper, the incorporation of constraints (such as Lasso) into the linear and/or nonlinear parts of a Separable Nonlinear Least Squares algorithm is addressed and its application to the identification of block-structured models is considered. As an example, this method is applied to a Hammerstein model consisting of a nonlinear static block, represented by a Tchebyshev polynomial, in series with a linear dynamic system, modeled by a bank of Laguerre filters. Simulations showed that the Lasso based method was able to identify the model structure correctly, or with mild over-modeling, even in the presence of significant output noise.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.856
Threshold uncertainty score0.454

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.003
GPT teacher head0.193
Teacher spread0.190 · 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

Citations1
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicControl Systems and IdentificationFrench-language works237,207