arXiv subjects

Hung Hung

Publications and source records attributed to Hung Hung.

At least 19 recordsLinked to original sources

arXiv2025

The $\phi$-PCA Framework: A Unified and Efficiency-Preserving Approach with Robust Variants

Principal component analysis (PCA) is a fundamental tool in multivariate statistics, yet its sensitivity to outliers and limitations in distributed environments restrict its effectiveness in modern large-scale applications. To address these challenges, we introduce the $\phi$-PCA framework which provides a unified formulation of robust and distributed PCA. The class of $\phi$-PCA methods retains the asymptotic efficiency of standard PCA, while aggregating multiple local estimates using a proper $\phi$ function enhances ordering-robustness, leading to more accurate eigensubspace estimation under contamination. Notably, the harmonic mean PCA (HM-PCA), corresponding to the choice $\phi(u)=u^{-1}$, achieves optimal ordering-robustness and is recommended for practical use. Theoretical results further show that robustness increases with the number of partitions, a phenomenon seldom explored in the literature on robust or distributed PCA. Altogether, the partition-aggregation principle underlying $\phi$-PCA offers a general strategy for developing robust and efficiency-preserving methodologies applicable to both robust and distributed data analysis.

stat.ME↗

arXiv2024

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 $\beta$-mean, which we call $\beta$-DPCA. The matrix $\beta$-mean offers a flexible and robust aggregation method through the adjustable choice of $\beta$ values. Notably, for $\beta=1$, it corresponds to the arithmetic mean; for $\beta=-1$, the harmonic mean; and as $\beta \to 0$, the geometric mean. Moreover, the matrix $\beta$-mean is shown to associate with the matrix $\beta$-divergence, a subclass of the Bregman matrix divergence, to support the robustness of $\beta$-DPCA. We also study the stability of eigenvector ordering under eigenvalue perturbation for $\beta$-DPCA. The performance of our proposal is evaluated through numerical studies.

stat.ML↗

arXiv2024

On the asymptotic properties of product-PCA under the high-dimensional setting

Principal component analysis (PCA) is a widely used dimension reduction method, but its performance is known to be non-robust to outliers. Recently, product-PCA (PPCA) has been shown to possess the efficiency-loss free ordering-robustness property: (i) in the absence of outliers, PPCA and PCA share the same asymptotic distributions; (ii), in the presence of outliers, PPCA is more ordering-robust than PCA in estimating the leading eigenspace. PPCA is thus different from the conventional robust PCA methods, and may deserve further investigations. In this article, we study the high-dimensional statistical properties of the PPCA eigenvalues via the techniques of random matrix theory. In particular, we derive the critical value for being distant spiked eigenvalues, the limiting values of the sample spiked eigenvalues, and the limiting spectral distribution of PPCA. Similar to the case of PCA, the explicit forms of the asymptotic properties of PPCA become available under the special case of the simple spiked model. These results enable us to more clearly understand the superiorities of PPCA in comparison with PCA. Numerical studies are conducted to verify our results.

math.ST↗

arXiv2024

Information Criterion-Based Rank Estimation Methods for Factor Analysis: A Unified Selection Consistency Theorem and Numerical Comparison

Over the years, numerous rank estimators for factor models have been proposed in the literature. This article focuses on information criterion-based rank estimators and investigates their consistency in rank selection. The gap conditions serve as necessary and sufficient conditions for rank estimators to achieve selection consistency under the general assumptions of random matrix theory. We establish a unified theorem on selection consistency, presenting the gap conditions for information criterion-based rank estimators with a unified formulation. To validate the theorem's assertion that rank selection consistency is solely determined by the gap conditions, we conduct extensive numerical simulations across various settings. Additionally, we undertake supplementary simulations to explore the strengths and limitations of information criterion-based estimators by comparing them with other types of rank estimators.

math.ST↗

arXiv2023

On the efficiency-loss free ordering-robustness of product-PCA

