key: cord-163946-a4vtc7rp
authors: Awasthi, Raghav; Guliani, Keerat Kaur; Bhatt, Arshita; Gill, Mehrab Singh; Nagori, Aditya; Kumaraguru, Ponnurangam; Sethi, Tavpritesh
title: VacSIM: Learning Effective Strategies for COVID-19 Vaccine Distribution using Reinforcement Learning
date: 2020-09-14
journal: nan
DOI: nan
sha: 
doc_id: 163946
cord_uid: a4vtc7rp

A COVID-19 vaccine is our best bet for mitigating the ongoing onslaught of the pandemic. However, vaccine is also expected to be a limited resource. An optimal allocation strategy, especially in countries with access inequities and a temporal separation of hot-spots might be an effective way of halting the disease spread. We approach this problem by proposing a novel pipeline VacSIM that dovetails Actor-Critic using Kronecker-Factored Trust Region (ACKTR) model into a Contextual Bandits approach for optimizing the distribution of COVID-19 vaccine. Whereas the ACKTR model suggests better actions and rewards, Contextual Bandits allow online modifications that may need to be implemented on a day-to-day basis in the real world scenario. We evaluate this framework against a naive allocation approach of distributing vaccine proportional to the incidence of COVID-19 cases in five different States across India and demonstrate up to 100,000 additional lives potentially saved and a five-fold increase in the efficacy of limiting the spread over a period of 30 days through the VacSIM approach. We also propose novel evaluation strategies including a standard compartmental model based projections and a causality preserving evaluation of our model. Finally, we contribute a new Open-AI environment meant for the vaccine distribution scenario, and open-source VacSIM for wide testing and applications across the globe.

All countries across the globe are eagerly waiting for the launch of an effective vaccine against SARS-CoV-2. The Operation Warp Speed [1] aims to deliver 300 million doses of a safe, effective vaccine for COVID-19 by January 2021, however, the pace of development continues to be punctuated by the safety concerns [2] . As potential candidates start getting ready to enter the market, there will be an urgent need for optimal distribution strategies that would mitigate the pandemic at the fastest rate possible [3] [4] . Center for American Progress estimated that 462 million doses of COVID-19 vaccine along with accompanying syringes will be needed for the US alone to reach herd immunity [5] .

Here we summarize the key factors that will need to be considered for effective mitigation:

• Scarcity of supply: Despite large scale production efforts, it is expected that the vaccine will still be a scarce resource as compared to the number of people who would need it. In addition to the vaccine itself, there may also be scarcity in the components leading to its delivery, e.g syringes. The White House director of trade and manufacturing policy stated earlier this year that the US would need 850 million syringes to deliver the vaccine en-masse. This highlights the next challenge of the optimal distribution of scarce resources related to the vaccine. arXiv:2009.06602v1 [cs.AI] 14 Sep 2020

• Equitable distribution: A truly equitable distribution will not just be defined by the population or incidence of new cases alone, although these will be strong factors. Other factors ensuring equity of distribution include quantum of exposure e.g. to the healthcare workforce that needs to be protected. In this paper, we assume that the exposure is proportional to the number of cases itself, although the proposed methodology allows more nuanced models to be constructed. There may also be unseen factors such as vaccine hoarding and political influence, which are not accounted for in this work.

• Transparent, measurable and effective policy: The design of policy would need to be guided by data, before, during and after the vaccine administration to a section of the population. Since the viral dynamics are rapidly evolving, the policy should allow changes to be transparent and effects to be measurable in order to ensure maximum efficacy of the scarce vaccine resource. On the larger scale of states and nations, this would imply continuous monitoring of incidence rates vis-a-vis a policy action undertaken.

Although the aforementioned factors seem straightforward, the resulting dynamics that may emerge during the actual roll-out of the vaccine may be far too complex for human decision making. The daunting nature of such decisionmaking can be easily imagined for large and diverse countries such as India and the United States, especially where Health is a State subject. Artificial intelligence for learning data-driven policies is expected to aid such decision making as there would be limited means to identify optimal actions in real-world. A "near real-time" evaluation as per the demographic layout of states and consequent initiation of a rapid response to contain the spread of COVID-19 [6] will be required. Furthermore, these policies will need to be contextualized to the many variables governing demand or 'need' for the vaccine distribution to be fair and equitable [7] . Therefore, ground testing of these scenarios is not an option, and countries will have to face this challenge. In this paper, we introduce VacSIM, a novel feed-forward reinforcement learning approach for learning effective policy combined with near real-time optimization of vaccine distribution and demonstrate its potential benefit if applied to five States across India. Since real-world experimentation was out of question, the change in projected cases obtained via a standard epidemiological model was used to compare the VacSIM policy with a naive approach of incidence-based allocation. Finally, our novel model is open-sourced and can be easily deployed by policymakers and researchers, thus can be used in any part of the world, by anyone, to make the process of distribution more transparent.

