MétaCan
Menu
Back to cohort
Record W2902182735 · doi:10.1002/aic.16481

Semi‐supervised dynamic latent variable modeling: I/O probabilistic slow feature analysis approach

2018· article· en· W2902182735 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueAIChE Journal · 2018
Typearticle
Languageen
FieldEngineering
TopicFault Detection and Control Systems
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsLatent variableProbabilistic logicLatent variable modelCurse of dimensionalityFeature (linguistics)Computer scienceVariable (mathematics)Process (computing)Artificial intelligenceData miningMachine learningMathematics

Abstract

fetched live from OpenAlex

Modeling of high dimensional dynamic data is a challenging task. The high dimensionality problem in process data is usually accounted for using latent variable models. Probabilistic slow feature analysis (PSFA) is an example of such an approach that accounts for high dimensionality while simultaneously capturing the process dynamics. However, PSFA also suffers from a drawback that it cannot use output information when determining the latent slow features. To address this lacunae, extension of the PSFA by incorporating outputs, resulting in Input‐Output PSFA (IOPSFA) is proposed. IOPSFA can use both input and output information for extracting latent variables. Hence, inferential models based on IOPSFA are expected to have better predictive ability. The efficacy of the proposed approach with an industrial and a laboratory scale soft sensing case studies that have both complete and incomplete output measurements is evaluated, respectively. © 2018 American Institute of Chemical Engineers AIChE J , 65: 964–979, 2019

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.802
Threshold uncertainty score0.673

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
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.209
Teacher spread0.200 · 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