Related papers: Analysis of stochastic Lanczos quadrature for spec…
Spatial-sign covariance matrix (SSCM) is an important substitute of sample covariance matrix (SCM) in robust statistics. This paper investigates the SSCM on its asymptotic spectral behaviors under high-dimensional elliptical populations,…
The Spectral Form Factor (SFF) is a convenient tool for the characterization of eigenvalue statistics of systems with discrete spectra, and thus serves as a proxy for quantum chaoticity. This work presents an analytical calculation of the…
This paper studies explicit numerical approximations of the invariant probability measures (IPMs) for stochastic functional differential equations (SFDEs) with infinite delay under one-sided Lipschitz condition on the drift coefficient. To…
In this paper, we consider low rank matrix estimation using either matrix-version Dantzig Selector $\hat{A}_{\lambda}^d$ or matrix-version LASSO estimator $\hat{A}_{\lambda}^L$. We consider sub-Gaussian measurements, $i.e.$, the…
Del Castillo and Zhao (2020, 2021, 2022, 2024) have recently proposed a new methodology for the Statistical Process Control (SPC) of discrete parts whose 3-dimensional (3D) geometrical data are acquired with non-contact sensors. The…
Low-rank approximations of original samples are playing more and more an important role in many recently proposed mathematical models from data science. A natural and initial requirement is that these representations inherit original…
The Chinese Space Station Telescope (CSST) slitless spectroscopic survey will observe objects to a limiting magnitude of ~ 23 mag (5$\sigma$, point sources) in U, V, and I over 17500 deg$^2$. The spectroscopic observations are expected to…
Clustering short text embeddings is a foundational task in natural language processing, yet remains challenging due to the need to specify the number of clusters in advance. We introduce a scalable spectral method that estimates the number…
In this work, a new class of stochastic gradient algorithm is developed based on $q$-calculus. Unlike the existing $q$-LMS algorithm, the proposed approach fully utilizes the concept of $q$-calculus by incorporating time-varying $q$…
Spectral clustering is a well-known technique which identifies $k$ clusters in an undirected graph with weight matrix $W\in\mathbb{R}^{n\times n}$ by exploiting its graph Laplacian $L(W)$, whose eigenvalues $0=\lambda_1\leq \lambda_2 \leq…
We present a numerically feasible semiclassical (SC) method to evaluate quantum fidelity decay (Loschmidt echo, FD) in a classically chaotic system. It was thought that such evaluation would be intractable, but instead we show that a…
The assessment of segmentation quality plays a fundamental role in the development, optimization, and comparison of segmentation methods which are used in a wide range of applications. With few exceptions, quality assessment is performed…
Recent work in on-line Statistical Process Control (SPC) of manufactured 3-dimensional (3-D) objects has been proposed based on the estimation of the spectrum of the Laplace-Beltrami (LB) operator, a differential operator that encodes the…
Variance reduction is a crucial idea for Monte Carlo simulation and the stochastic Lanczos quadrature method is a dedicated method to approximate the trace of a matrix function. Inspired by their advantages, we combine these two techniques…
We study the problem of approximating the eigenspectrum of a symmetric matrix $\mathbf A \in \mathbb{R}^{n \times n}$ with bounded entries (i.e., $\|\mathbf A\|_{\infty} \leq 1$). We present a simple sublinear time algorithm that…
Data assimilation methods aim at estimating the state of a system by combining observations with a physical model. When sequential data assimilation is considered, the joint distribution of the latent state and the observations is described…
We consider a random symmetric matrix ${\bf X} = [X_{jk}]_{j,k=1}^n$ with upper triangular entries being i.i.d. random variables with mean zero and unit variance. We additionally suppose that $\mathbb E |X_{11}|^{4 + \delta} =:…
We consider estimation and inference in a single index regression model with an unknown convex link function. We introduce a convex and Lipschitz constrained least squares estimator (CLSE) for both the parametric and the nonparametric…
In network analysis, developing a unified theoretical framework that can compare methods under different models is an interesting problem. This paper proposes a partial solution to this problem. We summarize the idea of using separation…
Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the…