Actor-Critic Methods are temporal difference (TD) learning-based methods that have a policy structure(Actor) which select actions, and an estimated value function(Critic) that critiques the actions made by the actor. A Markov decision process is represented as a function of (X, A, γ, P, r), at a given time t. An agent performs an action ∈ A following a certain policy π θ (a|X) to receive a reward r(X, A) and a transition to the consequent state X with a probability P (X |X, A). The objective of this task is to maximize the expected γ-discounted cumulative return

(given the policy parameters θ). Policy Gradient methods optimises a policy π θ (a|X) with respect to its parameters and update θ, to maximise J(θ) [8] , [9] . As defined in [10] , policy gradient is expressed as follows:

where ψ t is representative of the advantage function A p i(X, A). An advantage function provides a relativistic idea of how useful a certain action is, given a certain state. A good advantage function provides low variance and low bias gradient estimates. In our work, we refer to [11] , which uses the A3C (asynchronous advantage critic) method proposed by [12] and suggests the following advantage function:

where V π φ (X t ) represents the value network, whose parameters are further trained by performing temporal difference updates. The variable k corresponds to the k-step return from the advantage function.

TRPO [13] is an on-policy algorithm that is well suited for environments with both discrete and continuous action spaces. Considering we make use of the latter, this optimization scheme can be employed in our model. Updating policy using TRPO involves taking the largest possible step to improve model performance, whilst also satisfying a constraint setting the proximity between the old and the new policies. The constraint is expressed as KL-Divergence. If π θ is a policy (θ being the parameters), then the TRPO update is performed as follows:

where L(θ k , θ) is a surrogate advantage function comparing how the current policy performs with respect to the old policy, and D KL (θ||θ k ) is the average KL-Divergence metric.

Natural Gradient Descent (NGD) [14] is an efficient realization of second-order optimization and is based on Information Geometry. In contrast to first-order methods such as Stochastic Gradient Descent, NGD converges faster by approximating the loss landscape using the Fisher Information Matrix (FIM) [15] as the curvature matrix corresponding to the loss function. Kronecker-factored Approximate Curvature [16] provides an efficient way to approximate the inverse of FIM, which is otherwise a computational challenge associated with this approach.

ACKTR is a scalable and sample efficient algorithm to apply the natural gradient method to policy gradient for actorcritic methods. Proposed in [11] , it is used to calculate and apply the natural gradient update to both actor and critic. It uses a critic to estimate the advantage function. Training the model amounts to solving the least-squares problem of minimizing the mean squared error (MSE) between the model predictions and the target values, i.e., (r(x) = estimated(x) − target(x)).

The Contextual Bandits algorithm is an extension of the multi-armed bandits approach [17] which contextualizes the choice of the bandit to its current environment. This serves to circumvent the problem where a multi-armed bandit may simply end up playing the same action multiple times even though the environment (context) may have changed, thus getting stuck at a sub-optimal condition. Contextual Bandits play an action based on its current context, given a corresponding reward, hence are more relevant to real-world environments such as the vaccine distribution problem attacked in this work. Given, for time t = 1...n, a set of contexts C and a set of possible actions X and reward/payoffs P are defined. At a particular instant, based on a context c t ∈ C, an action x t ∈ X is chosen and a reward or a payoff p t = f (c t , x t ) is obtained. Regret [18] is a conceptual function to understand and optimize the performance of the Bandits problem. Since we don't know if an action played was the most "reward-fetching", rewards against all actions that can be played are sampled, and the difference between the action chosen and the action against the maximum reward is defined as 'regret'. Therefore, minimizing regret achieves the goal of maximizing reward. For an optimal action x * ∈ X such that the expectation of reward against this action is maximum, p * = max xt∈X (E(p | x t )), the regret and cumulative regret can be expressed as Z = [p * − E(p | x t )] and Z * = n t=1 Z respectively.

In order to derive the exact posterior inference in linear models, a Bayesian linear regression [19] may be performed, and several computationally-efficient versions are available [20] . Linear posteriors assume that the data were generated as per P = C T β + (5) where ∼ N (0, σ 2 ), P represents the reward or payoff and C is the context. The joint distribution of β and σ 2 for each action is modeled. Sequentially estimating the noise level σ 2 for each action allows the algorithm to adaptively improve its understanding of the volume of the hyper-ellipsoid of plausible β's which generally leads to a more aggressive initial exploration phase (for both β and σ 2 ). The posterior at time t for action x t after observing C and P, is

