论文检索

最小范数插值估计与正则化经验风险最小化的稳健性AI 解读

This article develops a general theory for minimum norm interpolating estimators and regularized empirical risk minimizers (RERM) in linear models in the presence of additive, potentially adversarial, errors. In particular, no conditions on the errors are imposed. A quantitative bound for the prediction error is given, relating it to the Rademacher complexity of the covariates, the norm of the minimum norm interpolator of the errors and the size of the subdifferential around…

高斯混合模型中谱聚类的最优性AI 解读

Spectral clustering is one of the most popular algorithms to group high- dimensional data. It is easy to implement and computationally efficient. Despite its popularity and successful applications, its theoretical properties have not been fully understood. In this paper, we show that spectral clustering is minimax optimal in the Gaussian mixture model with isotropic covariance matrix, when the number of clusters is fixed and the signal-to-noise ratio is large enough.…

主成分线性泛函的有效估计AI 解读

We study principal component analysis (PCA) for mean zero i.i.d. Gaussian observations $X_{1},\dots,X_{n}$ in a separable Hilbert space $\mathbb{H}$ with unknown covariance operator $\Sigma $. The complexity of the problem is characterized by its effective rank $\mathbf{r}(\Sigma):=\frac{\operatorname{tr}(\Sigma)}{\|\Sigma \|}$, where $\mathrm{tr}(\Sigma)$ denotes the trace of $\Sigma $ and $\|\Sigma\|$ denotes its operator norm. We develop a method of bias reduction in the…