Haipeng Chen
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
Haipeng Chen has a total of 134 co-authors. Here are the top co-authors by number of shared publications:
- Yanhai Xiong
William & Mary, Williamsburg, VA, USA
3 shared publications - Bo An
Nanyang Technological University
2 shared publications - Han Xu
Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
2 shared publications - Venkatramanan S. Subrahmanian
Northwestern University, Evanston, IL, USA
2 shared publications - Yang Li
William & Mary, Williamsburg, VA, USA
2 shared publications - Aaron Y. Lee
John F. Hardesty M.D. Department of Ophthalmology and Visual Sciences, Washington University in St Louis School of Medicine, St. Louis MO
1 shared publication
Latest Publications
- Open Access
- 23 March 2026
- Published by JMIR Publications Inc. in JMIR Preprints
Using Synthetic Data for Machine Learning-based Childhood Vaccination Prediction in Narok, Kenya (Preprint)
BACKGROUND Limited data utilization in low-resource settings poses a major barrier to the vaccine delivery ecosystem, undermining efforts to achieve equitable immunization coverage. In nomadic populations, where reliable data are hard to obtain, individuals face an increased risk of missing crucial vaccination doses as children. One such population is the Maasai in Narok County, Kenya, where the absence of high-volume, high-quality data hampers accurate coverage estimates, impedes efficient resource allocation, and weakens the ability to design and deliver timely interventions. Additionally, data privacy concerns are heightened in groups with limited sensitive data. OBJECTIVE First, we aim to identify children at risk of missing key vaccines across a large population to provide timely, evidence-based interventions that support increased vaccination coverage. Second, we aim to better protect the privacy of sensitive health data within a vulnerable population. METHODS We digitized 8 years of child vaccination records from the MOH 510 registry (n=6,913) and applied machine learning models (i.e., Logistic Regression and XGBoost) to identify children at risk. Additionally, we utilize a novel approach to tabular diffusion-based synthetic data generation ("TabSyn") to protect patient privacy within the models. RESULTS Our findings show that classification techniques can reliably and successfully predict children at risk of missing a vaccine, with recall, precision, and F1-scores exceeding 90% for some vaccines modeled. Additionally, training these models with synthetic data rather than real data—preserving the privacy of individuals within the original dataset—does not lead to a loss in predictive performance. CONCLUSIONS These results support the use of synthetic data implementation in health informatics strategies for clinics with limited digital infrastructure, enabling privacy-preserving, scalable forecasting for childhood immunization coverage.
- 23 March 2026
- Published by JMIR Publications Inc. in JMIR Preprints
Open AccessUsing Synthetic Data for Machine Learning-based Childhood Vaccination Prediction in Narok, Kenya (Preprint)
BACKGROUND Limited data utilization in low-resource settings poses a major barrier to the vaccine delivery ecosystem, undermining efforts to achieve equitable immunization coverage. In nomadic populations, where reliable data are hard to obtain, individuals face an increased risk of missing crucial vaccination doses as children. One such population is the Maasai in Narok County, Kenya, where the absence of high-volume, high-quality data hampers accurate coverage estimates, impedes efficient resource allocation, and weakens the ability to design and deliver timely interventions. Additionally, data privacy concerns are heightened in groups with limited sensitive data. OBJECTIVE First, we aim to identify children at risk of missing key vaccines across a large population to provide timely, evidence-based interventions that support increased vaccination coverage. Second, we aim to better protect the privacy of sensitive health data within a vulnerable population. METHODS We digitized 8 years of child vaccination records from the MOH 510 registry (n=6,913) and applied machine learning models (i.e., Logistic Regression and XGBoost) to identify children at risk. Additionally, we utilize a novel approach to tabular diffusion-based synthetic data generation ("TabSyn") to protect patient privacy within the models. RESULTS Our findings show that classification techniques can reliably and successfully predict children at risk of missing a vaccine, with recall, precision, and F1-scores exceeding 90% for some vaccines modeled. Additionally, training these models with synthetic data rather than real data—preserving the privacy of individuals within the original dataset—does not lead to a loss in predictive performance. CONCLUSIONS These results support the use of synthetic data implementation in health informatics strategies for clinics with limited digital infrastructure, enabling privacy-preserving, scalable forecasting for childhood immunization coverage.
- 14 January 2026
- Published by SAGE Publications in Journal of Diabetes Science and Technology
- Vol. 20 (3) , 609-619
Research Code Sharing in Support of Gold Standard Science
Sharing research code in an open access version-controlled repository offers significant benefits for both science as a whole and for individual researchers. In this article, we focus on this practice, which is fully aligned with the NIH’s Gold Standard Science (GSS) program as well as FAIR (findable, accessible, interoperable, reusable) and TRUST (transparency, responsibility, user focus, sustainability, technology) principles. Gold Standard Science supports open science by emphasizing transparency, reproducibility, and the use of best practices that enable others to verify and extend research. Pairing a research article’s cited data snapshot with a versioned, environment-specific code release, deposited in a companion code repository, ensures that, upon submission to a medical journal, readers and reviewers can directly verify results. An executable and updatable companion code repository complements, rather than replaces, established research data repositories. When code underlying medical research results is made openly available, then other scientists can inspect, run, and validate analyses. These activities enhance reproducibility, which is a core aim of GSS. Shared code also facilitates collaborative innovation by allowing researchers to extend the utility of the code to new datasets and applications. For researchers, code sharing can increase visibility, credibility, and citation impact. Demonstrating transparency through shared executable and updatable code builds trust with journal readers, peer reviewers, funders, and peers. Shared code in an open access repository signals adherence to high standards of scientific integrity and attracts opportunities for collaboration. A researcher who shares code receives recognition as a leader in reproducible, trustworthy research consistent with NIH’s GSS principles.
- 14 January 2026
- Published by SAGE Publications in Journal of Diabetes Science and Technology
- Vol. 20 (3) , 609-619
Research Code Sharing in Support of Gold Standard Science
Sharing research code in an open access version-controlled repository offers significant benefits for both science as a whole and for individual researchers. In this article, we focus on this practice, which is fully aligned with the NIH’s Gold Standard Science (GSS) program as well as FAIR (findable, accessible, interoperable, reusable) and TRUST (transparency, responsibility, user focus, sustainability, technology) principles. Gold Standard Science supports open science by emphasizing transparency, reproducibility, and the use of best practices that enable others to verify and extend research. Pairing a research article’s cited data snapshot with a versioned, environment-specific code release, deposited in a companion code repository, ensures that, upon submission to a medical journal, readers and reviewers can directly verify results. An executable and updatable companion code repository complements, rather than replaces, established research data repositories. When code underlying medical research results is made openly available, then other scientists can inspect, run, and validate analyses. These activities enhance reproducibility, which is a core aim of GSS. Shared code also facilitates collaborative innovation by allowing researchers to extend the utility of the code to new datasets and applications. For researchers, code sharing can increase visibility, credibility, and citation impact. Demonstrating transparency through shared executable and updatable code builds trust with journal readers, peer reviewers, funders, and peers. Shared code in an open access repository signals adherence to high standards of scientific integrity and attracts opportunities for collaboration. A researcher who shares code receives recognition as a leader in reproducible, trustworthy research consistent with NIH’s GSS principles.
- Open Access
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6883-6884
AutoRuleSQL: Hybrid Text-to-SQL via Rule-Driven Fast Paths and LLM Bootstrapping
- 10 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 6883-6884
Open AccessAutoRuleSQL: Hybrid Text-to-SQL via Rule-Driven Fast Paths and LLM Bootstrapping
- Open Access
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 5568-5569
Towards Real-Time and Personalized Code Generation
Large language models (LLMs) have transformed automated code generation. However, their high computational demands often lead to server overload and increased latency in SaaS deployments. To address this, we present SpeCoder, a framework that accelerates server-side code generation using speculative sampling (SpS) and supervised fine-tuning (SFT). SpS allows lower latency in the code generation, whereas SFT enables more personalized code generation tailored to the user's needs.
- 21 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 5568-5569
Open AccessTowards Real-Time and Personalized Code Generation
Large language models (LLMs) have transformed automated code generation. However, their high computational demands often lead to server overload and increased latency in SaaS deployments. To address this, we present SpeCoder, a framework that accelerates server-side code generation using speculative sampling (SpS) and supervised fine-tuning (SFT). SpS allows lower latency in the code generation, whereas SFT enables more personalized code generation tailored to the user's needs.
- Open Access
- 17 August 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-13
Nomograms predicting cancer-specific survival for stage IV colorectal cancer with synchronous lung metastases
This study aimed to establish a nomogram for the prediction of cancer-specific survival (CSS) of CRC patients with synchronous LM. The final prognostic nomogram based on prognostic factors was evaluated by concordance index (C-index), time-dependent receiver operating characteristic curves, and calibration curves. In the training and validation groups, the C-index for the nomogram was 0.648 and 0.638, and the AUC was 0.793 and 0.785, respectively. The high quality of the calibration curves in the nomogram models for CSS at 1-, 3-, and 5-year was observed. The nomogram model provided a conventional and useful tool to evaluate the 1-, 3-, and 5-year CSS of CRC patients with synchronous LM.
- 17 August 2022
- Published by Springer Nature in Scientific Reports
- Vol. 12 (1) , 1-13
Open AccessNomograms predicting cancer-specific survival for stage IV colorectal cancer with synchronous lung metastases
This study aimed to establish a nomogram for the prediction of cancer-specific survival (CSS) of CRC patients with synchronous LM. The final prognostic nomogram based on prognostic factors was evaluated by concordance index (C-index), time-dependent receiver operating characteristic curves, and calibration curves. In the training and validation groups, the C-index for the nomogram was 0.648 and 0.638, and the AUC was 0.793 and 0.785, respectively. The high quality of the calibration curves in the nomogram models for CSS at 1-, 3-, and 5-year was observed. The nomogram model provided a conventional and useful tool to evaluate the 1-, 3-, and 5-year CSS of CRC patients with synchronous LM.
- Open Access
Learning MDPs from Features: Predict-Then-Optimize for Sequential Decision Problems by Reinforcement Learning
In the predict-then-optimize framework, the objective is to train a predictive model, mapping from environment features to parameters of an optimization problem, which maximizes decision quality when the optimization is subsequently solved. Recent work on decision-focused learning shows that embedding the optimization problem in the training pipeline can improve decision quality and help generalize better to unseen tasks compared to relying on an intermediate loss function for evaluating prediction quality. We study the predict-then-optimize framework in the context of sequential decision problems (formulated as MDPs) that are solved via reinforcement learning. In particular, we are given environment features and a set of trajectories from training MDPs, which we use to train a predictive model that generalizes to unseen test MDPs without trajectories. Two significant computational challenges arise in applying decision-focused learning to MDPs: (i) large state and action spaces make it infeasible for existing techniques to differentiate through MDP problems, and (ii) the high-dimensional policy space, as parameterized by a neural network, makes differentiating through a policy expensive. We resolve the first challenge by sampling provably unbiased derivatives to approximate and differentiate through optimality conditions, and the second challenge by using a low-rank approximation to the high-dimensional sample-based derivatives. We implement both Bellman--based and policy gradient--based decision-focused learning on three different MDP problems with missing parameters, and show that decision-focused learning performs better in generalization to unseen tasks.
Open AccessLearning MDPs from Features: Predict-Then-Optimize for Sequential Decision Problems by Reinforcement Learning
In the predict-then-optimize framework, the objective is to train a predictive model, mapping from environment features to parameters of an optimization problem, which maximizes decision quality when the optimization is subsequently solved. Recent work on decision-focused learning shows that embedding the optimization problem in the training pipeline can improve decision quality and help generalize better to unseen tasks compared to relying on an intermediate loss function for evaluating prediction quality. We study the predict-then-optimize framework in the context of sequential decision problems (formulated as MDPs) that are solved via reinforcement learning. In particular, we are given environment features and a set of trajectories from training MDPs, which we use to train a predictive model that generalizes to unseen test MDPs without trajectories. Two significant computational challenges arise in applying decision-focused learning to MDPs: (i) large state and action spaces make it infeasible for existing techniques to differentiate through MDP problems, and (ii) the high-dimensional policy space, as parameterized by a neural network, makes differentiating through a policy expensive. We resolve the first challenge by sampling provably unbiased derivatives to approximate and differentiate through optimality conditions, and the second challenge by using a low-rank approximation to the high-dimensional sample-based derivatives. We implement both Bellman--based and policy gradient--based decision-focused learning on three different MDP problems with missing parameters, and show that decision-focused learning performs better in generalization to unseen tasks.
- Open Access
- 1 July 2022
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 6, 5199-5205
Sequential Vaccine Allocation with Delayed Feedback
In this work we consider the problem of how to best allocate a limited supply of vaccines in the aftermath of an infectious disease outbreak by viewing the problem as a sequential game between a learner and an environment (specifically, a bandit problem). The difficulty of this problem lies in the fact that the payoff of vaccination cannot be directly observed, making it difficult to compare the relative effectiveness of vaccination on different population groups. Currently used vaccination policies make recommendations based on mathematical modelling and ethical considerations. These policies are static, and do not adapt as conditions change. Our aim is to design and evaluate an algorithm which can make use of routine surveillance data to dynamically adjust its recommendation. We evaluate the performance of our approach by applying it to a simulated epidemic of a disease based on real-world COVID-19 data, and show that our vaccination policy was able to perform better than existing vaccine allocation policies. In particular, we show that with our allocation method, we can reduce the number of required vaccination by at least 50% in order to keep the peak number of hospitalised patients below a certain threshold. Also, when the same batch sizes are used, our method can reduce the peak number of hospitalisation by up to 20%. We also demonstrate that our vaccine allocation does not vary the number of batches per group much, making it socially more acceptable (as it reduces uncertainty, hence results in better and more interpretable communication).
- 1 July 2022
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 6, 5199-5205
Open AccessSequential Vaccine Allocation with Delayed Feedback
In this work we consider the problem of how to best allocate a limited supply of vaccines in the aftermath of an infectious disease outbreak by viewing the problem as a sequential game between a learner and an environment (specifically, a bandit problem). The difficulty of this problem lies in the fact that the payoff of vaccination cannot be directly observed, making it difficult to compare the relative effectiveness of vaccination on different population groups. Currently used vaccination policies make recommendations based on mathematical modelling and ethical considerations. These policies are static, and do not adapt as conditions change. Our aim is to design and evaluate an algorithm which can make use of routine surveillance data to dynamically adjust its recommendation. We evaluate the performance of our approach by applying it to a simulated epidemic of a disease based on real-world COVID-19 data, and show that our vaccination policy was able to perform better than existing vaccine allocation policies. In particular, we show that with our allocation method, we can reduce the number of required vaccination by at least 50% in order to keep the peak number of hospitalised patients below a certain threshold. Also, when the same batch sizes are used, our method can reduce the peak number of hospitalisation by up to 20%. We also demonstrate that our vaccine allocation does not vary the number of batches per group much, making it socially more acceptable (as it reduces uncertainty, hence results in better and more interpretable communication).
- Open Access
Learning Behaviors with Uncertain Human Feedback
Human feedback is widely used to train agents in many domains. However, previous works rarely consider the uncertainty when humans provide feedback, especially in cases that the optimal actions are not obvious to the trainers. For example, the reward of a sub-optimal action can be stochastic and sometimes exceeds that of the optimal action, which is common in games or real-world. Trainers are likely to provide positive feedback to sub-optimal actions, negative feedback to the optimal actions and even do not provide feedback in some confusing situations. Existing works, which utilize the Expectation Maximization (EM) algorithm and treat the feedback model as hidden parameters, do not consider uncertainties in the learning environment and human feedback. To address this challenge, we introduce a novel feedback model that considers the uncertainty of human feedback. However, this incurs intractable calculus in the EM algorithm. To this end, we propose a novel approximate EM algorithm, in which we approximate the expectation step with the Gradient Descent method. Experimental results in both synthetic scenarios and two real-world scenarios with human participants demonstrate the superior performance of our proposed approach.
Open AccessLearning Behaviors with Uncertain Human Feedback
Human feedback is widely used to train agents in many domains. However, previous works rarely consider the uncertainty when humans provide feedback, especially in cases that the optimal actions are not obvious to the trainers. For example, the reward of a sub-optimal action can be stochastic and sometimes exceeds that of the optimal action, which is common in games or real-world. Trainers are likely to provide positive feedback to sub-optimal actions, negative feedback to the optimal actions and even do not provide feedback in some confusing situations. Existing works, which utilize the Expectation Maximization (EM) algorithm and treat the feedback model as hidden parameters, do not consider uncertainties in the learning environment and human feedback. To address this challenge, we introduce a novel feedback model that considers the uncertainty of human feedback. However, this incurs intractable calculus in the EM algorithm. To this end, we propose a novel approximate EM algorithm, in which we approximate the expectation step with the Gradient Descent method. Experimental results in both synthetic scenarios and two real-world scenarios with human participants demonstrate the superior performance of our proposed approach.
- 23 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (3) , 3779-3790
Disclose or Exploit? A Game-Theoretic Approach to Strategic Decision Making in Cyber-Warfare
- 23 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 14 (3) , 3779-3790
Disclose or Exploit? A Game-Theoretic Approach to Strategic Decision Making in Cyber-Warfare