where we assume σ 2 ∼ IG(a t , b t ), and β | σ 2 ∼ N (µ t , σ 2 Σ t ), an Inverse Gamma and Gaussian distribution, respectively. Their parameters are given by

We set the prior hyperparameters to µ 0 = 0, and Λ 0 = λ Id, while a 0 = b 0 = η > 1. It follows that initially, for

. Note that we independently model and regress each action's parameters, β i , σ 2 i for i = 1, . . . , k [18] . For practical purposes, a 0 and b 0 are initialized as integer values.

In this paper, we concatenate the ACKTR sub-model and Contextual Bandits sub-model in a feedforward manner. This was done to select the optimal policy through the supervised Contextual Bandits approach from the ones generated by the reinforcement learning-based ACKTR model as shown in Figure 1 . This was done to address the following challenges that need to be tackled in real-world problems such as optimal vaccine distribution:

• Solving in real-time: A vaccine distribution problem is expected to be fast-paced. Thus an overwhelming amount of brainstorming with constrained resources and time would be required to develop effective policy for a near future. This calls for the development of a prompt and an easily reproducible setup.

• Lack of ground truth: This is one of the key challenges addressed in this paper. Since roll out of the vaccine will not give us the liberty of testing various hypotheses, a lack of ground truth data is generally expected. This is analogous to zero-shot learning problems thus precluding a simple supervised learning based approach.

• Absence of evaluation with certainty: Lack of ground testing naturally implies nil on-ground evaluation.

In that case, it often becomes challenging to employ evaluation metrics that offer a significant amount of confidence in results. In order to solve this problem, we rely upon the simulated decrease in number of susceptible people as vaccine is administered.

• Model scaling: We ensured that the learning process of the models simulates the relationship between different objects in the real world environment accurately, and at the same time can be scaled down in response to computational efficiency and resource utilization challenges. This is done by choosing the right set of assumptions that reflect the real world. While reinforcement learning approaches replicate human decision-making processes, the absence of evaluation makes them less trustworthy, especially when real lives may be at stake. Therefore, we pipelined the ACKTR model with a supervised learning based Contextual Bandits approach where recommendations for vaccine distribution policy were used as training data for the latter.

We extracted the State-wise time series data of COVID-19 characteristics from the website https://mohfw.gov.in/ and use them in the experiments as described below. The five States chosen for this study, i.e., Assam, Delhi, Jharkhand, Maharashtra and Nagaland are representative of possible scenarios for the vaccine distribution problem, i.e., high incidence(Maharashtra and Delhi), moderate incidence (Assam) and low incidence (Jharkhand and Nagaland) as on August 15, 2020. This particular date was chosen following the announcement that India may launch its indigenous vaccine on this date. In choosing the five different States, we hope to generalize our predictions to other States across the spectrum while minimizing the bias introduced into the learning by a widely variant COVID-19 incidence across the country.

We also enhanced our modeling context with: Population share: The percentage ratio of the population of the state to the population of all the five states. Predicted Death Rate: The percentage ratio of the predicted deaths in the State to the total predicted cases in that State calculated using projections obtained from a fitted standard Compartmental model, i.e. a Susceptible, Exposed, Infected and Recovered(SEIR) model. Predicted Recovery Rate: The percentage ratio of the predicted recoveries in the State to the total predicted cases in that State using projections obtained from the SEIR model.

The implementation of ACKTR and contextual bandit sub-models of VacSIM are detailed henceforth:

ACKTR Model: Open-AI [21] stable-baselines framework was used to construct a novel and relevant environment suited to our problem statement for ACKTR to learn in this environment.

a. Input: With both the observation space and action space being declared as Box-type, a context vector describing the situation of the state in terms of Total Predicted Cases, Predicted Death Rate, Predicted Recovery Rate, Susceptible cases and Population, at a given time, was fed as input. Predictions were obtained from SEIR projections [22] . The action space was a one-dimensional vector with its size equal to the number of recipients of the vaccine in one round of distribution. Notably, we accounted for the cumulative time it would take for vaccine distribution, administration and generation of the immune response by the body i.e. the total time between dispatch of vaccine from the distribution centre to achievement of immunity in the vaccinated individual. This introduces a lag of 15 days between the distribution date of vaccines at day 't', to the gathering of context at day 't+15' by VacSIM using SEIR projections.

