YZYijun Zuo

Yijun Zuo

*This is an algorithmically generated author record based on publicly available information.

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


Yijun Zuo has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Non-asymptotic analysis of the performance of the penalized least trimmed squares in sparse models

    by Yijun Zuo

    The least trimmed squares (LTS) estimator is a renowned robust alternative to the classic least squares estimator and is popular in location, regression, machine learning, and AI literature. Many studies exist on LTS, including its robustness, computation algorithms, extension to non-linear cases, asymptotics, etc. The LTS has been applied in the penalized regression in a high-dimensional real-data sparse-model setting where dimension $p$ (in thousands) is much larger than sample size $n$ (in tens, or hundreds). In such a practical setting, the sample size $n$ often is the count of sub-population that has a special attribute (e.g. the count of patients of Alzheimer's, Parkinson's, Leukemia, or ALS, etc.) among a population with a finite fixed size N. Asymptotic analysis assuming that $n$ tends to infinity is not practically convincing and legitimate in such a scenario. A non-asymptotic or finite sample analysis will be more desirable and feasible. This article establishes some finite sample (non-asymptotic) error bounds for estimating and predicting based on LTS with high probability for the first time.

  • Open Access

    Large Sample Behavior of the Least Trimmed Squares Estimator

    by Yijun Zuo

    The least trimmed squares (LTS) estimator is popular in location, regression, machine learning, and AI literature. Despite the empirical version of least trimmed squares (LTS) being repeatedly studied in the literature, the population version of the LTS has never been introduced and studied. The lack of the population version hinders the study of the large sample properties of the LTS utilizing the empirical process theory. Novel properties of the objective function in both empirical and population settings of the LTS and other properties, are established for the first time in this article. The primary properties of the objective function facilitate the establishment of other original results, including the influence function and Fisher consistency. The strong consistency is established with the help of a generalized Glivenko–Cantelli Theorem over a class of functions for the first time. Differentiability and stochastic equicontinuity promote the establishment of asymptotic normality with a concise and novel approach.


  • Open Access

    Weighted Least Squares Regression with the Best Robustness and High Computability

    by Yijun Zuo, Hanwen Zuo

    A novel regression method is introduced and studied. The procedure weights squared residuals based on their magnitude. Unlike the classic least squares which treats every squared residual as equally important, the new procedure exponentially down-weights squared residuals that lie far away from the cloud of all residuals and assigns a constant weight (one) to squared residuals that lie close to the center of the squared-residual cloud. The new procedure can keep a good balance between robustness and efficiency; it possesses the highest breakdown point robustness for any regression equivariant procedure, being much more robust than the classic least squares, yet much more efficient than the benchmark robust method, the least trimmed squares (LTS) of Rousseeuw. With a smooth weight function, the new procedure could be computed very fast by the first-order (first-derivative) method and the second-order (second-derivative) method. Assertions and other theoretical findings are verified in simulated and real data examples.


  • Open Access

    Weighted least squares regression with the best robustness and high computability

    by Yijun Zuo, Hanwen Zuo

    A novel regression method is introduced and studied. The procedure weights squared residuals based on their magnitude. Unlike the classic least squares which treats every squared residual equally important, the new procedure exponentially down-weights squared-residuals that lie far away from the cloud of all residuals and assigns a constant weight (one) to squared-residuals that lie close to the center of the squared-residual cloud. The new procedure can keep a good balance between robustness and efficiency, it possesses the highest breakdown point robustness for any regression equivariant procedure, much more robust than the classic least squares, yet much more efficient than the benchmark of robust method, the least trimmed squares (LTS) of Rousseeuw (1984). With a smooth weight function, the new procedure could be computed very fast by the first-order (first-derivative) method and the second-order (second-derivative) method. Assertions and other theoretical findings are verified in simulated and real data examples.

  • Open Access

    Computation of least squares trimmed regression--an alternative to least trimmed squares regression

    by Yijun Zuo, Hanwen Zuo

    The least squares of depth trimmed (LST) residuals regression, proposed in Zuo and Zuo (2023) \cite{ZZ23}, serves as a robust alternative to the classic least squares (LS) regression as well as a strong competitor to the famous least trimmed squares (LTS) regression of Rousseeuw (1984) \cite{R84}. Theoretical properties of the LST were thoroughly studied in \cite{ZZ23}. The article aims to promote the implementation and computation of the LST residuals regression for a broad group of statisticians in statistical practice and demonstrates that (i) the LST is as robust as the benchmark of robust regression, the LTS regression, and much more efficient than the latter. (ii) It can be as efficient as (or even more efficient than) the LS in the scenario with errors uncorrelated with mean zero and homoscedastic with finite variance. (iii) It can be computed as fast as (or even faster than) the LTS based on a newly proposed algorithm.

  • Open Access

    Asymptotics for the least trimmed squares estimator

    by Yijun Zuo

    Despite the empirical version of least trimmed squares (LTS) in regression (Rousseeuw \cite{R84}) having been repeatedly studied in the literature, the population version of LTS has never been introduced. Novel properties of the objective function in both empirical and population settings of the LTS, along with other properties, are established for the first time in this article. The primary properties of the objective function facilitate the establishment of other original results, including the influence function and Fisher consistency. The strong consistency is established with the help of a generalized Glivenko-Cantelli Theorem over a class of functions. Differentiability and stochastic equicontinuity promote the establishment of asymptotic normality with a concise and novel approach.

  • Open Access

    Non-asymptotic robustness analysis of regression depth median

    by Yijun Zuo

    The maximum depth estimator (aka depth median) ($\bs{\beta}^*_{RD}$) induced from regression depth (RD) of Rousseeuw and Hubert (1999) (RH99) is one of the most prevailing estimators in regression. It possesses outstanding robustness similar to the univariate location counterpart. Indeed, $\bs{\beta}^*_{RD}$ can, asymptotically, resist up to $33\%$ contamination without breakdown, in contrast to the $0\%$ for the traditional (least squares and least absolute deviations) estimators (see Van Aelst and Rousseeuw, 2000) (VAR00)). The results from VAR00 are pioneering, yet they are limited to regression-symmetric populations (with a strictly positive density) and the $\epsilon$-contamination and maximum-bias model. With a fixed finite-sample size practice, the most prevailing measure of robustness for estimators is the finite-sample breakdown point (FSBP) (Donoho and Huber (1983)). Despite many attempts made in the literature, only sporadic partial results on FSBP for $\bs{\beta}^*_{RD}$ were obtained whereas an exact FSBP for $\bs{\beta}^*_{RD}$ remained open in the last twenty-plus years. Furthermore, is the asymptotic breakdown value $1/3$ (the limit of an increasing sequence of finite-sample breakdown values) relevant in the finite-sample practice? (Or what is the difference between the finite-sample and the limit breakdown values?). Such discussions are yet to be given in the literature. This article addresses the above issues, revealing an intrinsic connection between the regression depth of $\bs{\beta}^*_{RD}$ and the newly obtained exact FSBP. It justifies the employment of $\bs{\beta}^*_{RD}$ as a robust alternative to the traditional estimators and demonstrates the necessity and the merit of using the FSBP in finite-sample real practice.

  • Open Access

    Least sum of squares of trimmed residuals regression

    by Yijun Zuo, Hanwen Zuo

    In the famous least sum of trimmed squares (LTS) estimator [21], residuals are first squared and then trimmed. In this article, we first trim residuals – using a depth trimming scheme – and then square the remaining of residuals. The estimator that minimizes the sum of trimmed and squared residuals, is called an LST estimator. Not only is the LST a robust alternative to the classic least sum of squares (LS) estimator. It also has a high finite sample breakdown point-and can resist, asymptotically, up to 50% contamination without breakdown – in sharp contrast to the 0% of the LS estimator. The population version of the LST is Fisher consistent, and the sample version is strong, root-n consistent, and asymptotically normal. We propose approximate algorithms for computing the LST and test on synthetic and real data sets. Despite being approximate, one of the algorithms compute the LST estimator quickly with relatively small variances in contrast to the famous LTS estimator. Thus, evidence suggests the LST serves as a robust alternative to the LS estimator and is feasible even in high dimension data sets with contamination and outliers.


  • Open Access

    Least sum of squares of trimmed residuals regression

    by Yijun Zuo

    In the famous least sum of trimmed squares (LTS) of residuals estimator (Rousseeuw (1984)), residuals are first squared and then trimmed. In this article, we first trim residuals - using a depth trimming scheme - and then square the rest of residuals. The estimator that can minimize the sum of squares of the trimmed residuals, is called an LST estimator. It turns out that LST is a robust alternative to the classic least sum of squares (LS) estimator. Indeed, it has a very high finite sample breakdown point, and can resist, asymptotically, up to $50\%$ contamination without breakdown - in sharp contrast to the $0\%$ of the LS estimator. The population version of LST is Fisher consistent, and the sample version is strong and root-$n$ consistent and asymptotically normal. Approximate algorithms for computing LST are proposed and tested in synthetic and real data examples. These experiments indicate that one of the algorithms can compute the LST estimator very fast and with relatively smaller variances than the famous LTS estimator. All the evidence suggests that LST deserves to be a robust alternative to the LS estimator and is feasible in practice for high dimensional data sets (with possible contamination and outliers).