This article studies the robustness of the eigenvalue ordering, an important issue when estimating the leading eigen-subspace by principal component analysis (PCA). In Yata and Aoshima (2010), cross-data-matrix PCA (CDM-PCA) was proposed and shown to have smaller bias than PCA in estimating eigenvalues. While CDM-PCA has the potential to achieve better estimation of the leading eigen-subspace than the usual PCA, its robustness is not well recognized. In this article, we first develop a more stable variant of CDM-PCA, which we call product-PCA (PPCA), that provides a more convenient formulation for theoretical investigation. Secondly, we prove that, in the presence of outliers, PPCA is more robust than PCA in maintaining the correct ordering of leading eigenvalues. The robustness gain in PPCA comes from the random data partition, and it does not rely on a data down-weighting scheme as most robust statistical methods do. This enables us to establish the surprising finding that, when there are no outliers, PPCA and PCA share the same asymptotic distribution. That is, the robustness gain of PPCA in estimating the leading eigen-subspace has no efficiency loss in comparison with PCA. Simulation studies and a face data example are presented to show the merits of PPCA. In conclusion, PPCA has a good potential to replace the role of the usual PCA in real applications whether outliers are present or not.

stat.ME↗

arXiv2022

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. The merits of our proposal are twofold. First, it is robust to heavy-tailed elliptical distributions as well as robust to 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. Theoretical properties are derived, including the influence functions for various statistical functionals and asymptotic normality. Simulation studies and a data analysis demonstrate the superiority of our method.

stat.ME↗

arXiv2020

Statistical Inference on the Cure Time

In population-based cancer survival analysis, the net survival is important for government to assess health care programs. For decades, it is observed that the net survival reaches a plateau after long-term follow-up, this is so called ``statistical cure''. Several methods were proposed to address the statistical cure. Besides, the cure time can be used to evaluate the time period of a health care program for a specific patient population, and it also can be helpful for a clinician to explain the prognosis for patients, therefore the cure time is an important health care index. However, those proposed methods assume the cure time to be infinity, thus it is inconvenient to make inference on the cure time. In this dissertation, we define a more general concept of statistical cure via conditional survival. Based on the newly defined statistical cure, the cure time is well defined. We develop cure time model methodologies and show a variety of properties through simulation. In data analysis, cure times are estimated for 22 major cancers in Taiwan, we further use colorectal cancer data as an example to conduct statistical inference via cure time model with covariate sex, age group, and stage. This dissertation provides a methodology to obtain cure time estimate, which can contribute to public health policy making.

stat.ME↗

arXiv2020

A generalized information criterion for high-dimensional PCA rank selection

Principal component analysis (PCA) is the most commonly used statistical procedure for dimension reduction. An important issue for applying PCA is to determine the rank, which is the number of dominant eigenvalues of the covariance matrix. The Akaike information criterion (AIC) and Bayesian information criterion (BIC) are among the most widely used rank selection methods. Both use the number of free parameters for assessing model complexity. In this work, we adopt the generalized information criterion (GIC) to propose a new method for PCA rank selection under the high-dimensional framework. The GIC model complexity takes into account the sizes of covariance eigenvalues and can be better adaptive to practical applications. Asymptotic properties of GIC are derived and the selection consistency is established under the generalized spiked covariance model.

stat.ME↗

arXiv2017

A robust RUV-testing procedure via gamma-divergence

Identification of differentially expressed genes (DE-genes) is commonly conducted in modern biomedical researches. However, unwanted variation inevitably arises during the data collection process, which could make the detection results heavily biased. It is suggested to remove the unwanted variation while keeping the biological variation to ensure a reliable analysis result. Removing Unwanted Variation (RUV) is recently proposed for this purpose by the virtue of negative control genes. On the other hand, outliers are frequently appear in modern high-throughput genetic data that can heavily affect the performances of RUV and its downstream analysis. In this work, we propose a robust RUV-testing procedure via gamma-divergence. The advantages of our method are twofold: (1) it does not involve any modeling for the outlier distribution, which is applicable to various situations, (2) it is easy to implement in the sense that its robustness is controlled by a single tuning parameter gamma of gamma-divergence, and a data-driven criterion is developed to select $\gamma$. In the Gender Study, our method can successfully remove unwanted variation, and is able to identify more DE-genes than conventional methods.

stat.ME↗

arXiv2017

Sufficient Dimension Reduction via Random-Partitions for Large-p-Small-n Problem

Sufficient dimension reduction (SDR) is continuing an active research field nowadays for high dimensional data. It aims to estimate the central subspace (CS) without making distributional assumption. To overcome the large-$p$-small-$n$ problem we propose a new approach for SDR. Our method combines the following ideas for high dimensional data analysis: (1) Randomly partition the covariates into subsets and use distance correlation (DC) to construct a sketch of envelope subspace with low dimension. (2) Obtain a sketch of the CS by applying conventional SDR method within the constructed envelope subspace. (3) Repeat the above two steps for a few times and integrate these multiple sketches to form the final estimate of the CS. We name the proposed SDR procedure "integrated random-partition SDR (iRP-SDR)". Comparing with existing methods, iRP-SDR is less affected by the selection of tuning parameters. Moreover, the estimation procedure of iRP-SDR does not involve the determination of the structural dimension until at the last stage, which makes the method more robust in a high-dimensional setting. Asymptotic properties of iRP-SDR are also established. The advantageous performance of the proposed method is demonstrated via simulation studies and the EEG data analysis.

