Ajitesh Srivastava
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ajitesh Srivastava has a total of 731 co-authors. Here are the top co-authors by number of shared publications:
- Viktor Prasanna
University of Southern California
13 shared publications - Justin Lessler
Department of Epidemiology, Gillings School of Global Public Health, University of North Carolina at Chapel Hill, Chapel Hill, NC, USA
10 shared publications - Shaun Truelove
Johns Hopkins University
10 shared publications - Alessandro Vespignani
Network Science Institute, Northeastern University, Boston, MA, USA
9 shared publications - Bryan Lewis
University of Virginia, Charlottesville, VA, USA
9 shared publications - Cécile Viboud
Fogarty International Center, National Institutes of Health, Bethesda, MD, USA
9 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4672-4682
Generating Intervention Hypotheses using Explainable Explanations on Graphs: G2I, a Two-Stage Greedy Framework
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 4672-4682
Open AccessGenerating Intervention Hypotheses using Explainable Explanations on Graphs: G2I, a Two-Stage Greedy Framework
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 13431-13432
epiDAMIK 2026: Workshop on Data-driven Decision Making for Public and Population Health
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 13431-13432
Open AccessepiDAMIK 2026: Workshop on Data-driven Decision Making for Public and Population Health
- Open Access
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4393-4404
Submodular Maximization under Supermodular Constraint: Greedy Guarantees
- 8 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 4393-4404
Open AccessSubmodular Maximization under Supermodular Constraint: Greedy Guarantees
- Open Access
Adaptive multi-model ensembles for improved epidemic projections and decision support
In recent years, the use of multi-model ensemble projections in infectious disease modeling has become an established methodological approach to account for and integrate across uncertainties and structural differences present in individual models. However, the creation of long-term ensemble projections through these coordinated efforts is resource-intensive, demanding the input of multiple research teams and substantial computational power. This typically limits the ability to refine projections, update the selection of plausible epidemic trajectories, or expand the number of scenarios that can be assessed, even as new empirical data become available. To address this challenge, we define an adaptive ensemble approach that, analogously to a multi-model particle filtering method, dynamically selects individual model trajectories based on observed data throughout the epidemic projection period. We demonstrate the effectiveness of this methodology using the U.S. Flu Scenario Modeling Hub (SMH) projections for influenza hospitalizations in the United States during the 2023-2024 and 2024-2025 winter seasons. Our findings show that the adaptive ensemble yields improved predictive accuracy with respect to the original SMH ensemble projections across several scoring rules and geographical resolutions. Furthermore, the adaptive ensemble approach offers two additional applications: i) the dynamic assignment of posterior probabilities to epidemic scenarios, identifying the most plausible scenario, and representing how reality is captured by a combination of scenarios, and ii) the potential use for short-term forecasting. The adaptive ensemble approach is able to identify the most likely scenarios for the 2023-2024 and 2024-2025 U.S. influenza seasons, even in the early stages of the epidemic. It outperforms, retrospectively, a baseline model in short-term forecasting of influenza hospitalizations in the United States during the two seasons across various horizons and scoring rules, showing potential to contribute to real-time collaborative forecasting challenges such as CDC’s FluSight. The proposed approach offers an efficient or low-resource strategy to increase the impact of multi-model epidemic projections by providing real-time support to modeling teams, public health authorities, and decision-makers.
Open AccessAdaptive multi-model ensembles for improved epidemic projections and decision support
In recent years, the use of multi-model ensemble projections in infectious disease modeling has become an established methodological approach to account for and integrate across uncertainties and structural differences present in individual models. However, the creation of long-term ensemble projections through these coordinated efforts is resource-intensive, demanding the input of multiple research teams and substantial computational power. This typically limits the ability to refine projections, update the selection of plausible epidemic trajectories, or expand the number of scenarios that can be assessed, even as new empirical data become available. To address this challenge, we define an adaptive ensemble approach that, analogously to a multi-model particle filtering method, dynamically selects individual model trajectories based on observed data throughout the epidemic projection period. We demonstrate the effectiveness of this methodology using the U.S. Flu Scenario Modeling Hub (SMH) projections for influenza hospitalizations in the United States during the 2023-2024 and 2024-2025 winter seasons. Our findings show that the adaptive ensemble yields improved predictive accuracy with respect to the original SMH ensemble projections across several scoring rules and geographical resolutions. Furthermore, the adaptive ensemble approach offers two additional applications: i) the dynamic assignment of posterior probabilities to epidemic scenarios, identifying the most plausible scenario, and representing how reality is captured by a combination of scenarios, and ii) the potential use for short-term forecasting. The adaptive ensemble approach is able to identify the most likely scenarios for the 2023-2024 and 2024-2025 U.S. influenza seasons, even in the early stages of the epidemic. It outperforms, retrospectively, a baseline model in short-term forecasting of influenza hospitalizations in the United States during the two seasons across various horizons and scoring rules, showing potential to contribute to real-time collaborative forecasting challenges such as CDC’s FluSight. The proposed approach offers an efficient or low-resource strategy to increase the impact of multi-model epidemic projections by providing real-time support to modeling teams, public health authorities, and decision-makers.
- Open Access
Submodular Maximization under Supermodular Constraint: Greedy Guarantees
Motivated by a wide range of applications in data mining and machine learning, we consider the problem of maximizing a submodular function subject to supermodular cost constraints. In contrast to the well-understood setting of cardinality and matroid constraints, where greedy algorithms admit strong guarantees, the supermodular constraint regime remains poorly understood -- guarantees for greedy methods and other efficient algorithmic paradigms are largely open. We study this family of fundamental optimization problems under an upper-bound constraint on a supermodular cost function with curvature parameter $γ$. Our notion of supermodular curvature is less restrictive than prior definitions, substantially expanding the class of admissible cost functions. We show that our greedy algorithm that iteratively includes elements maximizing the ratio of the objective and constraint functions, achieves a $\left(1 - e^{-(1-γ)}\right)$-approximation before stopping. We prove that this approximation is indeed tight for this algorithm. Further, if the objective function has a submodular curvature $c$, then we show that the bound further improves to $\left(1 - (1- (1-c)(1-γ))^{1/(1-c)}\right)$, which can be further improved by continuing to violate the constraint. Finally, we show that the Greedy-Ratio-Marginal in conjunction with binary search leads to a bicriteria approximation for the dual problem -- minimizing a supermodular function under a lower bound constraint on a submodular function. We conduct a number of experiments on a simulation of LLM agents debating over multiple rounds -- the task is to select a subset of agents to maximize correctly answered questions. Our algorithm outperforms all other greedy heuristics, and on smaller problems, it achieves the same performance as the optimal set found by exhaustive search.Open AccessSubmodular Maximization under Supermodular Constraint: Greedy Guarantees
Motivated by a wide range of applications in data mining and machine learning, we consider the problem of maximizing a submodular function subject to supermodular cost constraints. In contrast to the well-understood setting of cardinality and matroid constraints, where greedy algorithms admit strong guarantees, the supermodular constraint regime remains poorly understood -- guarantees for greedy methods and other efficient algorithmic paradigms are largely open. We study this family of fundamental optimization problems under an upper-bound constraint on a supermodular cost function with curvature parameter $γ$. Our notion of supermodular curvature is less restrictive than prior definitions, substantially expanding the class of admissible cost functions. We show that our greedy algorithm that iteratively includes elements maximizing the ratio of the objective and constraint functions, achieves a $\left(1 - e^{-(1-γ)}\right)$-approximation before stopping. We prove that this approximation is indeed tight for this algorithm. Further, if the objective function has a submodular curvature $c$, then we show that the bound further improves to $\left(1 - (1- (1-c)(1-γ))^{1/(1-c)}\right)$, which can be further improved by continuing to violate the constraint. Finally, we show that the Greedy-Ratio-Marginal in conjunction with binary search leads to a bicriteria approximation for the dual problem -- minimizing a supermodular function under a lower bound constraint on a submodular function. We conduct a number of experiments on a simulation of LLM agents debating over multiple rounds -- the task is to select a subset of agents to maximize correctly answered questions. Our algorithm outperforms all other greedy heuristics, and on smaller problems, it achieves the same performance as the optimal set found by exhaustive search. - Open Access
From wastewater to infection estimates: Incident COVID-19 infections during Omicron in the U.S.
- Open Access
From Wastewater to Infection Estimates: Incident COVID-19 Infections during Omicron in the U.S.
Reconstructing the course of the COVID-19 pandemic through infection estimates is important for assessing disease burden and characterizing transmission dynamics. While wastewater concentration data have been used to estimate infections in localized pre-Omicron studies, a scalable approach that incorporates reinfections and variant-specific shedding remains underdeveloped. To this end, we develop a multi-source approach to retrospectively estimate daily COVID-19 infections in U.S. states during the Omicron era. Our approach integrates wastewater and seroprevalence surveillance data and further incorporates state-specific reinfections to improve infection estimates during the Delta-Omicron transition period. These refined estimates, along with wastewater concentration data adjusted for limited coverage, are used to calculate variant-specific shedding rates, which inform daily infection estimates going forward. While case-based estimates tend to exhibit striking volatility, these infection estimates show more stable and interpretable patterns that closely align with Omicron subvariant transitions. Moreover, we directly quantify the degree of underreporting, showing the extent that reported cases significantly underestimate disease burden, with the lowest reporting rates of 9.72% in Washington, 9.73% in Minnesota, and 10.70% in New York. In the states under study, case reports capture less than a quarter of total infections, leaving the vast majority unaccounted for in official reports. Furthermore, reporting rates differ markedly across states, with disparities growing over time, reflecting the overall rise in underreporting and location-specific limitations to surveillance accuracy. Finally, we estimate time-varying effective reproduction numbers and growth rates to provide a more accurate and timely picture of transmission dynamics over the Omicron era in U.S. states.
Open AccessFrom Wastewater to Infection Estimates: Incident COVID-19 Infections during Omicron in the U.S.
Reconstructing the course of the COVID-19 pandemic through infection estimates is important for assessing disease burden and characterizing transmission dynamics. While wastewater concentration data have been used to estimate infections in localized pre-Omicron studies, a scalable approach that incorporates reinfections and variant-specific shedding remains underdeveloped. To this end, we develop a multi-source approach to retrospectively estimate daily COVID-19 infections in U.S. states during the Omicron era. Our approach integrates wastewater and seroprevalence surveillance data and further incorporates state-specific reinfections to improve infection estimates during the Delta-Omicron transition period. These refined estimates, along with wastewater concentration data adjusted for limited coverage, are used to calculate variant-specific shedding rates, which inform daily infection estimates going forward. While case-based estimates tend to exhibit striking volatility, these infection estimates show more stable and interpretable patterns that closely align with Omicron subvariant transitions. Moreover, we directly quantify the degree of underreporting, showing the extent that reported cases significantly underestimate disease burden, with the lowest reporting rates of 9.72% in Washington, 9.73% in Minnesota, and 10.70% in New York. In the states under study, case reports capture less than a quarter of total infections, leaving the vast majority unaccounted for in official reports. Furthermore, reporting rates differ markedly across states, with disparities growing over time, reflecting the overall rise in underreporting and location-specific limitations to surveillance accuracy. Finally, we estimate time-varying effective reproduction numbers and growth rates to provide a more accurate and timely picture of transmission dynamics over the Omicron era in U.S. states.
- Open Access
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (27) , 27793-27801
Dynamics-Based Feature Augmentation of Graph Neural Networks for Variant Emergence Prediction
During the COVID-19 pandemic, a major driver of new surges has been the emergence of new variants. When a new variant emerges in one or more countries, other nations monitor its spread in preparation for its potential arrival. The impact of the new variant and the timings of epidemic peaks in a country highly depend on when the variant arrives. The current methods for predicting the spread of new variants rely on statistical modeling, however, these methods work only when the new variant has already arrived in the region of interest and has a significant prevalence. Can we predict when a variant existing elsewhere will arrive in a given region? To address this question, we propose a variant-dynamics-informed Graph Neural Network (GNN) approach. First, we derive the dynamics of variant prevalence across pairs of regions (countries) that apply to a large class of epidemic models. The dynamics motivate the introduction of certain features in the GNN. We demonstrate that our proposed dynamics-informed GNN outperforms all the baselines, including the currently pervasive framework of Physics-Informed Neural Networks (PINNs). To advance research in this area, we introduce a benchmarking tool to assess a user-defined model's prediction performance across 87 countries and 36 variants.
- 11 April 2025
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 39 (27) , 27793-27801
Open AccessDynamics-Based Feature Augmentation of Graph Neural Networks for Variant Emergence Prediction
During the COVID-19 pandemic, a major driver of new surges has been the emergence of new variants. When a new variant emerges in one or more countries, other nations monitor its spread in preparation for its potential arrival. The impact of the new variant and the timings of epidemic peaks in a country highly depend on when the variant arrives. The current methods for predicting the spread of new variants rely on statistical modeling, however, these methods work only when the new variant has already arrived in the region of interest and has a significant prevalence. Can we predict when a variant existing elsewhere will arrive in a given region? To address this question, we propose a variant-dynamics-informed Graph Neural Network (GNN) approach. First, we derive the dynamics of variant prevalence across pairs of regions (countries) that apply to a large class of epidemic models. The dynamics motivate the introduction of certain features in the GNN. We demonstrate that our proposed dynamics-informed GNN outperforms all the baselines, including the currently pervasive framework of Physics-Informed Neural Networks (PINNs). To advance research in this area, we introduce a benchmarking tool to assess a user-defined model's prediction performance across 87 countries and 36 variants.