Xiucai Ding
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
Xiucai Ding has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Fan Yang
Yau Mathematical Sciences Center, Tsinghua University, Beijing, China
3 shared publications - Jiahui Xie
Department of Statistics and Data Science National University of Singapore
2 shared publications - Thomas Trogdon
University of Washington
2 shared publications Yichen Hu
Department of Statistics University of California Davis
2 shared publications- Zhenggang Wang
Department of Statistics UC Davis
2 shared publications - Chen Qian
University of California at Davis
1 shared publication
Latest Publications
- Open Access
On the edge eigenvalues of sparse random geometric graphs
In this paper, we study the edge eigenvalues of random geometric graphs (RGGs) generated by multivariate Gaussian samples in the sparse regime under a broad class of distance metrics. Previous work on edge eigenvalues under related setups has relied on methods based on integral operators or the Courant-Fischer min-max principle with interpolation. However, these approaches typically require either a dense regime or sampling distributions that are compactly supported and non-vanishing, and therefore cannot be generalized to our setting. We introduce a two-step smoothing-matching argument. First, we construct a smoothed empirical operator from the given RGG. We then match its edge eigenvalues to those of a continuum limit operator via a counting argument. We show that, after proper normalization, the first few nontrivial edge eigenvalues of the RGG converge with high probability to those of a differential operator, which can be computed explicitly through a simple second-order linear partial differential equation. To the best of our knowledge, these are the first results on the edge eigenvalues of RGGs generated from samples with unbounded support and vanishing density functions.
Open AccessOn the edge eigenvalues of sparse random geometric graphs
In this paper, we study the edge eigenvalues of random geometric graphs (RGGs) generated by multivariate Gaussian samples in the sparse regime under a broad class of distance metrics. Previous work on edge eigenvalues under related setups has relied on methods based on integral operators or the Courant-Fischer min-max principle with interpolation. However, these approaches typically require either a dense regime or sampling distributions that are compactly supported and non-vanishing, and therefore cannot be generalized to our setting. We introduce a two-step smoothing-matching argument. First, we construct a smoothed empirical operator from the given RGG. We then match its edge eigenvalues to those of a continuum limit operator via a counting argument. We show that, after proper normalization, the first few nontrivial edge eigenvalues of the RGG converge with high probability to those of a differential operator, which can be computed explicitly through a simple second-order linear partial differential equation. To the best of our knowledge, these are the first results on the edge eigenvalues of RGGs generated from samples with unbounded support and vanishing density functions.
- Open Access
Structural Classification of Locally Stationary Time Series Based on Second-order Characteristics
Time series classification is crucial for numerous scientific and engineering applications. In this article, we present a numerically efficient, practically competitive, and theoretically rigorous classification method for distinguishing between two classes of locally stationary time series based on their time-domain, second-order characteristics. Our approach builds on the autoregressive approximation for locally stationary time series, combined with an ensemble aggregation and a distance-based threshold for classification. It imposes no requirement on the training sample size, and is shown to achieve zero misclassification error rate asymptotically when the underlying time series differ only mildly in their second-order characteristics. The new method is demonstrated to outperform a variety of state-of-the-art solutions, including wavelet-based, tree-based, convolution-based methods, as well as modern deep learning methods, through intensive numerical simulations and a real EEG data analysis for epilepsy classification.
Open AccessStructural Classification of Locally Stationary Time Series Based on Second-order Characteristics
Time series classification is crucial for numerous scientific and engineering applications. In this article, we present a numerically efficient, practically competitive, and theoretically rigorous classification method for distinguishing between two classes of locally stationary time series based on their time-domain, second-order characteristics. Our approach builds on the autoregressive approximation for locally stationary time series, combined with an ensemble aggregation and a distance-based threshold for classification. It imposes no requirement on the training sample size, and is shown to achieve zero misclassification error rate asymptotically when the underlying time series differ only mildly in their second-order characteristics. The new method is demonstrated to outperform a variety of state-of-the-art solutions, including wavelet-based, tree-based, convolution-based methods, as well as modern deep learning methods, through intensive numerical simulations and a real EEG data analysis for epilepsy classification.
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71  (8) , 6248-6296
Global and Local CLTs for Linear Spectral Statistics of General Sample Covariance Matrices When the Dimension Is Much Larger Than the Sample Size With Applications
In this paper, under the assumption that the dimension is much larger than the sample size, i.e.,$p \asymp n^{\alpha }, \alpha \gt 1$ , we consider the sample covariance matrices$Q = \Sigma ^{1/2} XX^{*}\Sigma ^{1/2}$ , where$X=(x_{ij})$ is a$p \times n$ random matrix with centered i.i.d. entries whose variances are$(pn)^{-1/2}$ , and$\Sigma $ is the deterministic population covariance matrix. This ultra-high dimensional setting is increasingly relevant in various applications in information theory, communications, and signal processing, such as massive MIMO, compressed sensing, and large-scale sensor networks. We establish two classes of central limit theorems (CLTs) for the linear spectral statistics (LSS) of Q, the global CLTs on the macroscopic scales where all the eigenvalues will be used, and the local CLTs on the mesoscopic scales where only part of the eigenvalues will be utilized. We prove that the LSS converge to some Gaussian processes whose mean and covariance functions, depending on$\Sigma $ , the ratio$p/n$ , and the test functions, can be identified explicitly on both macroscopic and mesoscopic scales. We also show that even though the global CLTs depend on the fourth cumulant of$x_{ij}$ , the local CLTs do not. Leveraging these results, we propose two classes of statistics for testing the structures of$\Sigma $ , the global statistics and the local statistics, and analyze their superior power under general local alternatives. To our best knowledge, the local LSS testing statistics, which do not rely on the fourth moment of$x_{ij}$ , are used for the first time in hypothesis testing while the literature mostly uses the global statistics and requires prior knowledge of the fourth moment. Numerical simulations also confirm the accuracy and powerfulness of our proposed statistics and illustrate better performance compared to the existing methods in the literature.- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 71  (8) , 6248-6296
Global and Local CLTs for Linear Spectral Statistics of General Sample Covariance Matrices When the Dimension Is Much Larger Than the Sample Size With Applications
In this paper, under the assumption that the dimension is much larger than the sample size, i.e.,$p \asymp n^{\alpha }, \alpha \gt 1$ , we consider the sample covariance matrices$Q = \Sigma ^{1/2} XX^{*}\Sigma ^{1/2}$ , where$X=(x_{ij})$ is a$p \times n$ random matrix with centered i.i.d. entries whose variances are$(pn)^{-1/2}$ , and$\Sigma $ is the deterministic population covariance matrix. This ultra-high dimensional setting is increasingly relevant in various applications in information theory, communications, and signal processing, such as massive MIMO, compressed sensing, and large-scale sensor networks. We establish two classes of central limit theorems (CLTs) for the linear spectral statistics (LSS) of Q, the global CLTs on the macroscopic scales where all the eigenvalues will be used, and the local CLTs on the mesoscopic scales where only part of the eigenvalues will be utilized. We prove that the LSS converge to some Gaussian processes whose mean and covariance functions, depending on$\Sigma $ , the ratio$p/n$ , and the test functions, can be identified explicitly on both macroscopic and mesoscopic scales. We also show that even though the global CLTs depend on the fourth cumulant of$x_{ij}$ , the local CLTs do not. Leveraging these results, we propose two classes of statistics for testing the structures of$\Sigma $ , the global statistics and the local statistics, and analyze their superior power under general local alternatives. To our best knowledge, the local LSS testing statistics, which do not rely on the fourth moment of$x_{ij}$ , are used for the first time in hypothesis testing while the literature mostly uses the global statistics and requires prior knowledge of the fourth moment. Numerical simulations also confirm the accuracy and powerfulness of our proposed statistics and illustrate better performance compared to the existing methods in the literature.- Open Access
Eigenvector distributions and optimal shrinkage estimators for large covariance and precision matrices
This paper focuses on investigating Stein's invariant shrinkage estimators for large sample covariance matrices and precision matrices in high-dimensional settings. We consider models that have nearly arbitrary population covariance matrices, including those with potential spikes. By imposing mild technical assumptions, we establish the asymptotic limits of the shrinkers for a wide range of loss functions. A key contribution of this work, enabling the derivation of the limits of the shrinkers, is a novel result concerning the asymptotic distributions of the non-spiked eigenvectors of the sample covariance matrices, which can be of independent interest.
Open AccessEigenvector distributions and optimal shrinkage estimators for large covariance and precision matrices
This paper focuses on investigating Stein's invariant shrinkage estimators for large sample covariance matrices and precision matrices in high-dimensional settings. We consider models that have nearly arbitrary population covariance matrices, including those with potential spikes. By imposing mild technical assumptions, we establish the asymptotic limits of the shrinkers for a wide range of loss functions. A key contribution of this work, enabling the derivation of the limits of the shrinkers, is a novel result concerning the asymptotic distributions of the non-spiked eigenvectors of the sample covariance matrices, which can be of independent interest.
- Open Access
On the partial autocorrelation function for locally stationary time series: characterization, estimation and inference
For stationary time series, it is common to use the plots of partial autocorrelation function (PACF) or PACF-based tests to explore the temporal dependence structure of such processes. To our best knowledge, such analogs for non-stationary time series have not been fully established yet. In this paper, we fill this gap for locally stationary time series with short-range dependence. First, we characterize the PACF locally in the time domain and show that the $j$th PACF, denoted as $ρ_{j}(t),$ decays with $j$ whose rate is adaptive to the temporal dependence of the time series $\{x_{i,n}\}$. Second, at time $i,$ we justify that the PACF $ρ_j(i/n)$ can be efficiently approximated by the best linear prediction coefficients via the Yule-Walker's equations. This allows us to study the PACF via ordinary least squares (OLS) locally. Third, we show that the PACF is smooth in time for locally stationary time series. We use the sieve method with OLS to estimate $ρ_j(\cdot)$ and construct some statistics to test the PACFs and infer the structures of the time series. These tests generalize and modify those used for stationary time series. Finally, a multiplier bootstrap algorithm is proposed for practical implementation and an $\mathtt R$ package $\mathtt {Sie2nts}$ is provided to implement our algorithm. Numerical simulations and real data analysis also confirm usefulness of our results.Open AccessOn the partial autocorrelation function for locally stationary time series: characterization, estimation and inference
For stationary time series, it is common to use the plots of partial autocorrelation function (PACF) or PACF-based tests to explore the temporal dependence structure of such processes. To our best knowledge, such analogs for non-stationary time series have not been fully established yet. In this paper, we fill this gap for locally stationary time series with short-range dependence. First, we characterize the PACF locally in the time domain and show that the $j$th PACF, denoted as $ρ_{j}(t),$ decays with $j$ whose rate is adaptive to the temporal dependence of the time series $\{x_{i,n}\}$. Second, at time $i,$ we justify that the PACF $ρ_j(i/n)$ can be efficiently approximated by the best linear prediction coefficients via the Yule-Walker's equations. This allows us to study the PACF via ordinary least squares (OLS) locally. Third, we show that the PACF is smooth in time for locally stationary time series. We use the sieve method with OLS to estimate $ρ_j(\cdot)$ and construct some statistics to test the PACFs and infer the structures of the time series. These tests generalize and modify those used for stationary time series. Finally, a multiplier bootstrap algorithm is proposed for practical implementation and an $\mathtt R$ package $\mathtt {Sie2nts}$ is provided to implement our algorithm. Numerical simulations and real data analysis also confirm usefulness of our results. - 1 January 2024
- Published by Oxford University Press (OUP) in Information and Inference: A Journal of the IMA
- Vol. 13  (1)
How do kernel-based sensor fusion algorithms behave under high-dimensional noise?
We study the behavior of two kernel based sensor fusion algorithms, nonparametric canonical correlation analysis (NCCA) and alternating diffusion (AD), under the nonnull setting that the clean datasets collected from two sensors are modeled by a common low-dimensional manifold embedded in a high-dimensional Euclidean space and the datasets are corrupted by high-dimensional noise. We establish the asymptotic limits and convergence rates for the eigenvalues of the associated kernel matrices assuming that the sample dimension and sample size are comparably large, where NCCA and AD are conducted using the Gaussian kernel. It turns out that both the asymptotic limits and convergence rates depend on the signal-to-noise ratio (SNR) of each sensor and selected bandwidths. On one hand, we show that if NCCA and AD are directly applied to the noisy point clouds without any sanity check, it may generate artificial information that misleads scientists’ interpretation. On the other hand, we prove that if the bandwidths are selected adequately, both NCCA and AD can be made robust to high-dimensional noise when the SNRs are relatively large.
- 1 January 2024
- Published by Oxford University Press (OUP) in Information and Inference: A Journal of the IMA
- Vol. 13  (1)
How do kernel-based sensor fusion algorithms behave under high-dimensional noise?
We study the behavior of two kernel based sensor fusion algorithms, nonparametric canonical correlation analysis (NCCA) and alternating diffusion (AD), under the nonnull setting that the clean datasets collected from two sensors are modeled by a common low-dimensional manifold embedded in a high-dimensional Euclidean space and the datasets are corrupted by high-dimensional noise. We establish the asymptotic limits and convergence rates for the eigenvalues of the associated kernel matrices assuming that the sample dimension and sample size are comparably large, where NCCA and AD are conducted using the Gaussian kernel. It turns out that both the asymptotic limits and convergence rates depend on the signal-to-noise ratio (SNR) of each sensor and selected bandwidths. On one hand, we show that if NCCA and AD are directly applied to the noisy point clouds without any sanity check, it may generate artificial information that misleads scientists’ interpretation. On the other hand, we prove that if the bandwidths are selected adequately, both NCCA and AD can be made robust to high-dimensional noise when the SNRs are relatively large.
- Open Access
Two sample test for covariance matrices in ultra-high dimension
In this paper, we propose a new test for testing the equality of two population covariance matrices in the ultra-high dimensional setting that the dimension is much larger than the sizes of both of the two samples. Our proposed methodology relies on a data splitting procedure and a comparison of a set of well selected eigenvalues of the sample covariance matrices on the split data sets. Compared to the existing methods, our methodology is adaptive in the sense that (i). it does not require specific assumption (e.g., comparable or balancing, etc.) on the sizes of two samples; (ii). it does not need quantitative or structural assumptions of the population covariance matrices; (iii). it does not need the parametric distributions or the detailed knowledge of the moments of the two populations. Theoretically, we establish the asymptotic distributions of the statistics used in our method and conduct the power analysis. We justify that our method is powerful under very weak alternatives. We conduct extensive numerical simulations and show that our method significantly outperforms the existing ones both in terms of size and power. Analysis of two real data sets is also carried out to demonstrate the usefulness and superior performance of our proposed methodology. An $\texttt{R}$ package $\texttt{UHDtst}$ is developed for easy implementation of our proposed methodology.Open AccessTwo sample test for covariance matrices in ultra-high dimension
In this paper, we propose a new test for testing the equality of two population covariance matrices in the ultra-high dimensional setting that the dimension is much larger than the sizes of both of the two samples. Our proposed methodology relies on a data splitting procedure and a comparison of a set of well selected eigenvalues of the sample covariance matrices on the split data sets. Compared to the existing methods, our methodology is adaptive in the sense that (i). it does not require specific assumption (e.g., comparable or balancing, etc.) on the sizes of two samples; (ii). it does not need quantitative or structural assumptions of the population covariance matrices; (iii). it does not need the parametric distributions or the detailed knowledge of the moments of the two populations. Theoretically, we establish the asymptotic distributions of the statistics used in our method and conduct the power analysis. We justify that our method is powerful under very weak alternatives. We conduct extensive numerical simulations and show that our method significantly outperforms the existing ones both in terms of size and power. Analysis of two real data sets is also carried out to demonstrate the usefulness and superior performance of our proposed methodology. An $\texttt{R}$ package $\texttt{UHDtst}$ is developed for easy implementation of our proposed methodology. - Open Access
Global and local CLTs for linear spectral statistics of general sample covariance matrices when the dimension is much larger than the sample size with applications
In this paper, under the assumption that the dimension is much larger than the sample size, i.e., $p \asymp n^α, α>1,$ we consider the (unnormalized) sample covariance matrices $Q = Σ^{1/2} XX^*Σ^{1/2}$, where $X=(x_{ij})$ is a $p \times n$ random matrix with centered i.i.d entries whose variances are $(pn)^{-1/2}$, and $Σ$ is the deterministic population covariance matrix. We establish two classes of central limit theorems (CLTs) for the linear spectral statistics (LSS) for $Q,$ the global CLTs on the macroscopic scales and the local CLTs on the mesoscopic scales. We prove that the LSS converge to some Gaussian processes whose mean and covariance functions depending on $Σ$, the ratio $p/n$ and the test functions, can be identified explicitly on both macroscopic and mesoscopic scales. We also show that even though the global CLTs depend on the fourth cumulant of $x_{ij},$ the local CLTs do not. Based on these results, we propose two classes of statistics for testing the structures of $Σ,$ the global statistics and the local statistics, and analyze their superior power under general local alternatives. To our best knowledge, the local LSS testing statistics which do not rely on the fourth moment of $x_{ij},$ is used for the first time in hypothesis testing while the literature mostly uses the global statistics and requires the prior knowledge of the fourth cumulant. Numerical simulations also confirm the accuracy and powerfulness of our proposed statistics and illustrate better performance compared to the existing methods in the literature.Open AccessGlobal and local CLTs for linear spectral statistics of general sample covariance matrices when the dimension is much larger than the sample size with applications
In this paper, under the assumption that the dimension is much larger than the sample size, i.e., $p \asymp n^α, α>1,$ we consider the (unnormalized) sample covariance matrices $Q = Σ^{1/2} XX^*Σ^{1/2}$, where $X=(x_{ij})$ is a $p \times n$ random matrix with centered i.i.d entries whose variances are $(pn)^{-1/2}$, and $Σ$ is the deterministic population covariance matrix. We establish two classes of central limit theorems (CLTs) for the linear spectral statistics (LSS) for $Q,$ the global CLTs on the macroscopic scales and the local CLTs on the mesoscopic scales. We prove that the LSS converge to some Gaussian processes whose mean and covariance functions depending on $Σ$, the ratio $p/n$ and the test functions, can be identified explicitly on both macroscopic and mesoscopic scales. We also show that even though the global CLTs depend on the fourth cumulant of $x_{ij},$ the local CLTs do not. Based on these results, we propose two classes of statistics for testing the structures of $Σ,$ the global statistics and the local statistics, and analyze their superior power under general local alternatives. To our best knowledge, the local LSS testing statistics which do not rely on the fourth moment of $x_{ij},$ is used for the first time in hypothesis testing while the literature mostly uses the global statistics and requires the prior knowledge of the fourth cumulant. Numerical simulations also confirm the accuracy and powerfulness of our proposed statistics and illustrate better performance compared to the existing methods in the literature. - Open Access
Learning Low-Dimensional Nonlinear Structures from High-Dimensional Noisy Data: An Integral Operator Approach
We propose a kernel-spectral embedding algorithm for learning low-dimensional nonlinear structures from high-dimensional and noisy observations, where the datasets are assumed to be sampled from an intrinsically low-dimensional manifold and corrupted by high-dimensional noise. The algorithm employs an adaptive bandwidth selection procedure which does not rely on prior knowledge of the underlying manifold. The obtained low-dimensional embeddings can be further utilized for downstream purposes such as data visualization, clustering and prediction. Our method is theoretically justified and practically interpretable. Specifically, we establish the convergence of the final embeddings to their noiseless counterparts when the dimension and size of the samples are comparably large, and characterize the effect of the signal-to-noise ratio on the rate of convergence and phase transition. We also prove convergence of the embeddings to the eigenfunctions of an integral operator defined by the kernel map of some reproducing kernel Hilbert space capturing the underlying nonlinear structures. Numerical simulations and analysis of three real datasets show the superior empirical performance of the proposed method, compared to many existing methods, on learning various manifolds in diverse applications.
Open AccessLearning Low-Dimensional Nonlinear Structures from High-Dimensional Noisy Data: An Integral Operator Approach
We propose a kernel-spectral embedding algorithm for learning low-dimensional nonlinear structures from high-dimensional and noisy observations, where the datasets are assumed to be sampled from an intrinsically low-dimensional manifold and corrupted by high-dimensional noise. The algorithm employs an adaptive bandwidth selection procedure which does not rely on prior knowledge of the underlying manifold. The obtained low-dimensional embeddings can be further utilized for downstream purposes such as data visualization, clustering and prediction. Our method is theoretically justified and practically interpretable. Specifically, we establish the convergence of the final embeddings to their noiseless counterparts when the dimension and size of the samples are comparably large, and characterize the effect of the signal-to-noise ratio on the rate of convergence and phase transition. We also prove convergence of the embeddings to the eigenfunctions of an integral operator defined by the kernel map of some reproducing kernel Hilbert space capturing the underlying nonlinear structures. Numerical simulations and analysis of three real datasets show the superior empirical performance of the proposed method, compared to many existing methods, on learning various manifolds in diverse applications.
- Open Access
Auto-Regressive Approximations to Non-stationary Time Series, with Inference and Applications
Understanding the time-varying structure of complex temporal systems is one of the main challenges of modern time series analysis. In this paper, we show that every uniformly-positive-definite-in-covariance and sufficiently short-range dependent non-stationary and nonlinear time series can be well approximated globally by a white-noise-driven auto-regressive (AR) process of slowly diverging order. To our best knowledge, it is the first time such a structural approximation result is established for general classes of non-stationary time series. A high dimensional $\mathcal{L}^2$ test and an associated multiplier bootstrap procedure are proposed for the inference of the AR approximation coefficients. In particular, an adaptive stability test is proposed to check whether the AR approximation coefficients are time-varying, a frequently-encountered question for practitioners and researchers of time series. As an application, globally optimal short-term forecasting theory and methodology for a wide class of locally stationary time series are established via the method of sieves.Open AccessAuto-Regressive Approximations to Non-stationary Time Series, with Inference and Applications
Understanding the time-varying structure of complex temporal systems is one of the main challenges of modern time series analysis. In this paper, we show that every uniformly-positive-definite-in-covariance and sufficiently short-range dependent non-stationary and nonlinear time series can be well approximated globally by a white-noise-driven auto-regressive (AR) process of slowly diverging order. To our best knowledge, it is the first time such a structural approximation result is established for general classes of non-stationary time series. A high dimensional $\mathcal{L}^2$ test and an associated multiplier bootstrap procedure are proposed for the inference of the AR approximation coefficients. In particular, an adaptive stability test is proposed to check whether the AR approximation coefficients are time-varying, a frequently-encountered question for practitioners and researchers of time series. As an application, globally optimal short-term forecasting theory and methodology for a wide class of locally stationary time series are established via the method of sieves.