MétaCan
Menu
Back to cohort
Record W2897473460 · doi:10.1016/j.ifacol.2018.09.133

Using Decoupling Methods to Reduce Polynomial NARX Models

2018· article· en· W2897473460 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

VenueIFAC-PapersOnLine · 2018
Typearticle
Languageen
FieldPhysics and Astronomy
TopicModel Reduction and Neural Networks
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsNonlinear autoregressive exogenous modelPolynomialDecoupling (probability)Polynomial matrixNonlinear systemControl theory (sociology)Applied mathematicsMatrix polynomialMathematicsComputer scienceBenchmark (surveying)Autoregressive modelAlgorithmMathematical optimizationControl engineeringControl (management)Artificial intelligenceEngineeringStatistics

Abstract

fetched live from OpenAlex

The polynomial NARX model, where the output is a polynomial function of past inputs and outputs, is a commonly used equation error model for nonlinear systems. While it is linear in the variables, which simplifies its identification, it suffers from two major drawbacks: the number of parameters grows combinatorially with the degree of the nonlinearity, and it is a black box model, which makes it difficult to draw any insights from the identified model. Polynomial decoupling techniques are used to replace the multiple-input single-output polynomial with a decoupled polynomial structure comprising a transformation matrix followed by bank of SISO polynomials, whose outputs are then summed. This approach is demonstrated on two benchmark systems: The Bouc-Wen friction model and the data from the Silverbox model. In both cases, the decoupling results in a substantial reduction in the number of parameters, and allows some insight into the nature of the nonlinearities in the system.

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: Methods · Consensus signal: none
Teacher disagreement score0.834
Threshold uncertainty score0.900

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.0010.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.103
GPT teacher head0.412
Teacher spread0.309 · 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