arXiv subjects

Zhongyuan Chen

Publications and source records attributed to Zhongyuan Chen.

4 recordsLinked to original sources

arXiv2026

ShadowProbe: Language-Extensible Detection of Hidden Algorithmic Complexity Vulnerabilities

Algorithmic Complexity Vulnerabilities (ACVs) arise when adversarial inputs trigger worst-case execution behavior, causing severe performance degradation or Denial-of-Service conditions. A key but underexplored source is shadow complexity: non-trivial computational costs hidden inside seemingly benign standard library APIs. Because these costs are invisible at call sites, attackers can exploit them to induce unexpected superlinear runtime behavior. Existing ACV detectors often rely on fuzzing, symbolic execution, or hybrid analysis, but they are usually language-specific, require substantial manual effort to construct harnesses, and depend on heavy runtime instrumentation. We present ShadowProbe, a scalable and language-extensible framework for discovering ACVs through lightweight static analysis, automated reconstruction of execution contexts, and Large Language Model (LLM) assisted test generation. ShadowProbe uses a structured multi-stage pipeline: it statically screens for candidate functions guided by shadow-complexity signals, reconstructs minimal executable contexts from project-level symbols, and synthesizes size-controlled inputs to probe worst-case behavior. It then validates candidates using execution-time measurements and robust statistical growth inference, separating true algorithmic blowups from runtime noise such as garbage collection and JIT compilation effects. We evaluate ShadowProbe on the WISE benchmark, where it consistently improves analysis efficiency over existing approaches. We further apply it to large-scale systems including CPython, the JDK, Zig, Rustc, and vLLM, uncovering many previously unknown ACVs, many of which have been confirmed and partially remediated by maintainers. These results show that ShadowProbe can identify hidden algorithmic risks across diverse real-world codebases.

cs.CR↗

arXiv2026

Data-adaptive gene and pathway-based tests forrare-variant associations with survival outcomes

Statistical methods for testing aggregate rare-variant genetic associations are typically based on either burden or dispersion tests (or a combination of the two). These methods lack statistical power in the presence of diverse genetic architectures. Moreover, few aggregate rare-variant association methods have been developed specifically for survival data. To address these issues, we propose data-adaptive gene- and pathway-based association tests based on Schoenfeld residuals in Cox proportional hazards models for association studies between an aggregate of rare-variants and survival outcomes. Our methods improve statistical power while maintaining flexibility across various genetic effect sizes and directions. We develop an efficient R package that enables fast computation and supports data simulation as well as gene- and pathway-level testing. Applying our approach to late bladder toxicity following radiotherapy for non-metastatic prostate cancer, we identify biologically relevant genes and pathways, replicate known signals, and capture additional associations. Our method provides a powerful, adaptive framework for survival-based genetic association studies of rare-variants. Keywords: aSPU, time-to-event outcomes, rare-variant associations, Cox regression, Schoenfeld residuals

stat.ME↗

arXiv2022

Estimating heterogeneous treatment effects versus building individualized treatment rules: Connection and disconnection

Estimating heterogeneous treatment effects is a well-studied topic in the statistics literature. More recently, it has regained attention due to an increasing need for precision medicine as well as the increased use of state-of-art machine learning methods in the estimation. Furthermore, estimating heterogeneous treatment effects is directly related to building an individualized treatment rule, which is a decision rule of treatment according to patient characteristics. This paper examines the connection and disconnection between these two research problems. Notably, a better estimation of the heterogeneous treatment effects may or may not lead to a better individualized treatment rule. We provide theoretical frameworks to explain the connection and disconnection and demonstrate two different scenarios through simulations. Our conclusion sheds light on a practical guide that under certain circumstances, there is no need to enhance estimation of the treatment effects, as it does not alter the treatment decision.

stat.ME↗

arXiv2022

Data-guided Treatment Recommendation with Feature Scores

Despite the availability of large amounts of genomics data, medical treatment recommendations have not successfully used them. In this paper, we consider the utility of high dimensional genomic-clinical data and nonparametric methods for making cancer treatment recommendations. This builds upon the framework of the individualized treatment rule [Qian and Murphy 2011] but we aim to overcome their method's limitations, specifically in the instances when the method encounters a large number of covariates and an issue of model misspecification. We tackle this problem using a dimension reduction method, namely Sliced Inverse Regression (SIR, [Li 1991]), with a rich class of models for the treatment response. Notably, SIR defines a feature space for high-dimensional data, offering an advantage similar to those found in the popular neural network models. With the features obtained from SIR, a simple visualization is used to compare different treatment options and present the recommended treatment. Additionally, we derive the consistency and the convergence rate of the proposed recommendation approach through a value function. The effectiveness of the proposed approach is demonstrated through simulation studies and the promising results from a real-data example of the treatment of multiple myeloma.

stat.ME↗