MétaCan
Menu
Back to cohort
Record W2100053613 · doi:10.1109/iembs.2005.1616332

Identification of Linear Time Varying Systems using Basis Pursuit

2005· article· en· W2100053613 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
KeywordsIdentification (biology)Basis (linear algebra)Computer scienceBasis pursuitLinear systemControl theory (sociology)Artificial intelligenceMathematicsMatching pursuit

Abstract

fetched live from OpenAlex

System identification involves creating mathematical models of systems using measurements of their inputs and outputs. Linear time-varying systems form an important sub-class of models that require the use of specialized system identification techniques. One such approach involves expanding the time-varying parameters onto a set of temporal basis functions and then estimating the resulting expansion coefficients. This, however, requires the estimation of a large number of parameters and often results in extreme noise sensitivity. In this paper a novel algorithm for identifying time-varying systems is presented. It combines a temporal expansion with a term selection step that uses the "Least Absolute Shrinkage and Selection Operator", or Lasso. The Lasso term selection technique constructs a model structure with a nearly minimal number of non-zero terms, and hence with relatively low estimation variances. The algorithm is demonstrated by using it to detect changes in the dynamic stiffness of the human elbow immediately following the onset of a broadband perturbation.

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

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.013
GPT teacher head0.219
Teacher spread0.207 · 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

Citations14
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicControl Systems and IdentificationFrench-language works237,207