Yevgeniy Vorobeychik

Prof. Yevgeniy Vorobeychik

Computer Science and Engineering, Washington University in St. Louis, St. Louis, MO 63130, USA

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2017 in Artificial Intelligence Review
Verified
Journal Article
Closed access
PDF file
HZHaifeng Zhang
Haifeng Zhang
YVYevgeniy Vorobeychik
Yevgeniy Vorobeychik

9 August 2010 in Proceedings of the National Academy of Sciences
Verified
Journal Article
Open access
PDF file
SJStephen Judd
Stephen Judd
MKMichael Kearns
Michael Kearns
YVYevgeniy Vorobeychik
Yevgeniy Vorobeychik
We report on human-subject experiments on the problems of coloring (a social differentiation task) and consensus (a social agreement task) in a networked setting. Both tasks can be viewed as coordination games, and despite their cognitive similarity, we find that within a parameterized family of social networks, network structure elicits opposing behavioral effects in the two problems, with increased long-distance connectivity making consensus easier for subjects and coloring harder. We investigate the influence that subjects have on their network neighbors and the collective outcome, and find that it varies considerably, beyond what can be explained by network position alone. We also find strong correlations between influence and other features of individual subject behavior. In contrast to much of the recent research in network science, which often emphasizes network topology out of the context of any specific problem and places primacy on network position, our findings highlight the potential importance of the details of tasks and individuals in social networks.

25 January 2016 in Autonomous Agents and Multi-Agent Systems
Verified
Journal Article
Closed access
PDF file
HZHaifeng Zhang
Haifeng Zhang
YVYevgeniy Vorobeychik
Yevgeniy Vorobeychik
JLJoshua Letchford
Joshua Letchford
KLKiran Lakkaraju
Kiran Lakkaraju

8 March 2025 in Journal of the American Medical Informatics Association
Verified
Journal Article
Open access
KBKatherine E Brown
Katherine E Brown
CYChao Yan
Chao Yan
ZLZhuohang Li
Zhuohang Li
XZXinmeng Zhang
Xinmeng Zhang
BCBenjamin X Collins
Benjamin X Collins
BMBradley A Malin
Bradley A Malin
Objectives: To determine the extent to which current large language models (LLMs) can serve as substitutes for traditional machine learning (ML) as clinical predictors using data from electronic health records (EHRs), we investigated various factors that can impact their adoption, including overall performance, calibration, fairness, and resilience to privacy protections that reduce data fidelity. Materials and Methods: We evaluated GPT-3.5, GPT-4, and traditional ML (as gradient-boosting trees) on clinical prediction tasks in EHR data from Vanderbilt University Medical Center (VUMC) and MIMIC IV. We measured predictive performance with area under the receiver operating characteristic (AUROC) and model calibration using Brier Score. To evaluate the impact of data privacy protections, we assessed AUROC when demographic variables are generalized. We evaluated algorithmic fairness using equalized odds and statistical parity across race, sex, and age of patients. We also considered the impact of using in-context learning by incorporating labeled examples within the prompt. Results: Traditional ML [AUROC: 0.847, 0.894 (VUMC, MIMIC)] substantially outperformed GPT-3.5 (AUROC: 0.537, 0.517) and GPT-4 (AUROC: 0.629, 0.602) (with and without in-context learning) in predictive performance and output probability calibration [Brier Score (ML vs GPT-3.5 vs GPT-4): 0.134 vs 0.384 vs 0.251, 0.042 vs 0.06 vs 0.219)]. Discussion: Traditional ML is more robust than GPT-3.5 and GPT-4 in generalizing demographic information to protect privacy. GPT-4 is the fairest model according to our selected metrics but at the cost of poor model performance. Conclusion: These findings suggest that non-fine-tuned LLMs are less effective and robust than locally trained ML for clinical prediction tasks, but they are improving across releases.

30 January 2007 in Machine Learning
Verified
Journal Article
Closed access
PDF file
YVYevgeniy Vorobeychik
Yevgeniy Vorobeychik
MWMichael Wellman
Michael Wellman
SSSatinder Singh
Satinder Singh

25 March 2015 in PLOS ONE
Verified
Journal Article
Open access
PDF file
ZWZhiyu Wan
Zhiyu Wan
YVYevgeniy Vorobeychik
Yevgeniy Vorobeychik
WXWeiyi Xia
Weiyi Xia
ECEllen Wright Clayton
Ellen Wright Clayton
MKMurat Kantarcioglu
Murat Kantarcioglu
BMBradley A. Malin
Bradley A. Malin
Given the potential wealth of insights in personal data the big databases can provide, many organizations aim to share data while protecting privacy by sharing de-identified data, but are concerned because various demonstrations show such data can be re-identified. Yet these investigations focus on how attacks can be perpetrated, not the likelihood they will be realized. This paper introduces a game theoretic framework that enables a publisher to balance re-identification risk with the value of sharing data, leveraging a natural assumption that a recipient only attempts re-identification if its potential gains outweigh the costs. We apply the framework to a real case study, where the value of the data to the publisher is the actual grant funding dollar amounts from a national sponsor and the re-identification gain of the recipient is the fine paid to a regulator for violation of federal privacy rules. There are three notable findings: 1) it is possible to achieve zero risk, in that the recipient never gains from re-identification, while sharing almost as much data as the optimal solution that allows for a small amount of risk; 2) the zero-risk solution enables sharing much more data than a commonly invoked de-identification policy of the U.S. Health Insurance Portability and Accountability Act (HIPAA); and 3) a sensitivity analysis demonstrates these findings are robust to order-of-magnitude changes in player losses and gains. In combination, these findings provide support that such a framework can enable pragmatic policy decisions about de-identified data sharing.