Zhi Geng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zhi Geng has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
Xianchao Xie
School of Mathematical Sciences, LMAM, Peking University
3 shared publicationsHua Chen
School of Mathematical Sciences, Peking University, Beijing 100871, China
2 shared publications- Yangbo He
LMAM, School of Mathematical Sciences, LMEQF, and Center of Statistical Science, Peking University, Beijing, China
2 shared publications Chuan Ju
Peking University , Beijing , People’s Republic of China
1 shared publication- Dayue Chen
Peking University
1 shared publication - Hansheng Wang
Guanghua School of Management, Peking University, Beijing 100871, China
1 shared publication
Latest Publications
- 1 January 2017
- Published by Springer Nature in Behaviormetrika
- Vol. 44 (1) , 287-305
Structural learning of causal networks
- 1 January 2017
- Published by Springer Nature in Behaviormetrika
- Vol. 44 (1) , 287-305
Structural learning of causal networks
- Open Access
Causal Network Learning from Multiple Interventions of Unknown Manipulated Targets
In this paper, we discuss structure learning of causal networks from multiple data sets obtained by external intervention experiments where we do not know what variables are manipulated. For example, the conditions in these experiments are changed by changing temperature or using drugs, but we do not know what target variables are manipulated by the external interventions. From such data sets, the structure learning becomes more difficult. For this case, we first discuss the identifiability of causal structures. Next we present a graph-merging method for learning causal networks for the case that the sample sizes are large for these interventions. Then for the case that the sample sizes of these interventions are relatively small, we propose a data-pooling method for learning causal networks in which we pool all data sets of these interventions together for the learning. Further we propose a re-sampling approach to evaluate the edges of the causal network learned by the data-pooling method. Finally we illustrate the proposed learning methods by simulations.
Open AccessCausal Network Learning from Multiple Interventions of Unknown Manipulated Targets
In this paper, we discuss structure learning of causal networks from multiple data sets obtained by external intervention experiments where we do not know what variables are manipulated. For example, the conditions in these experiments are changed by changing temperature or using drugs, but we do not know what target variables are manipulated by the external interventions. From such data sets, the structure learning becomes more difficult. For this case, we first discuss the identifiability of causal structures. Next we present a graph-merging method for learning causal networks for the case that the sample sizes are large for these interventions. Then for the case that the sample sizes of these interventions are relatively small, we propose a data-pooling method for learning causal networks in which we pool all data sets of these interventions together for the learning. Further we propose a re-sampling approach to evaluate the edges of the causal network learned by the data-pooling method. Finally we illustrate the proposed learning methods by simulations.
- 15 October 2011
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 6 (6) , 1249-1263
Identifiability of causal effects on a binary outcome within principal strata
- 15 October 2011
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 6 (6) , 1249-1263
Identifiability of causal effects on a binary outcome within principal strata
- Open Access
- 12 October 2011
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 6 (6) , 1021-1024
Probability and statistics
- 12 October 2011
- Published by Springer Nature in Frontiers of Mathematics in China
- Vol. 6 (6) , 1021-1024
Open AccessProbability and statistics
- 16 February 2010
- Published by Oxford University Press (OUP) in Biometrika
- Vol. 97 (1) , 123-132
Sharp bounds on causal effects in case-control and cohort studies
Evaluating the causal effect of an exposure on a response from case-control and cohort studies is a major concern in epidemiological and medical research. Since causal effects are in general nonidentifiable from such studies, this paper derives bounds on two causal measures: the causal risk difference and the causal risk ratio. We use the potential response approach and a linear programming method to derive sharp bounds on the causal risk difference, and a novel fractional programming method to derive bounds on the causal risk ratio. In addition, in the presence of missing data, we consider three different missingness mechanisms and propose sharp bounds under these situations. The results provide new guidance on causal inference in case-control and cohort studies.
- 16 February 2010
- Published by Oxford University Press (OUP) in Biometrika
- Vol. 97 (1) , 123-132
Sharp bounds on causal effects in case-control and cohort studies
Evaluating the causal effect of an exposure on a response from case-control and cohort studies is a major concern in epidemiological and medical research. Since causal effects are in general nonidentifiable from such studies, this paper derives bounds on two causal measures: the causal risk difference and the causal risk ratio. We use the potential response approach and a linear programming method to derive sharp bounds on the causal risk difference, and a novel fractional programming method to derive bounds on the causal risk ratio. In addition, in the presence of missing data, we consider three different missingness mechanisms and propose sharp bounds under these situations. The results provide new guidance on causal inference in case-control and cohort studies.
- 1 January 2010
- Vol. 20, 469-479
NONPARAMETRIC COVARIANCE MODEL
There has been considerable attention on estimation of conditional variance function in the literature. We propose here a nonparametric model for conditional covariance matrix. A kernel estimator is developed accordingly, its asymptotic bias and variance are derived, and its asymptotic normality is established. A real data example is used to illustrate the proposed estimation procedure.
- 1 January 2010
- Vol. 20, 469-479
NONPARAMETRIC COVARIANCE MODEL
There has been considerable attention on estimation of conditional variance function in the literature. We propose here a nonparametric model for conditional covariance matrix. A kernel estimator is developed accordingly, its asymptotic bias and variance are derived, and its asymptotic normality is established. A real data example is used to illustrate the proposed estimation procedure.
- 1 January 2010
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 72 (1) , 129-142
Criteria for Surrogate end Points Based on Causal Distributions
Summary: When a treatment has a positive average causal effect (ACE) on an intermediate variable or surrogate end point which in turn has a positive ACE on a true end point, the treatment may have a negative ACE on the true end point due to the presence of unobserved confounders, which is called the surrogate paradox. A criterion for surrogate end points based on ACEs has recently been proposed to avoid the surrogate paradox. For a continuous or ordinal discrete end point, the distributional causal effect (DCE) may be a more appropriate measure for a causal effect than the ACE. We discuss criteria for surrogate end points based on DCEs. We show that commonly used models, such as generalized linear models and Cox’s proportional hazard models, can make the sign of the DCE of the treatment on the true end point determinable by the sign of the DCE of the treatment on the surrogate even if the models include unobserved confounders. Furthermore, for a general distribution without any assumption of parametric models, we give a sufficient condition for a distributionally consistent surrogate and prove that it is almost necessary.
- 1 January 2010
- Published by Oxford University Press (OUP) in Journal of the Royal Statistical Society Series B: Statistical Methodology
- Vol. 72 (1) , 129-142
Criteria for Surrogate end Points Based on Causal Distributions
Summary: When a treatment has a positive average causal effect (ACE) on an intermediate variable or surrogate end point which in turn has a positive ACE on a true end point, the treatment may have a negative ACE on the true end point due to the presence of unobserved confounders, which is called the surrogate paradox. A criterion for surrogate end points based on ACEs has recently been proposed to avoid the surrogate paradox. For a continuous or ordinal discrete end point, the distributional causal effect (DCE) may be a more appropriate measure for a causal effect than the ACE. We discuss criteria for surrogate end points based on DCEs. We show that commonly used models, such as generalized linear models and Cox’s proportional hazard models, can make the sign of the DCE of the treatment on the true end point determinable by the sign of the DCE of the treatment on the surrogate even if the models include unobserved confounders. Furthermore, for a general distribution without any assumption of parametric models, we give a sufficient condition for a distributionally consistent surrogate and prove that it is almost necessary.
- 27 April 2009
- Published by Wiley in Scandinavian Journal of Statistics
- Vol. 36 (2) , 185-203
Collapsibility for Directed Acyclic Graphs
Abstract. Collapsibility means that the same statistical result of interest can be obtained before and after marginalization over some variables. In this paper, we discuss three kinds of collapsibility for directed acyclic graphs (DAGs): estimate collapsibility, conditional independence collapsibility and model collapsibility. Related to collapsibility, we discuss removability of variables from a DAG. We present conditions for these three different kinds of collapsibility and relationships among them. We give algorithms to find a minimum variable set containing a variable subset of interest onto which a statistical result is collapsible.
- 27 April 2009
- Published by Wiley in Scandinavian Journal of Statistics
- Vol. 36 (2) , 185-203
Collapsibility for Directed Acyclic Graphs
Abstract. Collapsibility means that the same statistical result of interest can be obtained before and after marginalization over some variables. In this paper, we discuss three kinds of collapsibility for directed acyclic graphs (DAGs): estimate collapsibility, conditional independence collapsibility and model collapsibility. Related to collapsibility, we discuss removability of variables from a DAG. We present conditions for these three different kinds of collapsibility and relationships among them. We give algorithms to find a minimum variable set containing a variable subset of interest onto which a statistical result is collapsible.
- 1 December 2008
- Vol. 9, 2847-2880
Structural Learning of Chain Graphs via Decomposition
Chain graphs present a broad class of graphical models for description of conditional independence structures, including both Markov networks and Bayesian networks as special cases. In this paper, we propose a computationally feasible method for the structural learning of chain graphs based on the idea of decomposing the learning problem into a set of smaller scale problems on its decomposed subgraphs. The decomposition requires conditional independencies but does not require the separators to be complete subgraphs. Algorithms for both skeleton recovery and complex arrow orientation are presented. Simulations under a variety of settings demonstrate the competitive performance of our method, especially when the underlying graph is sparse.
- 1 December 2008
- Vol. 9, 2847-2880
Structural Learning of Chain Graphs via Decomposition
Chain graphs present a broad class of graphical models for description of conditional independence structures, including both Markov networks and Bayesian networks as special cases. In this paper, we propose a computationally feasible method for the structural learning of chain graphs based on the idea of decomposing the learning problem into a set of smaller scale problems on its decomposed subgraphs. The decomposition requires conditional independencies but does not require the separators to be complete subgraphs. Algorithms for both skeleton recovery and complex arrow orientation are presented. Simulations under a variety of settings demonstrate the competitive performance of our method, especially when the underlying graph is sparse.
- 2 July 2008
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 139 (3) , 1073-1081
Detecting multiple confounders
- 2 July 2008
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 139 (3) , 1073-1081
Detecting multiple confounders