stat.ME↗

arXiv2016

Robust mislabel logistic regression without modeling mislabel probabilities

Logistic regression is among the most widely used statistical methods for linear discriminant analysis. In many applications, we only observe possibly mislabeled responses. Fitting a conventional logistic regression can then lead to biased estimation. One common resolution is to fit a mislabel logistic regression model, which takes into consideration of mislabeled responses. Another common method is to adopt a robust M-estimation by down-weighting suspected instances. In this work, we propose a new robust mislabel logistic regression based on gamma-divergence. Our proposal possesses two advantageous features: (1) It does not need to model the mislabel probabilities. (2) The minimum gamma-divergence estimation leads to a weighted estimating equation without the need to subtract any bias correction term, i.e., it is automatically bias corrected. These properties make the proposed gamma-logistic regression more robust in model fitting and more intuitive for model interpretation through a simple weighting scheme. Our method is also easy to implement, and two types of algorithms are included. Simulation and real data application results are presented to demonstrate the performance of gamma-logistic.

stat.AP↗

arXiv2016

A low-rank based estimation-testing procedure for matrix-covariate regression

Matrix-covariate is now frequently encountered in many biomedical researches. It is common to fit conventional statistical models by vectorizing matrix-covariate. This strategy, however, results in a large number of parameters, while the available sample size is relatively too small to have reliable analysis results. To overcome the problem of high-dimensionality in hypothesis testing, variance component test has been proposed with promise detection power, but is not straightforward to provide estimates of effect size. In this work, we overcome the problem of high-dimensionality by utilizing the inherent structure of the matrix-covariate. The advantage is that estimation and hypothesis testing can be conducted simultaneously as in the conventional case, while the estimation efficiency and detection power can be largely improved, due to a parsimonious parameterization for the coefficients of matrix-covariate. Our method is applied to test the significance of gene-gene interactions in the PSQI data, and is applied to test if electroencephalography is associated with the alcoholic status in the EEG data, wherein sparse effects and low-rank effects of matrix-covariates are identified, respectively.

stat.AP↗

arXiv2014

Sufficient dimension reduction with additional information

Sufficient dimension reduction is widely applied to help model building between the response $Y$ and covariate $X$. While the target of interest is the relationship between $(Y,X)$, in some applications we also collect additional variable $W$ that is strongly correlated with $Y$. From a statistical point of view, making inference about $(Y,X)$ without using $W$ will lose efficiency. However, it is not trivial to incorporate the information of $W$ to infer $(Y,X)$. In this article, we propose a two-stage dimension reduction method for $(Y,X)$, that is able to utilize the additional information from $W$. The main idea is to confine the searching space, by constructing an envelope subspace for the target of interest. In the analysis of breast cancer data, the risk score constructed from the two-stage method can well separate patients with different survival experiences. In the Pima data, the two-stage method requires fewer components to infer the diabetes status, while achieving higher classification accuracy than conventional method.

stat.ME↗

arXiv2014

Recovering rank-one matrices via rank-r matrices relaxation

PhaseLift, proposed by E.J. Candès et al., is one convex relaxation approach for phase retrieval. The relaxation enlarges the solution set from rank one matrices to positive semidefinite matrices. In this paper, a relaxation is employed to nonconvex alternating minimization methods to recover the rank-one matrices. A generic measurement matrix can be standardized to a matrix consisting of orthonormal columns. To recover the rank-one matrix, the standardized frames are used to select the matrix with the maximal leading eigenvalue among the rank-$r$ matrices. Empirical studies are conducted to validate the effectiveness of this relaxation approach. In the case of Gaussian random matrices with a sufficient number of nearly orthogonal sensing vectors, we show that the singular vector corresponding to the least singular value is close to the unknown signal, and thus it can be a good initialization for the nonconvex minimization algorithm.

math.OC↗

arXiv2014

$γ$-SUP: A clustering algorithm for cryo-electron microscopy images of asymmetric particles

