Jianhua Guo
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
Research Subjects
Jianhua Guo has a total of 115 co-authors. Here are the top co-authors by number of shared publications:
- Shurong Zheng
School of Mathematics and Statistics and KLAS, Northeast Normal University, Changchun, China
5 shared publications Wensheng Zhu
Key Laboratory for Applied Statistics of MOE and School of Mathematics and Statistics, Northeast Normal University Changchun Jilin 130024 China
4 shared publications- Xuming He
Department of Statistics and Data Science, Washington University in St. Louis
4 shared publications Benchong Li
Key Laboratory for Applied Statistics of MOE and School of Mathematics and Statistics, Northeast Normal University, Changchun, China
3 shared publications- Bing-Yi Jing
Department of Statistics and Data Science, Southern University of Science and Technology, Shenzhen, China
3 shared publications Binghui Liu
3 shared publications
Latest Publications
- 19 August 2026
- Published by Springer Nature in Statistical Papers
- Vol. 67 (5) , 114
Quasi maximum likelihood estimation of high-dimensional heteroskedastic and approximate factor models
- 19 August 2026
- Published by Springer Nature in Statistical Papers
- Vol. 67 (5) , 114
Quasi maximum likelihood estimation of high-dimensional heteroskedastic and approximate factor models
- 13 April 2026
- Published by Oxford University Press (OUP) in Biometrika
- Vol. 113 (3)
Revisiting Madigan and Mosurski: collapsibility via minimal separators
Collapsibility provides a principled approach to dimension reduction in contingency tables and graphical models. Madigan & Mosurski (1990) pioneered the study of minimal collapsible sets in decomposable models, but existing algorithms for general graphs remain computationally demanding. We show that a model is collapsible on to a target set precisely when that set contains at least one minimal separator between its nonadjacent vertices. This insight motivates the close minimal separator absorption algorithm, which constructs minimal collapsible sets using only local separator searches at very low costs. Simulations confirm substantial efficiency gains, making collapsibility analysis practical in high-dimensional settings.
- 13 April 2026
- Published by Oxford University Press (OUP) in Biometrika
- Vol. 113 (3)
Revisiting Madigan and Mosurski: collapsibility via minimal separators
Collapsibility provides a principled approach to dimension reduction in contingency tables and graphical models. Madigan & Mosurski (1990) pioneered the study of minimal collapsible sets in decomposable models, but existing algorithms for general graphs remain computationally demanding. We show that a model is collapsible on to a target set precisely when that set contains at least one minimal separator between its nonadjacent vertices. This insight motivates the close minimal separator absorption algorithm, which constructs minimal collapsible sets using only local separator searches at very low costs. Simulations confirm substantial efficiency gains, making collapsibility analysis practical in high-dimensional settings.
- 19 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
Dual adaptive graph laplacian regularization for high-fidelity hyperspectral image fusion
- 19 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
Dual adaptive graph laplacian regularization for high-fidelity hyperspectral image fusion
- 12 February 2026
- Published by Elsevier in Artificial Intelligence
- Vol. 353
Learning semi-parametric tree models from mixed data
- 12 February 2026
- Published by Elsevier in Artificial Intelligence
- Vol. 353
Learning semi-parametric tree models from mixed data
- Open Access
Structural Dimension Reduction in Bayesian Networks
This work introduces a novel technique, named structural dimension reduction, to collapse a Bayesian network onto a minimum and localized one while ensuring that probabilistic inferences between the original and reduced networks remain consistent. To this end, we propose a new combinatorial structure in directed acyclic graphs called the directed convex hull, which has turned out to be equivalent to their minimum localized Bayesian networks. An efficient polynomial-time algorithm is devised to identify them by determining the unique directed convex hulls containing the variables of interest from the original networks. Experiments demonstrate that the proposed technique has high dimension reduction capability in real networks, and the efficiency of probabilistic inference based on directed convex hulls can be significantly improved compared with traditional methods such as variable elimination and belief propagation algorithms. The code of this study is open at \href{https://github.com/Balance-H/Algorithms}{https://github.com/Balance-H/Algorithms} and the proofs of the results in the main body are postponed to the appendix.
Open AccessStructural Dimension Reduction in Bayesian Networks
This work introduces a novel technique, named structural dimension reduction, to collapse a Bayesian network onto a minimum and localized one while ensuring that probabilistic inferences between the original and reduced networks remain consistent. To this end, we propose a new combinatorial structure in directed acyclic graphs called the directed convex hull, which has turned out to be equivalent to their minimum localized Bayesian networks. An efficient polynomial-time algorithm is devised to identify them by determining the unique directed convex hulls containing the variables of interest from the original networks. Experiments demonstrate that the proposed technique has high dimension reduction capability in real networks, and the efficiency of probabilistic inference based on directed convex hulls can be significantly improved compared with traditional methods such as variable elimination and belief propagation algorithms. The code of this study is open at \href{https://github.com/Balance-H/Algorithms}{https://github.com/Balance-H/Algorithms} and the proofs of the results in the main body are postponed to the appendix.
- 10 August 2025
- Published by Wiley in Scandinavian Journal of Statistics
- Vol. 52 (4) , 1735-1762
Collapsibility of the Conditional Models of CG‐Graphical Models
The conditional models of CG‐graphical models and their collapsibility property have been continuously attracting researchers' attention. The pioneering work of Didelez & Edwards (2004) derived the equivalent conditions for the conditional models' collapsibility, albeit the result is applicable only to the cases where a specific assumption holds. The subsequent study by B. Liu & Guo (2013) eliminated the assumption requirement in the settings with purely discrete or continuous variables. Via a novel technical approach, this work fully resolves the challenge for the complex scenario with mixed variable types. By examining model interaction preservation after marginalization, we bypass the need to compute intractable conditional densities and gain new insights into the problem. We identify a set of equivalent conditions for the model‐collapsibility in the most general setting without requiring additional assumption. Furthermore, we establish the equivalence between model‐collapsibility and estimate‐collapsibility for the conditional models of CG‐graphical models.
- 10 August 2025
- Published by Wiley in Scandinavian Journal of Statistics
- Vol. 52 (4) , 1735-1762
Collapsibility of the Conditional Models of CG‐Graphical Models
The conditional models of CG‐graphical models and their collapsibility property have been continuously attracting researchers' attention. The pioneering work of Didelez & Edwards (2004) derived the equivalent conditions for the conditional models' collapsibility, albeit the result is applicable only to the cases where a specific assumption holds. The subsequent study by B. Liu & Guo (2013) eliminated the assumption requirement in the settings with purely discrete or continuous variables. Via a novel technical approach, this work fully resolves the challenge for the complex scenario with mixed variable types. By examining model interaction preservation after marginalization, we bypass the need to compute intractable conditional densities and gain new insights into the problem. We identify a set of equivalent conditions for the model‐collapsibility in the most general setting without requiring additional assumption. Furthermore, we establish the equivalence between model‐collapsibility and estimate‐collapsibility for the conditional models of CG‐graphical models.
- Top Cited PapersOpen Access
- 12 July 2025
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 58 (10) , 1-47
Advances in artificial intelligence for olfaction and gustation: a comprehensive review
- 12 July 2025
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 58 (10) , 1-47
Top Cited PapersOpen AccessAdvances in artificial intelligence for olfaction and gustation: a comprehensive review
- 9 June 2025
- Published by Springer Nature in Science China Mathematics
- Vol. 69 (2) , 487-538
Tucker tensor factor models: Matricization and mode-wise PCA estimation
- 9 June 2025
- Published by Springer Nature in Science China Mathematics
- Vol. 69 (2) , 487-538
Tucker tensor factor models: Matricization and mode-wise PCA estimation
- 3 June 2025
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 210
Understanding asymptotic consistency and its unique advantages in large sample statistical inference
- 3 June 2025
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 210
Understanding asymptotic consistency and its unique advantages in large sample statistical inference
- 15 February 2025
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 41 (2) , 547-552
Kaiser Criterion in Factor Models
Despite of the wide use of the factor models, the issue of determining the number of factors has not been resolved in the statistics literature. An ad hoc approach is to set the number of factors to be the number of eigenvalues of the data correlation matrix that are larger than one, and subsequent statistical analysis proceeds assuming the resulting factor number is correct. In this work, we study the relation between the number of such eigenvalues and the number of factors, and provide the if and only if conditions under which the two numbers are equal. We show that the equality only relies on the properties of the loading matrix of the factor model. Guided by the newly discovered condition, we further reveal how the model error affects the estimation of the number of factors.
- 15 February 2025
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 41 (2) , 547-552
Kaiser Criterion in Factor Models
Despite of the wide use of the factor models, the issue of determining the number of factors has not been resolved in the statistics literature. An ad hoc approach is to set the number of factors to be the number of eigenvalues of the data correlation matrix that are larger than one, and subsequent statistical analysis proceeds assuming the resulting factor number is correct. In this work, we study the relation between the number of such eigenvalues and the number of factors, and provide the if and only if conditions under which the two numbers are equal. We show that the equality only relies on the properties of the loading matrix of the factor model. Guided by the newly discovered condition, we further reveal how the model error affects the estimation of the number of factors.