QSegRNN: quantum segment recurrent neural network for time series forecasting
Bibliographic record
Abstract
Recently many data centers have been constructed for artificial intelligence (AI) research. The important condition of the data center is to supply sufficient electricity, resulting in many electricity transformers being installed. Especially, these electricity transformers have led to significant heat generation in many data centers. Therefore, managing the temperature of electricity transformers has emerged as an important task. Notably, numerous studies are being conducted to manage and forecast the temperature of electricity transformers using artificial intelligence models. However, as the size of predictive models increases and computational demands grow, substantial computing resources are required. Consequently, there are instances where the lack of computing resources makes these models difficult to operate. To address these challenges, we propose a quantum segment recurrent neural network (QSegRNN), a time series forecasting model utilizing quantum computing. QSegRNN leverages quantum computing to achieve comparable performance with fewer parameters than classical counterpart models under similar conditions. QSegRNN inspired by a classical SegRNN uses the quantum cell instead of the classical cell in the model. The advantage of this structure is that it can be designed with fewer parameters under similar architecture. To construct the quantum cell, we benchmark the quantum convolutional circuit with amplitude embedding as the variational quantum circuit, minimizing information loss while considering the limit of noisy intermediate-scale quantum (NISQ) devices. The experiment result illustrates that the forecasting performance of QSegRNN achieves better performance than SegRNN and other forecasting models even though QSegRNN has only 85 percent of the parameters.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 source (direct Gemma or distilled Codex), 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".