MétaCan
Menu
Back to cohort
Record W7111141754 · doi:10.1002/cpe.70477

QTTARNN: A Highly‐Efficient Attention Driven Quantized Tensor Train Recursive Neural Network for Cyber‐Physical‐Social Intelligence

2025· article· en· W7111141754 on OpenAlexaff

Bibliographic record

VenueConcurrency and Computation Practice and Experience · 2025
Typearticle
Languageen
FieldMathematics
TopicTensor decomposition and applications
Canadian institutionsDalhousie University
FundersNational Natural Science Foundation of China
KeywordsTensor (intrinsic definition)Artificial neural networkLossless compressionQuantization (signal processing)Action (physics)Feature (linguistics)Recurrent neural networkPattern recognition (psychology)

Abstract

fetched live from OpenAlex

ABSTRACT Cyber‐Physical‐Social System (CPSS) which refers to the complex interaction of cyber, physical and social systems, has the important purpose to provide personalized intelligent services. CPSS data, generated from every aspect of people living life, are mainly in the form of time series multimodal data with characteristic of high order and high dimension. How to efficiently process these CPSS data is one of the fundamental ways for the intelligent services. In this paper, a highly‐efficient attention driven Quantized Tensor Train Recursive Neural Network is proposed, in which the CPSS data is decomposed into the form of tensor train cores. In this way, the proposed method is composed of lightweight high‐order neural network units, which better preserves the multi‐attribute features of the original data and the correlation between different dimensions by using tensors with its calculations, and implicitly trims the dense vector‐matrix connections in the fully connected network by using the form of quantization tensor train decomposition, which greatly reduces the model parameters, shortens the training time and improves the efficiency. Also, an effective attentional feature enhancement module is constructed to assist the high‐order neural network, so that the overall model can achieve a balance between low parameter number and accuracy. The network structure proposed in this paper realizes an efficient and lossless high‐order tensor recurrent neural network model with a small number of parameters. Finally, experiments on the UCF50 action video dataset, CWRU bearing dataset, and image generation tasks are conducted. Comparative analyses with vanilla LSTM and other tensorized LSTMs in terms of training time, accuracy, error, and compression ratio validate the reliability of the proposed model.

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.

How this classification was reachedexpand

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.673
Threshold uncertainty score0.586

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.0010.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.052
GPT teacher head0.406
Teacher spread0.354 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueConcurrency and Computation Practice and ExperienceSame topicTensor decomposition and applicationsFrench-language works237,207