Jinzhou Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jinzhou Li has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
Marloes H Maathuis
Seminar for Statistics , ETH Zurich
2 shared publicationsMarloes H. Maathuis
Seminar für Statistik, ETH Zürich, Zürich, Switzerland
2 shared publications- Benjamin B. Chu
Affiliation Department of Biomedical Data Science, Stanford University, Stanford, California, United States of America
1 shared publication - Chang Wei
Nanyang Normal University, China
1 shared publication Chaonan Xu
College of Fisheries and Life Science, Dalian Ocean University, Dalian 116023, China
1 shared publicationDavid Deuber
Seminar für Statistik, ETH Zürich, Zürich, Switzerland
1 shared publication
Latest Publications
- 16 October 2025
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 88 (3) , 779-798
Root cause discovery via permutations and Cholesky decomposition
This work is motivated by the following problem: Can we identify the disease-causing gene in a patient affected by a monogenic disorder? This problem is an instance of root cause discovery. Specifically, we aim to identify the intervened variable in one interventional sample using a set of observational samples as reference. We consider a linear structural equation model where the causal ordering is unknown. We begin by examining a simple method that uses squared z-scores and characterize the conditions under which this method succeeds and fails, showing it generally cannot identify the root cause. We then prove, without additional assumptions, that the root cause is identifiable even if the causal ordering is not. Two key ingredients of this identifiability result are the use of permutations and the Cholesky decomposition, which allow us to exploit an invariant property across different permutations to discover the root cause. Furthermore, we characterize permutations that yield the correct root cause and, based on this, propose a valid method for root cause discovery. We also adapt this approach to high-dimensional settings. Finally, we evaluate our methods through simulations and apply the high-dimensional method to discover disease-causing genes in the gene expression dataset that motivates this work.
- 16 October 2025
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 88 (3) , 779-798
Root cause discovery via permutations and Cholesky decomposition
This work is motivated by the following problem: Can we identify the disease-causing gene in a patient affected by a monogenic disorder? This problem is an instance of root cause discovery. Specifically, we aim to identify the intervened variable in one interventional sample using a set of observational samples as reference. We consider a linear structural equation model where the causal ordering is unknown. We begin by examining a simple method that uses squared z-scores and characterize the conditions under which this method succeeds and fails, showing it generally cannot identify the root cause. We then prove, without additional assumptions, that the root cause is identifiable even if the causal ordering is not. Two key ingredients of this identifiability result are the use of permutations and the Cholesky decomposition, which allow us to exploit an invariant property across different permutations to discover the root cause. Furthermore, we characterize permutations that yield the correct root cause and, based on this, propose a valid method for root cause discovery. We also adapt this approach to high-dimensional settings. Finally, we evaluate our methods through simulations and apply the high-dimensional method to discover disease-causing genes in the gene expression dataset that motivates this work.
- 4 March 2024
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 86 (4) , 966-986
Simultaneous false discovery proportion bounds via knockoffs and closed testing
We propose new methods to obtain simultaneous false discovery proportion bounds for knockoff-based approaches. We first investigate an approach based on Janson and Su’s k-familywise error rate control method and interpolation. We then generalize it by considering a collection of k values, and show that the bound of Katsevich and Ramdas is a special case of this method and can be uniformly improved. Next, we further generalize the method by using closed testing with a multi-weighted-sum local test statistic. This allows us to obtain a further uniform improvement and other generalizations over previous methods. We also develop an efficient shortcut for its implementation. We compare the performance of our proposed methods in simulations and apply them to a data set from the UK Biobank.
- 4 March 2024
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 86 (4) , 966-986
Simultaneous false discovery proportion bounds via knockoffs and closed testing
We propose new methods to obtain simultaneous false discovery proportion bounds for knockoff-based approaches. We first investigate an approach based on Janson and Su’s k-familywise error rate control method and interpolation. We then generalize it by considering a collection of k values, and show that the bound of Katsevich and Ramdas is a special case of this method and can be uniformly improved. Next, we further generalize the method by using closed testing with a multi-weighted-sum local test statistic. This allows us to obtain a further uniform improvement and other generalizations over previous methods. We also develop an efficient shortcut for its implementation. We compare the performance of our proposed methods in simulations and apply them to a data set from the UK Biobank.
- 1 December 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12940, 67-753
A modified consensus-based grouping algorithm for multi-agent task allocation in saturation attack scenarios
This paper addresses the decentralized simultaneous multi-agent task allocation problem in saturation attack scenarios. This problem arises when multiple agents have to cooperate simultaneously to perform complex and dangerous tasks that may result in their malfunction or damage. A modified consensus-based grouping algorithm with virtual tasks (CBGA-VT) is proposed that considers time windows, different types of tasks, and destroyed agents after performing certain tasks. Virtual tasks are introduced to address the decreased agents problem and the scoring scheme is improved to achieve better performance. Simulation results demonstrate that CBGA-VT can effectively solve the multi-agent simultaneous task allocation considering destroyed agents in saturation attack scenarios.
- 1 December 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12940, 67-753
A modified consensus-based grouping algorithm for multi-agent task allocation in saturation attack scenarios
This paper addresses the decentralized simultaneous multi-agent task allocation problem in saturation attack scenarios. This problem arises when multiple agents have to cooperate simultaneously to perform complex and dangerous tasks that may result in their malfunction or damage. A modified consensus-based grouping algorithm with virtual tasks (CBGA-VT) is proposed that considers time windows, different types of tasks, and destroyed agents after performing certain tasks. Virtual tasks are introduced to address the decreased agents problem and the scoring scheme is improved to achieve better performance. Simulation results demonstrate that CBGA-VT can effectively solve the multi-agent simultaneous task allocation considering destroyed agents in saturation attack scenarios.
- 3 October 2023
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 119 (547) , 2206-2216
Estimation and Inference of Extremal Quantile Treatment Effects for Heavy-Tailed Distributions
- 3 October 2023
- Published by Taylor & Francis in Journal of the American Statistical Association
- Vol. 119 (547) , 2206-2216
Estimation and Inference of Extremal Quantile Treatment Effects for Heavy-Tailed Distributions
- 19 September 2022
- Published by Elsevier in Aquaculture
- Vol. 562, 738854
Investigation of the latency of Cyprinid herpesvirus 2 in apparently healthy farmed gibel carp, Carassius auratus gibelio
- 19 September 2022
- Published by Elsevier in Aquaculture
- Vol. 562, 738854
Investigation of the latency of Cyprinid herpesvirus 2 in apparently healthy farmed gibel carp, Carassius auratus gibelio
- 1 July 2021
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 83 (3) , 534-558
GGM Knockoff Filter: False Discovery Rate Control for Gaussian Graphical Models
We propose a new method to learn the structure of a Gaussian graphical model with finite sample false discovery rate control. Our method builds on the knockoff framework of Barber and Candès for linear models. We extend their approach to the graphical model setting by using a local (node-based) and a global (graph-based) step: we construct knockoffs and feature statistics for each node locally, and then solve a global optimization problem to determine a threshold for each node. We then estimate the neighbourhood of each node, by comparing its feature statistics to its threshold, resulting in our graph estimate. Our proposed method is very flexible, in the sense that there is freedom in the choice of knockoffs, feature statistics and the way in which the final graph estimate is obtained. For any given data set, it is not clear a priori what choices of these hyperparameters are optimal. We therefore use a sample-splitting-recycling procedure that first uses half of the samples to select the hyperparameters, and then learns the graph using all samples, in such a way that the finite sample FDR control still holds. We compare our method to several competitors in simulations and on a real data set.
- 1 July 2021
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 83 (3) , 534-558
GGM Knockoff Filter: False Discovery Rate Control for Gaussian Graphical Models
We propose a new method to learn the structure of a Gaussian graphical model with finite sample false discovery rate control. Our method builds on the knockoff framework of Barber and Candès for linear models. We extend their approach to the graphical model setting by using a local (node-based) and a global (graph-based) step: we construct knockoffs and feature statistics for each node locally, and then solve a global optimization problem to determine a threshold for each node. We then estimate the neighbourhood of each node, by comparing its feature statistics to its threshold, resulting in our graph estimate. Our proposed method is very flexible, in the sense that there is freedom in the choice of knockoffs, feature statistics and the way in which the final graph estimate is obtained. For any given data set, it is not clear a priori what choices of these hyperparameters are optimal. We therefore use a sample-splitting-recycling procedure that first uses half of the samples to select the hyperparameters, and then learns the graph using all samples, in such a way that the finite sample FDR control still holds. We compare our method to several competitors in simulations and on a real data set.