Cargando…

Using Bandit Algorithms to Maximize SARS-CoV-2 Case-Finding: Evaluation and Feasibility Study

BACKGROUND: The Flexible Adaptive Algorithmic Surveillance Testing (FAAST) program represents an innovative approach for improving the detection of new cases of infectious disease; it is deployed here to screen and diagnose SARS-CoV-2. With the advent of treatment for COVID-19, finding individuals i...

Descripción completa

Detalles Bibliográficos
Autores principales: Rayo, Michael F, Faulkner, Daria, Kline, David, Thornhill IV, Thomas, Malloy, Samuel, Della Vella, Dante, Morey, Dane A, Zhang, Net, Gonsalves, Gregg
Formato: Online Artículo Texto
Lenguaje:English
Publicado: JMIR Publications 2023
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10430782/
https://www.ncbi.nlm.nih.gov/pubmed/37581924
http://dx.doi.org/10.2196/39754
_version_ 1785091045605769216
author Rayo, Michael F
Faulkner, Daria
Kline, David
Thornhill IV, Thomas
Malloy, Samuel
Della Vella, Dante
Morey, Dane A
Zhang, Net
Gonsalves, Gregg
author_facet Rayo, Michael F
Faulkner, Daria
Kline, David
Thornhill IV, Thomas
Malloy, Samuel
Della Vella, Dante
Morey, Dane A
Zhang, Net
Gonsalves, Gregg
author_sort Rayo, Michael F
collection PubMed
description BACKGROUND: The Flexible Adaptive Algorithmic Surveillance Testing (FAAST) program represents an innovative approach for improving the detection of new cases of infectious disease; it is deployed here to screen and diagnose SARS-CoV-2. With the advent of treatment for COVID-19, finding individuals infected with SARS-CoV-2 is an urgent clinical and public health priority. While these kinds of Bayesian search algorithms are used widely in other settings (eg, to find downed aircraft, in submarine recovery, and to aid in oil exploration), this is the first time that Bayesian adaptive approaches have been used for active disease surveillance in the field. OBJECTIVE: This study’s objective was to evaluate a Bayesian search algorithm to target hotspots of SARS-CoV-2 transmission in the community with the goal of detecting the most cases over time across multiple locations in Columbus, Ohio, from August to October 2021. METHODS: The algorithm used to direct pop-up SARS-CoV-2 testing for this project is based on Thompson sampling, in which the aim is to maximize the average number of new cases of SARS-CoV-2 diagnosed among a set of testing locations based on sampling from prior probability distributions for each testing site. An academic-governmental partnership between Yale University, The Ohio State University, Wake Forest University, the Ohio Department of Health, the Ohio National Guard, and the Columbus Metropolitan Libraries conducted a study of bandit algorithms to maximize the detection of new cases of SARS-CoV-2 in this Ohio city in 2021. The initiative established pop-up COVID-19 testing sites at 13 Columbus locations, including library branches, recreational and community centers, movie theaters, homeless shelters, family services centers, and community event sites. Our team conducted between 0 and 56 tests at the 16 testing events, with an overall average of 25.3 tests conducted per event and a moving average that increased over time. Small incentives—including gift cards and take-home rapid antigen tests—were offered to those who approached the pop-up sites to encourage their participation. RESULTS: Over time, as expected, the Bayesian search algorithm directed testing efforts to locations with higher yields of new diagnoses. Surprisingly, the use of the algorithm also maximized the identification of cases among minority residents of underserved communities, particularly African Americans, with the pool of participants overrepresenting these people relative to the demographic profile of the local zip code in which testing sites were located. CONCLUSIONS: This study demonstrated that a pop-up testing strategy using a bandit algorithm can be feasibly deployed in an urban setting during a pandemic. It is the first real-world use of these kinds of algorithms for disease surveillance and represents a key step in evaluating the effectiveness of their use in maximizing the detection of undiagnosed cases of SARS-CoV-2 and other infections, such as HIV.
format Online
Article
Text
id pubmed-10430782
institution National Center for Biotechnology Information
language English
publishDate 2023
publisher JMIR Publications
record_format MEDLINE/PubMed
spelling pubmed-104307822023-08-17 Using Bandit Algorithms to Maximize SARS-CoV-2 Case-Finding: Evaluation and Feasibility Study Rayo, Michael F Faulkner, Daria Kline, David Thornhill IV, Thomas Malloy, Samuel Della Vella, Dante Morey, Dane A Zhang, Net Gonsalves, Gregg JMIR Public Health Surveill Original Paper BACKGROUND: The Flexible Adaptive Algorithmic Surveillance Testing (FAAST) program represents an innovative approach for improving the detection of new cases of infectious disease; it is deployed here to screen and diagnose SARS-CoV-2. With the advent of treatment for COVID-19, finding individuals infected with SARS-CoV-2 is an urgent clinical and public health priority. While these kinds of Bayesian search algorithms are used widely in other settings (eg, to find downed aircraft, in submarine recovery, and to aid in oil exploration), this is the first time that Bayesian adaptive approaches have been used for active disease surveillance in the field. OBJECTIVE: This study’s objective was to evaluate a Bayesian search algorithm to target hotspots of SARS-CoV-2 transmission in the community with the goal of detecting the most cases over time across multiple locations in Columbus, Ohio, from August to October 2021. METHODS: The algorithm used to direct pop-up SARS-CoV-2 testing for this project is based on Thompson sampling, in which the aim is to maximize the average number of new cases of SARS-CoV-2 diagnosed among a set of testing locations based on sampling from prior probability distributions for each testing site. An academic-governmental partnership between Yale University, The Ohio State University, Wake Forest University, the Ohio Department of Health, the Ohio National Guard, and the Columbus Metropolitan Libraries conducted a study of bandit algorithms to maximize the detection of new cases of SARS-CoV-2 in this Ohio city in 2021. The initiative established pop-up COVID-19 testing sites at 13 Columbus locations, including library branches, recreational and community centers, movie theaters, homeless shelters, family services centers, and community event sites. Our team conducted between 0 and 56 tests at the 16 testing events, with an overall average of 25.3 tests conducted per event and a moving average that increased over time. Small incentives—including gift cards and take-home rapid antigen tests—were offered to those who approached the pop-up sites to encourage their participation. RESULTS: Over time, as expected, the Bayesian search algorithm directed testing efforts to locations with higher yields of new diagnoses. Surprisingly, the use of the algorithm also maximized the identification of cases among minority residents of underserved communities, particularly African Americans, with the pool of participants overrepresenting these people relative to the demographic profile of the local zip code in which testing sites were located. CONCLUSIONS: This study demonstrated that a pop-up testing strategy using a bandit algorithm can be feasibly deployed in an urban setting during a pandemic. It is the first real-world use of these kinds of algorithms for disease surveillance and represents a key step in evaluating the effectiveness of their use in maximizing the detection of undiagnosed cases of SARS-CoV-2 and other infections, such as HIV. JMIR Publications 2023-08-15 /pmc/articles/PMC10430782/ /pubmed/37581924 http://dx.doi.org/10.2196/39754 Text en ©Michael F Rayo, Daria Faulkner, David Kline, Thomas Thornhill IV, Samuel Malloy, Dante Della Vella, Dane A Morey, Net Zhang, Gregg Gonsalves. Originally published in JMIR Public Health and Surveillance (https://publichealth.jmir.org), 15.08.2023. https://creativecommons.org/licenses/by/4.0/This is an open-access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work, first published in JMIR Public Health and Surveillance, is properly cited. The complete bibliographic information, a link to the original publication on https://publichealth.jmir.org, as well as this copyright and license information must be included.
spellingShingle Original Paper
Rayo, Michael F
Faulkner, Daria
Kline, David
Thornhill IV, Thomas
Malloy, Samuel
Della Vella, Dante
Morey, Dane A
Zhang, Net
Gonsalves, Gregg
Using Bandit Algorithms to Maximize SARS-CoV-2 Case-Finding: Evaluation and Feasibility Study
title Using Bandit Algorithms to Maximize SARS-CoV-2 Case-Finding: Evaluation and Feasibility Study
title_full Using Bandit Algorithms to Maximize SARS-CoV-2 Case-Finding: Evaluation and Feasibility Study
title_fullStr Using Bandit Algorithms to Maximize SARS-CoV-2 Case-Finding: Evaluation and Feasibility Study
title_full_unstemmed Using Bandit Algorithms to Maximize SARS-CoV-2 Case-Finding: Evaluation and Feasibility Study
title_short Using Bandit Algorithms to Maximize SARS-CoV-2 Case-Finding: Evaluation and Feasibility Study
title_sort using bandit algorithms to maximize sars-cov-2 case-finding: evaluation and feasibility study
topic Original Paper
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10430782/
https://www.ncbi.nlm.nih.gov/pubmed/37581924
http://dx.doi.org/10.2196/39754
work_keys_str_mv AT rayomichaelf usingbanditalgorithmstomaximizesarscov2casefindingevaluationandfeasibilitystudy
AT faulknerdaria usingbanditalgorithmstomaximizesarscov2casefindingevaluationandfeasibilitystudy
AT klinedavid usingbanditalgorithmstomaximizesarscov2casefindingevaluationandfeasibilitystudy
AT thornhillivthomas usingbanditalgorithmstomaximizesarscov2casefindingevaluationandfeasibilitystudy
AT malloysamuel usingbanditalgorithmstomaximizesarscov2casefindingevaluationandfeasibilitystudy
AT dellavelladante usingbanditalgorithmstomaximizesarscov2casefindingevaluationandfeasibilitystudy
AT moreydanea usingbanditalgorithmstomaximizesarscov2casefindingevaluationandfeasibilitystudy
AT zhangnet usingbanditalgorithmstomaximizesarscov2casefindingevaluationandfeasibilitystudy
AT gonsalvesgregg usingbanditalgorithmstomaximizesarscov2casefindingevaluationandfeasibilitystudy