b. Model working: Following are the assumptions used while building the environment: Vaccine efficacy 100% 4

Number of recipients per day 5 Table 1 : Hyper-parameters used during Policy learning

• The nature of the vaccine is purely preventative and NOT curative, i.e., it introduces immunity when administered to a susceptible person against future COVID infection, but plays no role in fighting against existing infections (if any). • The vaccine has 100% efficacy i.e. all people who are vaccinated will necessarily develop immunity against future SARS-CoV-2 infection. This assumption is easily modifiable and is expected to have little consequence in deciding the optimal allocation, unless data reveal differential immunity response of certain populations within India. However, we leave scope for it to be modified as per the situation by taking this as a hyperparameter for VacSIM. • Each person requires only 1 dose (vial) of the vaccine to be vaccinated completely and successfully. This too may be treated as a hyperparameter.

Reward Function: The reward function was designed to maximize the decrease in the susceptible population count with the minimum amount of vaccine, considering it to be a limited resource.

Where R i was the reward given to vaccine recipient i S i was the susceptible population count of the same state 15 days from the day of distribution. q i was the amount of vaccine given to the state by the model.

Flow: VacSIM gives us a recommendation for the distribution ratio between various recipients (Indian States) of the vaccine as its output. Following this distribution set, it awards the corresponding number of vials to each State and converts a corresponding number of individuals in that the State from Susceptible to Recovered, thus short-circuiting the SEIR model.

The Explore-Exploit Tradeoff: We tap into the explore-vs-exploit dilemma, allowing the model to reassess its approach with ample opportunities and accordingly, redirect the learning process. We set the exploration rate at 40%. However, this too is flexible and can be treated as a hyperparameter.

Hyperparameters: A complete list of the hyperparameters is given in Table 1 .

c. Output: The output of the first sub-model was a distribution set dictating the share of each recipient in the batch of vaccines dispatched at the time of delivery.

The output of the first sub-model spanned over 15 days (1 September-15 September 2020) with each state having a total of 50 episodes being run for each day. For every episode, the distribution sets so obtained (one per episode) were normalised to get the percentage distribution ratio for all states. Normalised here refers to the percentage ratio of a given distribution set of a state and the sum of the distribution sets of the 5 states over an entire episode for a given date. Since the time period is fifteen days, this amounts to a total of 3750 episodes.

a. Training: These episodes, which comprised of the normalised distribution sets along with the corresponding set of rewards, were then fed to the second sub-model, i.e., Contextual Bandits as training data set.

The action space in this model was assumed to lie in the range [0,100] (both inclusive) to represent the percentage of vaccine that went to each state during the distribution process. The features in the context were the same as in sub-model 1, except population, which was now replaced by population share (fraction of population of a state with respect to the total recipient population). This was done merely for scaling purposes.

c. Testing: Using the context, normalised actions and the corresponding set of rewards as the training dataset, we tested the model day-wise for a period of fifteen days (16 September-30 September) with each day having fifty possible actions for each State as output, similar to what was done in ACKTR model.

