Chengpiao Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chengpiao Huang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Kaizheng Wang
Department of IEOR and Data Science Institute, Columbia University
4 shared publications Dong Zhang
Huawei Technologies, Shenzhen, China
1 shared publicationGrace Jiarui Fan
1 shared publication- Qingjiang Shi
Tongji University
1 shared publication Tianyi Peng
1 shared publication- Ye Xue
School of Intelligent Systems Engineering, Shenzhen Campus of Sun Yat sen University, Shenzhen, China
1 shared publication
Latest Publications
- Open Access
- 30 August 2026
- Published by Elsevier in SSRN Electronic Journal
Learning a Size-Weight Frontier for Synthetic-Augmented Inference
Synthetic data can improve statistical inference when real data are scarce, but naively treating synthetic samples as real data can introduce bias and lead to unreliable inference. We develop a general framework for synthetic-augmented inference across a population of related tasks. It characterizes synthetic augmentation by the number of synthetic observations and their weight. Central to our framework is a size-weight frontier that specifies, for each weight, the largest synthetic sample size for which all smaller sizes attain the target task-marginal coverage. We estimate this frontier from historical tasks, and establish a finite-sample coverage guarantee simultaneously for all size-weight configurations on or below the estimated frontier. In experiments using large language model responses to augment opinion survey data, our procedure achieves target coverage and substantially narrows confidence intervals.
- 30 August 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLearning a Size-Weight Frontier for Synthetic-Augmented Inference
Synthetic data can improve statistical inference when real data are scarce, but naively treating synthetic samples as real data can introduce bias and lead to unreliable inference. We develop a general framework for synthetic-augmented inference across a population of related tasks. It characterizes synthetic augmentation by the number of synthetic observations and their weight. Central to our framework is a size-weight frontier that specifies, for each weight, the largest synthetic sample size for which all smaller sizes attain the target task-marginal coverage. We estimate this frontier from historical tasks, and establish a finite-sample coverage guarantee simultaneously for all size-weight configurations on or below the estimated frontier. In experiments using large language model responses to augment opinion survey data, our procedure achieves target coverage and substantially narrows confidence intervals.
- Open Access
- 29 July 2026
- Published by Elsevier in SSRN Electronic Journal
LLM-Powered Virtual Population for Demand Simulation and Pricing
We develop an LLM-powered virtual population model that simulates demand for pricing decisions, in settings where products are described by rich unstructured information, such as text descriptions and images, and where decision makers need not only mean-demand predictions but also uncertainty estimates for counterfactual prices. Our model represents exposed customers as draws from a finite mixture of customer personas. For each persona, product, and candidate price, an LLM elicits a persona-level purchase probability using both structured persona information and unstructured product information. These probabilities are aggregated through calibrated mixture weights to form a predictive distribution of aggregate demand. The resulting simulator can evaluate counterfactual prices under various pricing objectives, including expected revenue and risk-aware criteria such as conditional value at risk. We test the framework on an online H&M fashion dataset with product descriptions and images. The calibrated LLM-based simulator achieves the best overall predictive performance among the models considered, and supports sample-efficient pricing decisions. Our framework provides a practical way to use LLMs as demand simulators for products with limited historical demand data but rich product information. By producing a full predictive demand distribution rather than only a point forecast, it enables managers to compare candidate prices, quantify demand uncertainty, and choose prices that target either average-case revenue or risk-aware objectives.
- 29 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLLM-Powered Virtual Population for Demand Simulation and Pricing
We develop an LLM-powered virtual population model that simulates demand for pricing decisions, in settings where products are described by rich unstructured information, such as text descriptions and images, and where decision makers need not only mean-demand predictions but also uncertainty estimates for counterfactual prices. Our model represents exposed customers as draws from a finite mixture of customer personas. For each persona, product, and candidate price, an LLM elicits a persona-level purchase probability using both structured persona information and unstructured product information. These probabilities are aggregated through calibrated mixture weights to form a predictive distribution of aggregate demand. The resulting simulator can evaluate counterfactual prices under various pricing objectives, including expected revenue and risk-aware criteria such as conditional value at risk. We test the framework on an online H&M fashion dataset with product descriptions and images. The calibrated LLM-based simulator achieves the best overall predictive performance among the models considered, and supports sample-efficient pricing decisions. Our framework provides a practical way to use LLMs as demand simulators for products with limited historical demand data but rich product information. By producing a full predictive demand distribution rather than only a point forecast, it enables managers to compare candidate prices, quantify demand uncertainty, and choose prices that target either average-case revenue or risk-aware objectives.
- Open Access
- 14 April 2026
- Published by Elsevier in SSRN Electronic Journal
SYN-DIGITS: A Synthetic Control Framework for Calibrated Digital Twin Simulation
AI-based persona simulation---often referred to as digital twin simulation---is increasingly used for market research, recommender systems, and social sciences. Despite their flexibility, large language models (LLMs) often exhibit systematic bias and miscalibration relative to real human behavior, limiting their reliability. Inspired by synthetic control methods from causal inference, we propose SYN-DIGITS (SYNthetic Control Framework for Calibrated DIGItal Twin Simulation), a principled and lightweight calibration framework that learns latent structure from digital-twin responses and transfers it to align predictions with human ground truth. SYN-DIGITS operates as a post-processing layer on top of any LLM-based simulator and thus is model-agnostic. We develop a latent factor model that formalizes when and why calibration succeeds through latent space alignment conditions, and we systematically evaluate ten calibration methods across thirteen persona constructions, three LLMs, and two datasets. SYN-DIGITS supports both individual-level and distributional simulation for previously unseen questions and unobserved populations, with provable error guarantees. Experiments show that SYN-DIGITS achieves up to 50% relative improvements in individual-level correlation and 50-90% relative reductions in distributional discrepancy compared to uncalibrated baselines.
- 14 April 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSYN-DIGITS: A Synthetic Control Framework for Calibrated Digital Twin Simulation
AI-based persona simulation---often referred to as digital twin simulation---is increasingly used for market research, recommender systems, and social sciences. Despite their flexibility, large language models (LLMs) often exhibit systematic bias and miscalibration relative to real human behavior, limiting their reliability. Inspired by synthetic control methods from causal inference, we propose SYN-DIGITS (SYNthetic Control Framework for Calibrated DIGItal Twin Simulation), a principled and lightweight calibration framework that learns latent structure from digital-twin responses and transfers it to align predictions with human ground truth. SYN-DIGITS operates as a post-processing layer on top of any LLM-based simulator and thus is model-agnostic. We develop a latent factor model that formalizes when and why calibration succeeds through latent space alignment conditions, and we systematically evaluate ten calibration methods across thirteen persona constructions, three LLMs, and two datasets. SYN-DIGITS supports both individual-level and distributional simulation for previously unseen questions and unobserved populations, with provable error guarantees. Experiments show that SYN-DIGITS achieves up to 50% relative improvements in individual-level correlation and 50-90% relative reductions in distributional discrepancy compared to uncalibrated baselines.
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (6) , 3044-3064
A Stability Principle for Learning Under Nonstationarity
Adapting to a Changing Environment with Steady Decisions Most real-world decision making unfolds in changing environments. When yesterday’s data may no longer depict today, how much past data should guide future decision making? Use too little and you chase noise; use too much and you overlook new trends. In “A Stability Principle for Learning under Nonstationarity,” Huang and Wang propose a simple stability principle: keep adding past data until the bias it incurs exceeds the natural statistical noise. Their theory shows that the proposed approach can optimally adapt to unforeseeable changes in the environment for a broad spectrum of statistical learning and decision-making problems. At its core are a novel similarity measure for different decision-making objectives and a segmentation technique that breaks down the nonstationary data stream into quasistationary pieces. Simulations and real-data experiments spanning several nonstationarity patterns confirm the approach’s ability to make steady yet responsive decisions.
- 1 November 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 73 (6) , 3044-3064
A Stability Principle for Learning Under Nonstationarity
Adapting to a Changing Environment with Steady Decisions Most real-world decision making unfolds in changing environments. When yesterday’s data may no longer depict today, how much past data should guide future decision making? Use too little and you chase noise; use too much and you overlook new trends. In “A Stability Principle for Learning under Nonstationarity,” Huang and Wang propose a simple stability principle: keep adding past data until the bias it incurs exceeds the natural statistical noise. Their theory shows that the proposed approach can optimally adapt to unforeseeable changes in the environment for a broad spectrum of statistical learning and decision-making problems. At its core are a novel similarity measure for different decision-making objectives and a segmentation technique that breaks down the nonstationary data stream into quasistationary pieces. Simulations and real-data experiments spanning several nonstationarity patterns confirm the approach’s ability to make steady yet responsive decisions.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 3931-3946
Relaxation-Free Min-$k$-Partition for PCI Assignment in 5G Networks
Physical Cell Identity (PCI) is a critical parameter in 5G networks. Efficient and accurate PCI assignment is essential for mitigating mod-3 interference, mod-30 interference, collisions, and confusions among cells, which directly affect network reliability and user experience. In this paper, we propose a novel framework for PCI assignment by decomposing the problem into Min-3-Partition, Min-10-Partition, and a graph coloring problem, leveraging the Chinese Remainder Theorem (CRT). Furthermore, we develop a relaxation-free approach to the general Min-k-Partition problem by reformulating it as a quadratic program with a norm-equality constraint and solving it using a penalized mirror descent (PMD) algorithm. The proposed method demonstrates superior computational efficiency and scalability, significantly reducing interference while eliminating collisions and confusions in large-scale 5G networks. Numerical evaluations on real-world datasets show that our approach reduces computational time by up to 20 times compared to state-of-the-art methods, making it highly practical for real-time PCI optimization in large-scale networks. These results highlight the potential of our method to improve network performance and reduce deployment costs in modern 5G systems.
- 16 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 3931-3946
Relaxation-Free Min-$k$-Partition for PCI Assignment in 5G Networks
Physical Cell Identity (PCI) is a critical parameter in 5G networks. Efficient and accurate PCI assignment is essential for mitigating mod-3 interference, mod-30 interference, collisions, and confusions among cells, which directly affect network reliability and user experience. In this paper, we propose a novel framework for PCI assignment by decomposing the problem into Min-3-Partition, Min-10-Partition, and a graph coloring problem, leveraging the Chinese Remainder Theorem (CRT). Furthermore, we develop a relaxation-free approach to the general Min-k-Partition problem by reformulating it as a quadratic program with a norm-equality constraint and solving it using a penalized mirror descent (PMD) algorithm. The proposed method demonstrates superior computational efficiency and scalability, significantly reducing interference while eliminating collisions and confusions in large-scale 5G networks. Numerical evaluations on real-world datasets show that our approach reduces computational time by up to 20 times compared to state-of-the-art methods, making it highly practical for real-time PCI optimization in large-scale networks. These results highlight the potential of our method to improve network performance and reduce deployment costs in modern 5G systems.