Sae-Hwan Park

dblp:343/8719 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
0000-0001-5297-5502ORCID · reported

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

Artificial intelligence and machine learning · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 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 · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
strategic behavior
1.622025
Disentangling misreporting from genuine adaptation in strategic settings: a causal approach · NeurIPS 2025
Who's Gaming the System? A Causally-Motivated Approach for Detecting Strategic Adaptation · NeurIPS 2024
Machine learning › Trustworthy machine learning › fairness
causal fairness
0.912025
Disentangling misreporting from genuine adaptation in strategic settings: a causal approach · NeurIPS 2025
Machine learning › Trustworthy machine learning
fairness
0.912025
Disentangling misreporting from genuine adaptation in strategic settings: a causal approach · NeurIPS 2025
Machine learning › Trustworthy machine learning › performative prediction
strategic classification
0.912025
Disentangling misreporting from genuine adaptation in strategic settings: a causal approach · NeurIPS 2025
Computational social science and digital humanities
algorithmic decision-making
0.912025
Disentangling misreporting from genuine adaptation in strategic settings: a causal approach · NeurIPS 2025

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

identifiability analysis · 2.5causal inference · 1.7causal effect estimation · 0.8
YearPublicationVenuePosition
2026 Optimizing temporal windows for wearable-augmented post-discharge risk prediction: a methods study
abstract
OBJECTIVE: Traditional readmission risk models relying on static discharge data have limited predictive performance and fail to capture patients' recovery trajectories after hospitalization. We sought to identify optimal modeling parameters for dynamically predicting readmission risk using post-discharge step-count data from remote monitoring devices. METHODS: We combined data for adults aged 55+ from 2 studies that collected longitudinal activity data after discharge. We constructed a patient-day dataset incorporating static demographic and clinical variables and dynamic activity features aggregated over retrospective windows of 3, 5, 7, or 10 days. Models predicted readmission or death over prospective horizons of 3, 5, 7, or 10 days, within follow-up periods of 30-180 days. Logistic regression and LightGBM models were trained using 5-fold cross-validation on an 80:20 patient-level split. RESULTS: Among 215 participants, LightGBM outperformed logistic regression across all configurations (mean AUC 0.82 vs 0.76). Performance improved with longer prospective horizons but was insensitive to retrospective window length. The LightGBM model was well-calibrated (Hosmer-Lemeshow χ2 = 2.46, P = .96), whereas logistic regression showed miscalibration (χ2 = 51.8, P < .001). In feature-importance analyses, LightGBM ranked static (length of stay, vitals, BMI) and activity (recent steps, distance) features highly, whereas logistic regression emphasized activity variables. DISCUSSION: Prediction performance was impacted by horizon length and training window, with minimal effect of retrospective window. LightGBM achieved better discrimination and calibration, supporting flexible, non-parametric methods for post-discharge risk prediction. CONCLUSION: Post-discharge step count data enhance dynamic readmission risk prediction. Optimizing temporal windows and model type improves discrimination and calibration.
Eric Bressman, Sae-Hwan Park, S. Ryan Greysen
J. Am. Medical Informatics Assoc.2
2025 Disentangling misreporting from genuine adaptation in strategic settings: a causal approach
abstract
In settings where ML models are used to inform the allocation of resources, agents affected by the allocation decisions might have an incentive to strategically change their features to secure better outcomes. While prior work has studied strategic responses broadly, disentangling misreporting from genuine adaptation remains a fundamental challenge. In this paper, we propose a causally-motivated approach to identify and quantify how much an agent misreports on average by distinguishing deceptive changes in their features from genuine adaptation. Our key insight is that, unlike genuine adaptation, misreported features do not causally affect downstream variables (i.e., causal descendants). We exploit this asymmetry by comparing the causal effect of misreported features on their causal descendants as derived from manipulated datasets against those from unmanipulated datasets. We formally prove identifiability of the misreporting rate and characterize the variance of our estimator. We empirically validate our theoretical results using a semi-synthetic and real Medicare dataset with misreported data, demonstrating that our approach can be employed to identify misreporting in real-world scenarios.
Dylan Zapzalka, Trenton Chang, Lindsay A. Warrenburg, Sae-Hwan Park, Daniel K. Shenfeld, Ravi B. Parikh, Jenna Wiens, Maggie Makar
NeurIPS4
2024 Who's Gaming the System? A Causally-Motivated Approach for Detecting Strategic Adaptation
abstract
In many settings, machine learning models may be used to inform decisions that impact individuals or entities who interact with the model. Such entities, or *agents,* may *game* model decisions by manipulating their inputs to the model to obtain better outcomes and maximize some utility. We consider a multi-agent setting where the goal is to identify the “worst offenders:” agents that are gaming most aggressively. However, identifying such agents is difficult without knowledge of their utility function. Thus, we introduce a framework in which each agent’s tendency to game is parameterized via a scalar. We show that this gaming parameter is only partially identifiable. By recasting the problem as a causal effect estimation problem where different agents represent different “treatments,” we prove that a ranking of all agents by their gaming parameters is identifiable. We present empirical results in a synthetic data study validating the usage of causal effect estimation for gaming detection and show in a case study of diagnosis coding behavior in the U.S. that our approach highlights features associated with gaming.
Trenton Chang, Lindsay A. Warrenburg, Sae-Hwan Park, Ravi B. Parikh, Maggie Makar, Jenna Wiens
NeurIPS3