The unadjusted actions (which were not normalised) obtained after testing the model were first adjusted day-wise for each State by taking the mean of all possible fifty actions for the State on that particular day. These were then normalized to obtain the percentage vaccine distribution for the five States for the period under consideration (15 days . Results indicate that out of the five states, Maharashtra, which had the highest number of cases, saw a gradually decreasing trend whereas Nagaland, which has the lowest number of cases, sees a gradually increasing trend with respect to the distribution of the vaccine Figure 3 (Right). We also calculated that if the vaccine were to be distributed on 16 

Since there is no way that the evaluation of distribution policy can be done in the absence of vaccine and real-world distribution, we defined the Naive baseline distribution policy as % of vaccine given to a state = % of Infected People in that state and compared it with our model's learned distribution. With 100000 doses and 5 States, we simulated the distribution of the available vaccine on 16 September for the Naive and VacSIM policies. The number of resulting (projected) infections for 30 days after the vaccine distribution were calculated using the SEIR Model. Day-wise total cases of all 5 states for both policy models were summarized. Our results indicate that the VacSIMbased policy would additionally reduces a total of 102385 infected cases, with 95% CI [10234, 102427] , in the next 30 days. As seen from Figure 3 (Right) and Figure 4 (Left), in the case where distribution was done using Naive approach, vaccine distribution for all the fifteen days was nearly the same with Maharashtra, receiving the highest amount of vaccine and Nagaland, receiving the least amount of vaccine as expected as per their infection rates. On the other hand, in case of the results obtained through VacSIM, each State would get a variable and sufficient amount of vaccine during the fifteen-day period including Nagaland, which received a negligible amount under the Naive approach. Unlike the Naive approach, VacSIM, therefore was not biased towards any State, thus ensuring equitable distribution while mitigating the epidemic.

The ultimate goal of vaccine distribution is to reduce mortality and morbidity. Since our model relies entirely upon simulations, in the absence of a vaccine, we checked if the data generated by such an approach follow the cause-andeffect relationships as expected in the real world data. Structure-learning was carried out using a data-driven Bayesian network [23] approach using Hill Climbing algorithm [24] with Akaike Information Criterion as a scoring function, and ensemble averaging over 101 bootstrapped networks. These models were learned using wiseR package [25] . State-wise time series data of death, recovery, infected people, susceptible people and the amount of vaccine obtained from our model were used to learn the structure. Blacklisting among nodes was done such that vaccine percentage cannot be the child node of COVID-19 trajectory indicators (Susceptible, Recovery, Infected People, Death). The resulting structure shows a causal relationship between the vaccine amount(parent node) and susceptible count (child node), thus confirming the technical correctness of the VacSIM model through an external evaluation approach (refer Figure 5 ).

Researchers worldwide are working around the clock to find a vaccine against SARS-CoV-2, the virus responsible for the COVID-19 pandemic. Once available, distribution of the vaccine will have numerous logistical challenges (supply chain, legal agreements, quality control, application to name a few) which might slow down the distribution process.

In this paper, we have developed a novel distribution policy model, VacSIM using Reinforcement Learning. We have pipelined an Actor-Critic using Kronecker-Factored Trust Region (ACKTR) model and Bayesian Regression-based Contextual Bandit model in a feed-forward way such that the output (Action and Rewards) of ACKTR model are fed into the Contextual Bandit model in order to provide a sensible context comprising actions and rewards. Contextual Bandits then optimized the policy considering demographic metrics such as population share of state with respect to the chosen 5 states and time series-based characteristics of the COVID-19 spread (susceptible population, recovery rate, death rate, total infected cases) as context. While distributing the vaccine, identifying the part of the population who needs it the most is a challenging task, and in our case, we addressed it by the usage of the aforementioned Context. Rather than using the present-day count of infected and susceptible people, we have used SEIR-based projections, which makes our predicted policy more robust and trustworthy. Evaluation of model-driven policy is a tough assignment due to unavailability of ground truth, and we proposed a novel causality-preserving approach to evaluate such models. The open-source code will enable testing of our claims by other researchers. VacSIM may have some limitations shared by all RL models, i.e. the transparency of their learning process and the explainability of their decisions. Secondly, the development of VacSIM has been carried out while observing the pandemic in the past few months. However, the dynamic nature of pandemic may require change in actions, thus calling for common-sense working alongside artificial intelligence. In conclusion, we believe that artificial intelligence has a role to play in optimal distribution of the scarce resources such as vaccines, syringes, drugs, personal protective equipment (PPEs) etc. that the world will see in the coming months. We provide a novel, open source, and extensible solution to this problem that policymakers and researchers may refer to while making decisions.

AstraZeneca Covid-19 vaccine study is put on hold

A Proposed Lottery System to Allocate Scarce COVID-19 Medications: Promoting Fairness and Generating Knowledge

If a coronavirus vaccine arrives, can the world make enough?

A Comprehensive COVID-19 Vaccine Plan

A Survey of Agent-Based Intelligent Decision Support Systems to Support Clinical

COVID-19 Vaccine: Development, Access and Distribution in the Indian Context

Policy Gradient Methods for Reinforcement Learning with Function Approximation

Simple statistical gradient-following algorithms for connectionist reinforcement learning

High-Dimensional Continuous Control Using Generalized Advantage Estimation

Scalable trust-region method for deep reinforcement learning using Kronecker-factored approximation

Asynchronous Methods for Deep Reinforcement Learning

Trust Region Policy Optimization

New insights and perspectives on the natural gradient method

Optimizing Neural Networks with Kronecker-factored Approximate Curvature

Deep Contextual Multi-armed Bandits

Deep Bayesian Bandits Showdown: An Empirical Comparison of Bayesian Deep Networks for Thompson Sampling

Thompson Sampling for Contextual Bandits with Linear Payoffs

Pattern recognition and machine learning, ser. Information science and statistics

Gym: A toolkit for developing and comparing reinforcement learning algorithms

Global stability for the SEIR model in epidemiology

A Tutorial on Learning With Bayesian Networks

Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood

wiseR: A Shiny Application for End-to-End Bayesian Decision Network Analysis and Web-Deployment