Cryo-electron microscopy (cryo-EM) has recently emerged as a powerful tool for obtaining three-dimensional (3D) structures of biological macromolecules in native states. A minimum cryo-EM image data set for deriving a meaningful reconstruction is comprised of thousands of randomly orientated projections of identical particles photographed with a small number of electrons. The computation of 3D structure from 2D projections requires clustering, which aims to enhance the signal to noise ratio in each view by grouping similarly oriented images. Nevertheless, the prevailing clustering techniques are often compromised by three characteristics of cryo-EM data: high noise content, high dimensionality and large number of clusters. Moreover, since clustering requires registering images of similar orientation into the same pixel coordinates by 2D alignment, it is desired that the clustering algorithm can label misaligned images as outliers. Herein, we introduce a clustering algorithm $γ$-SUP to model the data with a $q$-Gaussian mixture and adopt the minimum $γ$-divergence for estimation, and then use a self-updating procedure to obtain the numerical solution. We apply $γ$-SUP to the cryo-EM images of two benchmark macromolecules, RNA polymerase II and ribosome. In the former case, simulated images were chosen to decouple clustering from alignment to demonstrate $γ$-SUP is more robust to misalignment outliers than the existing clustering methods used in the cryo-EM community. In the latter case, the clustering of real cryo-EM data by our $γ$-SUP method eliminates noise in many views to reveal true structure features of ribosome at the projection level.

stat.AP↗

arXiv2013

Detection of Gene-Gene Interactions by Multistage Sparse and Low-Rank Regression

A daunting challenge faced by modern biological sciences is finding an efficient and computationally feasible approach to deal with the curse of high dimensionality. The problem becomes even more severe when the research focus is on interactions. To improve the performance, we propose a low-rank interaction model, where the interaction effects are modeled using a low-rank matrix. With parsimonious parameterization of interactions, the proposed model increases the stability and efficiency of statistical analysis. Built upon the low-rank model, we further propose an Extended Screen-and-Clean approach, based on the Screen and Clean (SC) method (Wasserman and Roeder, 2009; Wu et al., 2010), to detect gene-gene interactions. In particular, the screening stage utilizes a combination of a low-rank structure and a sparsity constraint in order to achieve higher power and higher selection-consistency probability. We demonstrate the effectiveness of the method using simulations and apply the proposed procedure on the warfarin dosage study. The data analysis identified main and interaction effects that would have been neglected using conventional methods.

stat.ME↗

arXiv2012

Robust Independent Component Analysis via Minimum Divergence Estimation

Independent component analysis (ICA) has been shown to be useful in many applications. However, most ICA methods are sensitive to data contamination and outliers. In this article we introduce a general minimum U-divergence framework for ICA, which covers some standard ICA methods as special cases. Within the U-family we further focus on the gamma-divergence due to its desirable property of super robustness, which gives the proposed method gamma-ICA. Statistical properties and technical conditions for the consistency of gamma-ICA are rigorously studied. In the limiting case, it leads to a necessary and sufficient condition for the consistency of MLE-ICA. This necessary and sufficient condition is weaker than the condition known in the literature. Since the parameter of interest in ICA is an orthogonal matrix, a geometrical algorithm based on gradient flows on special orthogonal group is introduced to implement gamma-ICA. Furthermore, a data-driven selection for the gamma value, which is critical to the achievement of gamma-ICA, is developed. The performance, especially the robustness, of gamma-ICA in comparison with standard ICA methods is demonstrated through experimental studies using simulated data and image data.

stat.ME↗

arXiv2012

A Two-Stage Dimension Reduction Method for Induced Responses and Its Applications

Researchers in the biological sciences nowadays often encounter the curse of high-dimensionality, which many previously developed statistical models fail to overcome. To tackle this problem, sufficient dimension reduction aims to estimate the central subspace (CS), in which all the necessary information supplied by the covariates regarding the response of interest is contained. Subsequent statistical analysis can then be made in a lower-dimensional space while preserving relevant information. Oftentimes studies are interested in a certain transformation of the response (the induced response), instead of the original one, whose corresponding CS may vary. When estimating the CS of the induced response, existing dimension reduction methods may, however, suffer the problem of inefficiency. In this article, we propose a more efficient two-stage estimation procedure to estimate the CS of an induced response. This approach is further extended to the case of censored responses. An application for combining multiple biomarkers is also illustrated. Simulation studies and two data examples provide further evidence of the usefulness of the proposed method.

stat.ME↗