Multi-Tree Compact Hierarchical Tensor Recurrent Neural Networks for Intelligent Transportation System Edge Devices
Bibliographic record
Abstract
Recurrent neural networks (RNNs) and their variants can efficiently capture the features of time-series characteristic data and are widely used for intelligent transportation tasks. Internet of Vehicles (IoV) edge devices deploying RNN models are an important impetus for the development of intelligent transportation system (ITS) and provide convenient services for users and managers. However, the input data of some transportation tasks have high dimensional characteristics, resulting in the number of training parameters and computational complexity of RNN models being too large, making it difficult to deploy high-performance RNN models on resource-constrained IoV edge devices. To overcome this problem, we compress the training parameters of the RNN model using the proposed multi-tree compact hierarchical tensor representation-Dtensor Block Decomposition (DBD), which reduces the computational complexity of the model and speeds up the training process of the model, thus making the network model lightweight. We evaluate the performance of Dtensor Block-Long Short-Term Memory (DB-LSTM) and Improved Dtensor Block-LSTM (IDB-LSTM) models on multiple real datasets and compare them with the current state-of-the-art LSTM compression models. Experimental results demonstrate that our proposed method can massively compress the number of training parameters of the models on different datasets and shorten the training time of the models without degrading the testing accuracy of the models. In addition, our proposed DB-LSTM and IDB-LSTM models have better comprehensive performance compared with other models and are more suitable for deployment on resource-constrained IoV edge devices.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".