Hung Hung
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
Hung Hung has a total of 93 co-authors. Here are the top co-authors by number of shared publications:
Su-Yun Huang
Institute of Statistical Science, Academia Sinica
9 shared publicationsShinto Eguchi
Institute of Statistical Mathematics
5 shared publicationsChen-Chien Wang
Yahoo, Sunnyvale, California 94089, U.S.A.
4 shared publications- Chin-Tsang Chiang
Institute of Applied Mathematical Sciences, National Taiwan University, Taipei, Taiwan
4 shared publications - Po-Hsiu Kuo
National Taiwan University
4 shared publications - Su-Yun Huang
Academia Sinica
4 shared publications
Latest Publications
- Open Access
- 4 July 2026
- Published by Elsevier in International Journal of Disaster Risk Reduction
- Vol. 143
A health outcome-informed vulnerability index and two-stage risk matrix approach to assessing future heat risk in Taiwan
- 4 July 2026
- Published by Elsevier in International Journal of Disaster Risk Reduction
- Vol. 143
Open AccessA health outcome-informed vulnerability index and two-stage risk matrix approach to assessing future heat risk in Taiwan
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74, 4685-4694
On the Efficiency-Loss Free Ordering-Robustness of Product-PCA
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74, 4685-4694
On the Efficiency-Loss Free Ordering-Robustness of Product-PCA
- 24 October 2025
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 35 (2) , 685-693
A Generalized Mean Approach for Distributed-PCA
- 24 October 2025
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 35 (2) , 685-693
A Generalized Mean Approach for Distributed-PCA
- Open Access
A Generalized Mean Approach for Distributed-PCA
Principal component analysis (PCA) is a widely used technique for dimension reduction. As datasets continue to grow in size, distributed-PCA (DPCA) has become an active research area. A key challenge in DPCA lies in efficiently aggregating results across multiple machines or computing nodes due to computational overhead. Fan et al. (2019) introduced a pioneering DPCA method to estimate the leading rank-$r$ eigenspace, aggregating local rank-$r$ projection matrices by averaging. However, their method does not utilize eigenvalue information. In this article, we propose a novel DPCA method that incorporates eigenvalue information to aggregate local results via the matrix $β$-mean, which we call $β$-DPCA. The matrix $β$-mean offers a flexible and robust aggregation method through the adjustable choice of $β$ values. Notably, for $β=1$, it corresponds to the arithmetic mean; for $β=-1$, the harmonic mean; and as $β\to 0$, the geometric mean. Moreover, the matrix $β$-mean is shown to associate with the matrix $β$-divergence, a subclass of the Bregman matrix divergence, to support the robustness of $β$-DPCA. We also study the stability of eigenvector ordering under eigenvalue perturbation for $β$-DPCA. The performance of our proposal is evaluated through numerical studies.Open AccessA Generalized Mean Approach for Distributed-PCA
Principal component analysis (PCA) is a widely used technique for dimension reduction. As datasets continue to grow in size, distributed-PCA (DPCA) has become an active research area. A key challenge in DPCA lies in efficiently aggregating results across multiple machines or computing nodes due to computational overhead. Fan et al. (2019) introduced a pioneering DPCA method to estimate the leading rank-$r$ eigenspace, aggregating local rank-$r$ projection matrices by averaging. However, their method does not utilize eigenvalue information. In this article, we propose a novel DPCA method that incorporates eigenvalue information to aggregate local results via the matrix $β$-mean, which we call $β$-DPCA. The matrix $β$-mean offers a flexible and robust aggregation method through the adjustable choice of $β$ values. Notably, for $β=1$, it corresponds to the arithmetic mean; for $β=-1$, the harmonic mean; and as $β\to 0$, the geometric mean. Moreover, the matrix $β$-mean is shown to associate with the matrix $β$-divergence, a subclass of the Bregman matrix divergence, to support the robustness of $β$-DPCA. We also study the stability of eigenvector ordering under eigenvalue perturbation for $β$-DPCA. The performance of our proposal is evaluated through numerical studies. - 19 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 70 (1053587X) , 5885-5897
Robust Self-Tuning Semiparametric PCA for Contaminated Elliptical Distribution
Principal component analysis (PCA) is one of the most popular dimension reduction methods. The usual PCA is known to be sensitive to the presence of outliers, and thus many robust PCA methods have been developed. Among them, the Tyler's M-estimator is shown to be the most robust scatter estimator under the elliptical distribution. However, when the underlying distribution is contaminated and deviates from ellipticity, Tyler's M-estimator might not work well. In this article, we apply the semiparametric theory to propose a robust semiparametric PCA, which is shown to be a re-weighted Tyler's M-estimator. The merits of our proposal are twofold. First, it is robust to both heavy-tailed elliptical outliers and non-elliptical outliers. Second, it pairs well with a data-driven tuning procedure, which is based on active ratio and can adapt to different degrees of data outlyingness. Simulation studies and a data analysis demonstrate the superiority of our method.
- 19 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 70 (1053587X) , 5885-5897
Robust Self-Tuning Semiparametric PCA for Contaminated Elliptical Distribution
Principal component analysis (PCA) is one of the most popular dimension reduction methods. The usual PCA is known to be sensitive to the presence of outliers, and thus many robust PCA methods have been developed. Among them, the Tyler's M-estimator is shown to be the most robust scatter estimator under the elliptical distribution. However, when the underlying distribution is contaminated and deviates from ellipticity, Tyler's M-estimator might not work well. In this article, we apply the semiparametric theory to propose a robust semiparametric PCA, which is shown to be a re-weighted Tyler's M-estimator. The merits of our proposal are twofold. First, it is robust to both heavy-tailed elliptical outliers and non-elliptical outliers. Second, it pairs well with a data-driven tuning procedure, which is based on active ratio and can adapt to different degrees of data outlyingness. Simulation studies and a data analysis demonstrate the superiority of our method.
- Open Access
Robust Aggregation for Federated Learning by Minimum γ-Divergence Estimation
Federated learning is a framework for multiple devices or institutions, called local clients, to collaboratively train a global model without sharing their data. For federated learning with a central server, an aggregation algorithm integrates model information sent from local clients to update the parameters for a global model. Sample mean is the simplest and most commonly used aggregation method. However, it is not robust for data with outliers or under the Byzantine problem, where Byzantine clients send malicious messages to interfere with the learning process. Some robust aggregation methods were introduced in literature including marginal median, geometric median and trimmed-mean. In this article, we propose an alternative robust aggregation method, named -mean, which is the minimum divergence estimation based on a robust density power divergence. This -mean aggregation mitigates the influence of Byzantine clients by assigning fewer weights. This weighting scheme is data-driven and controlled by the value. Robustness from the viewpoint of the influence function is discussed and some numerical results are presented.Open AccessRobust Aggregation for Federated Learning by Minimum γ-Divergence Estimation
Federated learning is a framework for multiple devices or institutions, called local clients, to collaboratively train a global model without sharing their data. For federated learning with a central server, an aggregation algorithm integrates model information sent from local clients to update the parameters for a global model. Sample mean is the simplest and most commonly used aggregation method. However, it is not robust for data with outliers or under the Byzantine problem, where Byzantine clients send malicious messages to interfere with the learning process. Some robust aggregation methods were introduced in literature including marginal median, geometric median and trimmed-mean. In this article, we propose an alternative robust aggregation method, named -mean, which is the minimum divergence estimation based on a robust density power divergence. This -mean aggregation mitigates the influence of Byzantine clients by assigning fewer weights. This weighting scheme is data-driven and controlled by the value. Robustness from the viewpoint of the influence function is discussed and some numerical results are presented. - 10 January 2022
- Published by Springer Nature in Statistical Papers
- Vol. 63 (4) , 1295-1321
A generalized information criterion for high-dimensional PCA rank selection
- 10 January 2022
- Published by Springer Nature in Statistical Papers
- Vol. 63 (4) , 1295-1321
A generalized information criterion for high-dimensional PCA rank selection
- 1 January 2022
- Published by Statistica Sinica (Institute of Statistical Science) in Statistica Sinica
- Vol. 32, 2297-2314
A Review on Sliced Inverse Regression, Sufficient Dimension Reduction, and Applications
- 1 January 2022
- Published by Statistica Sinica (Institute of Statistical Science) in Statistica Sinica
- Vol. 32, 2297-2314
A Review on Sliced Inverse Regression, Sufficient Dimension Reduction, and Applications
- 1 April 2019
- Published by Elsevier in Environmental Modelling & Software
- Vol. 114, 181-187
Incorporating satellite-derived data with annual and monthly land use regression models for estimating spatial distribution of air pollution
- 1 April 2019
- Published by Elsevier in Environmental Modelling & Software
- Vol. 114, 181-187
Incorporating satellite-derived data with annual and monthly land use regression models for estimating spatial distribution of air pollution
- 14 November 2018
- Published by Oxford University Press (OUP) in Biometrics
- Vol. 75 (2) , 650-662
A Robust Removing Unwanted Variation–Testing Procedure via -Divergence
Identification of differentially expressed genes (DE genes) is commonly conducted in modern biomedical research. However, unwanted variation inevitably arises during the data collection process, which can make the detection results heavily biased. Various methods have been suggested for removing the unwanted variation while keeping the biological variation to ensure a reliable analysis result. Removing Unwanted Variation (RUV) has recently been proposed for this purpose, which works by virtue of negative control genes. On the other hand, outliers frequently appear in modern high‐throughput genetic data, which can heavily affect the performances of RUV and its downstream analysis. In this work, we propose a robust RUV‐testing procedure (a robust RUV procedure to remove unwanted variance, followed by a robust testing procedure to identify DE genes) via γ‐divergence. The advantages of our method are twofold: (i) it does not involve any modeling for the outlier distribution, which makes it applicable to various situations; (ii) it is easy to implement in the sense that its robustness is controlled by a single tuning parameter of γ‐divergence, and a data‐driven criterion is developed to select γ. When applied to real data sets, our method can successfully removed unwanted variation, and was able to identify more DE genes than conventional methods. This article is protected by copyright. All rights reserved
- 14 November 2018
- Published by Oxford University Press (OUP) in Biometrics
- Vol. 75 (2) , 650-662
A Robust Removing Unwanted Variation–Testing Procedure via -Divergence
Identification of differentially expressed genes (DE genes) is commonly conducted in modern biomedical research. However, unwanted variation inevitably arises during the data collection process, which can make the detection results heavily biased. Various methods have been suggested for removing the unwanted variation while keeping the biological variation to ensure a reliable analysis result. Removing Unwanted Variation (RUV) has recently been proposed for this purpose, which works by virtue of negative control genes. On the other hand, outliers frequently appear in modern high‐throughput genetic data, which can heavily affect the performances of RUV and its downstream analysis. In this work, we propose a robust RUV‐testing procedure (a robust RUV procedure to remove unwanted variance, followed by a robust testing procedure to identify DE genes) via γ‐divergence. The advantages of our method are twofold: (i) it does not involve any modeling for the outlier distribution, which makes it applicable to various situations; (ii) it is easy to implement in the sense that its robustness is controlled by a single tuning parameter of γ‐divergence, and a data‐driven criterion is developed to select γ. When applied to real data sets, our method can successfully removed unwanted variation, and was able to identify more DE genes than conventional methods. This article is protected by copyright. All rights reserved