Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chengpiao Huang

dblp:359/5910 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Trustworthy machine learning · 44% Learning theory · 27% Language models and text generation · 15%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › uncertainty estimation
conformal prediction
0.912025
Uncertainty Quantification for LLM-Based Survey Simulations · ICML 2025
Machine learning › Trustworthy machine learning
uncertainty estimation
0.912025
Uncertainty Quantification for LLM-Based Survey Simulations · ICML 2025
Machine learning › Learning theory
generalization error
0.812024
Model Assessment and Selection under Temporal Distribution Shift · ICML 2024
Machine learning › Trustworthy machine learning › robustness evaluation
model evaluation under distribution shift
0.812024
Model Assessment and Selection under Temporal Distribution Shift · ICML 2024
Machine learning › Learning theory
model selection
0.812024
Model Assessment and Selection under Temporal Distribution Shift · ICML 2024
Machine learning › Transfer learning and domain adaptation › domain shift
temporal distribution shift
0.812024
Model Assessment and Selection under Temporal Distribution Shift · ICML 2024
Computational social science and digital humanities
survey simulation
0.312025
Uncertainty Quantification for LLM-Based Survey Simulations · ICML 2025

Methods — techniques the papers use, named apart from their topics

conformal prediction · 1.7adaptive sample size selection · 1.7single-elimination tournament · 0.8adaptive rolling window · 0.8
YearPublicationVenuePosition
2025 Uncertainty Quantification for LLM-Based Survey Simulations
abstract
We investigate the use of large language models (LLMs) to simulate human responses to survey questions, and perform uncertainty quantification to gain reliable insights. Our approach converts imperfect, LLM-simulated responses into confidence sets for population parameters of human responses, addressing the distribution shift between the simulated and real populations. A key innovation lies in determining the optimal number of simulated responses: too many produce overly narrow confidence sets with poor coverage, while too few yield excessively loose estimates. To resolve this, our method adaptively selects the simulation sample size, ensuring valid average-case coverage guarantees. It is broadly applicable to any LLM, irrespective of its fidelity, and any procedure for constructing confidence sets. Additionally, the selected sample size quantifies the degree of misalignment between the LLM and the target human population. We illustrate our method on real datasets and LLMs.
Chengpiao Huang
ICML1
2024 Model Assessment and Selection under Temporal Distribution Shift
abstract
We investigate model assessment and selection in a changing environment, by synthesizing datasets from both the current time period and historical epochs. To tackle unknown and potentially arbitrary temporal distribution shift, we develop an adaptive rolling window approach to estimate the generalization error of a given model. This strategy also facilitates the comparison between any two candidate models by estimating the difference of their generalization errors. We further integrate pairwise comparisons into a single-elimination tournament, achieving near-optimal model selection from a collection of candidates. Theoretical analyses and empirical experiments underscore the adaptivity of our proposed methods to the non-stationarity in data.
Elise Han, Chengpiao Huang
ICML2