Yuexiao Dong

Dr. Yuexiao Dong

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2010 in Biometrika
Verified
Journal Article
Closed access
PDF file
YDYuexiao Dong
Yuexiao Dong
BLBing Li
Bing Li
Many classical dimension reduction methods, especially those based on inverse conditional moments, require the predictors to have elliptical distributions, or at least to satisfy a linearity condition. Such conditions, however, are too strong for some applications. Li and Dong (2009) introduced the notion of the central solution space and used it to modify first-order methods, such as sliced inverse regression, so that they no longer rely on these conditions. In this paper we generalize this idea to second-order methods, such as sliced average variance estimation and directional regression. In doing so we demonstrate that the central solution space is a versatile framework: we can use it to modify essentially all inverse conditional moment-based methods to relax the distributional assumption on the predictors. Simulation studies and an application show a substantial improvement of the modified methods over their classical counterparts.

1 March 2021 in Journal of Statistical Planning and Inference
Verified
Journal Article
Closed access
YDYuexiao Dong
Yuexiao Dong

1 January 2013 in Statistica Sinica
Verified
Journal Article
Closed access
LZLiping Zhu
Liping Zhu
YDYuexiao Dong
Yuexiao Dong
RLRunze Li
Runze Li
We consider a single-index structure to study heteroscedasticity in regression with high-dimensional predictors. A general class of estimating equations is introduced, the resulting estimators remain consistent even when the structure of the variance function is misspecified. The proposed estimators also possess an adaptive property in an asymptotic sense. That is, they estimate the conditional variance function asymptotically as well as if the conditional mean function was given a priori. Numerical studies confirm our theoretical observations and demonstrate that our proposed estimator is superior to existing estimators with less bias and smaller standard deviation.

30 June 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
CSCencheng Shen
Cencheng Shen
YDYuexiao Dong
Yuexiao Dong
CPCarey E. Priebe
Carey E. Priebe
JLJonathan Larson
Jonathan Larson
HTHa Trinh
Ha Trinh
YPYoungser Park
Youngser Park
In this paper, we introduce the concept of principal communities and propose a principal graph encoder embedding method that concurrently detects these communities and achieves vertex embedding. Given a graph adjacency matrix with vertex labels, the method computes a sample community score for each community, ranking them to measure community importance and estimate a set of principal communities. The method then produces a vertex embedding by retaining only the dimensions corresponding to these principal communities. Theoretically, we define the population version of the encoder embedding and the community score based on a random Bernoulli graph distribution. We prove that the population principal graph encoder embedding preserves the conditional density of the vertex labels and that the population community score successfully distinguishes the principal communities. We conduct a variety of simulations to demonstrate the finite-sample accuracy in detecting ground-truth principal communities, as well as the advantages in embedding visualization and subsequent vertex classification. The method is further applied to a set of real-world graphs, showcasing its numerical advantages, including robustness to label noise and computational scalability.

16 March 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
CSCencheng Shen
Cencheng Shen
LCLi Chen
Li Chen
YDYuexiao Dong
Yuexiao Dong
CPCarey E. Priebe
Carey E. Priebe

2 January 2022 in Journal of Nonparametric Statistics
Verified
Journal Article
Closed access
ASAbdul-Nasah Soale
Abdul-Nasah Soale
YDYuexiao Dong
Yuexiao Dong
Principal asymmetric least squares (PALS) is introduced as a novel method for sufficient dimension reduction with heteroscedastic error. Classical methods such as MAVE [Xia et al. (2002), ‘An Adaptive Estimation of Dimension Reduction Space’ (with discussion), Journal of the Royal Statistical Society Series B, 64, 363–410] and PSVM [Li et al. (2011), ‘Principal Support Vector Machines for Linear and Nonlinear Sufficient Dimension Reduction’, The Annals of Statistics, 39, 3182–3210] may not perform well in the presence of heteroscedasticity, while the new proposal addresses this limitation by synthesising different expectile levels. Through extensive numerical studies, we demonstrate the superior performance of PALS in terms of estimation accuracy over classical methods including MAVE and PSVM. For the asymptotic analysis of PALS, we develop new tools to compute the derivative of an expectation of a non-Lipschitz function.