YZYuchen Zheng

Yuchen Zheng

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yuchen Zheng has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On designing of a low leakage patient-centric provider network

    by Yuchen Zheng, Kun Lin, Thomas White, Jeremy Pickreign, Gigi Yuen-Reed

    When a patient in a provider network seeks services outside of their community, the community experiences a leakage. Leakage is undesirable as it typically leads to higher out-of-network cost for patient and increases barrier for care coordination, which is particularly problematic for Accountable Care Organization (ACO) as the in-network providers are financially responsible for quality of care and outcome. We aim to design a data-driven method to identify naturally occurring provider networks driven by diabetic patient choices, and understand the relationship among provider composition, patient composition, and service leakage pattern. By doing so, we learn the features of low service leakage provider networks that can be generalized to different patient population. Data used for this study include de-identified healthcare insurance administrative data acquired from Capital District Physicians’ Health Plan (CDPHP) for diabetic patients who resided in four New York state counties (Albany, Rensselaer, Saratoga, and Schenectady) in 2014. We construct a healthcare provider network based on patients’ historical medical insurance claims. A community detection algorithm is used to identify naturally occurring communities of collaborating providers. For each detected community, a profile is built using several new key measures to elucidate stakeholders of our findings. Finally, import-export analysis is conducted to benchmark their leakage pattern and identify further leakage reduction opportunity. The design yields six major provider communities with diverse profiles. Some communities are geographically concentrated, while others tend to draw patients with certain diabetic co-morbidities. Providers from the same healthcare institution are likely to be assigned to the same community. While most communities have high within-community utilization and spending, at 85% and 86% respectively, leakage still persists. Hence, we utilize a metric from import-export analysis to detect leakage, gaining insight on how to minimize leakage. We identify patient-driven provider organization by surfacing providers who share a large number of patients. By analyzing the import-export behavior of each identified community using a novel approach and profiling community patient and provider composition we understand the key features of having a balanced number of PCP and specialists and provider heterogeneity.


  • Open Access

    Variable Partitioning for Distributed Optimization

    by Yuchen Zheng, Ilbin Lee, Nicoleta Serban

    This paper is about how to partition decision variables while decomposing a large-scale optimization problem for the best performance of distributed solution methods. Solving a large-scale optimization problem sequen- tially can be computationally challenging. One classic approach is to decompose the problem into smaller sub-problems and solve them in a distributed fashion. However, there is little discussion in the literature on which variables should be grouped together to form the sub-problems, especially when the optimization formulation involves complex constraints. We focus on one of the most popular distributed approaches, dual decomposition and distributed sub-gradient methods. Based on a theoretical guarantee on its convergence rate, we explain that a partition of variables can critically affect the speed of convergence and highlight the importance of the number of dualized constraints. Then, we introduce a novel approach to find a partition that reduces the number of dualized constraints by utilizing a community detection algorithm from physics literature. Roughly speaking, the proposed method groups decision variables that appear together in con- straints and solves the resulting sub-problems with blocks of variables in parallel. Empirical experiments on a real application show that the proposed method significantly accelerates the convergence of the distributed sub-gradient method. The advantage of our approach becomes more significant as the size of the problem increases and each constraint involves more variables.