MétaCan
Menu
Back to cohort
Record W2138653217 · doi:10.1109/ccece.2007.228

Incorporating Term Selection Into Separable Nonlinear Least Squares Identification Methods

2007· article· en· W2138653217 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)Least-squares function approximationLaguerre polynomialsSeparable spaceTerm (time)MathematicsNonlinear systemMathematical optimizationNon-linear least squaresSelection (genetic algorithm)Operator (biology)Applied mathematicsIdentification (biology)Total least squaresAlgorithmComputer scienceRegressionEstimation theoryArtificial intelligenceStatisticsMathematical analysis

Abstract

fetched live from OpenAlex

In this paper, a method for the integration of the Least absolute shrinkage and selection operator (Lasso) into Separable Nonlinear Least Squares (SNLS) algorithms is presented. Lasso is reformulated as an equality constrained linear regression. The original SNLS problem is then solved subject to the resulting equality constraints. Simulations using the proposed algorithm to fit a Laguerre model to the output of a linear system are used to demonstrate its performance.

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

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.010
GPT teacher head0.300
Teacher spread0.290 · 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
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicControl Systems and IdentificationFrench-language works237,207