A hybrid approach to predict COVID-19 cases using neural networks and inverse problem
Bibliographic record
Abstract
Abstract We derive a novel hybrid approach, a combination of neural networks and inverse problem, in order to forecast COVID-19 cases, and more generally any infectious disease. For this purpose, we extract a second order nonlinear differential equation for the total confirmed cases from a SIR-like model. The latter is the cornerstone of the present study which allows to rigorously simplify the construction of the time-dependent epidemiological parameters without solving a system of differential equations. The neural network and inverse problems are used to compute the trial functions for total cases and the model parameters, respectively. The number of suspected and infected individuals can be found using the trial function of total confirmed cases. We divide the time domain into two parts, training interval (first 365/395 days) and test interval (first 366 to 395/ 396 to 450 days), and train the neural networks on the preassigned training zones. To examine the efficiency and effectiveness, we apply the proposed method to Canada, and use the Canadian publicly available database to estimate the parameters of the trial function involved with total cases. The trial functions of model parameters show that the basic reproduction number was closed to unity over a wide range, the first 100 to 365 days of the current pandemic in Canada. The proposed prediction models, based on the influence of previous COVID-19 cases and social economic policy, show excellent agreement with the data. The test results reveal that the single path prediction can forecast a period of 30 days, and the prediction using previous social and economical situation can forecast a range of 55 days.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".