Optimisation of Non-Pharmaceutical Measures in COVID-19 Growth via Neural Networks
Bibliographic record
Abstract
On 19th March, the World Health Organisation declared a pandemic. Through this global spread, many nations have witnessed exponential growth of confirmed cases brought under control by severe mass quarantine or lockdown measures. However, some have, through a different timeline of actions, prevented this exponential growth. Currently as some continue to tackle growth, others attempt to safely lift restrictions whilst avoiding a resurgence. This study seeks to quantify the impact of government actions in mitigating viral transmission of SARS-CoV-2 by a novel soft computing approach that makes concurrent use of a neural network model, to predict the daily slope increase of cumulative infected, and an optimiser, with a parametrisation of the government restriction time series, to understand the best set of mitigating actions. Data for two territories, Italy and Taiwan, have been gathered to model government restrictions in travelling, testing and enforcement of social distance measures as well as people connectivity and adherence to government actions. It is found that a larger and earlier testing campaign with tighter entry restrictions benefit both regions, resulting in significantly less confirmed cases. Interestingly, this scenario couples with an earlier but milder implementation of nationwide restrictions for Italy, thus supporting Taiwan's lack of nationwide lockdown, i.e. earlier government actions could have contained the growth to a degree that a widespread lockdown would have been avoided, or at least delayed. The results, found with a purely data-driven approach, are in line with the main findings of mathematical epidemiological models, proving that the proposed approach has value and that the data alone contains valuable knowledge to inform decision makers.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| 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".