论文检索

高维模型中平滑泛函的估计：自助链与高斯近似AI 解读

Let X(n) be an observation sampled from a distribution Pθ(n) with an unknown parameter θ, θ being a vector in a Banach space E (most often, a high-dimensional space of dimension d). We study the problem of estimation of f(θ) for a functional f:E↦R of some smoothness s>0 based on an observation X(n)∼Pθ(n). Assuming that there exists an estimator θˆn=θˆn(X(n)) of parameter θ such that n(θˆ n−θ) is sufficiently close in distribution to a mean zero Gaussian random vector in E,…

正态模型中光滑泛函的估计：偏差降低与渐近效率AI 解读

Let X1,…,Xn be i.i.d. random variables sampled from a normal distribution N(μ,Σ) in Rd with unknown parameter θ=(μ,Σ)∈Θ:=Rd×C+d, where C+d is the cone of positively definite covariance operators in Rd. Given a smooth functional f:Θ↦R1, the goal is to estimate f(θ) based on X1,…,Xn. Let Θ(a;d):=Rd×{Σ∈C+d:σ(Σ)⊂[1/a,a]},a≥1, where σ(Σ) is the spectrum of covariance Σ. Let θˆ:=(μˆ,Σˆ), where μˆ is the sample mean and Σˆ is the sample covariance, based on the observations…

主成分线性泛函的有效估计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…

样本协方差谱投影的正态近似与集中性AI 解读

Let $X,X_{1},\dots,X_{n}$ be i.i.d. Gaussian random variables in a separable Hilbert space $\mathbb{H}$ with zero mean and covariance operator $\Sigma=\mathbb{E}(X\otimes X)$, and let $\hat{\Sigma}:=n^{-1}\sum_{j=1}^{n}(X_{j}\otimes X_{j})$ be the sample (empirical) covariance operator based on $(X_{1},\dots,X_{n})$. Denote by $P_{r}$ the spectral projector of $\Sigma$ corresponding to its $r$th eigenvalue $\mu_{r}$ and by $\hat{P}_{r}$ the empirical counterpart of $P_{r}$.…

图上光滑核的低秩估计AI 解读

Let $(V,A)$ be a weighted graph with a finite vertex set $V$, with a symmetric matrix of nonnegative weights $A$ and with Laplacian $\Delta$. Let $S_{\ast}: V\times V\mapsto{\mathbb{R}}$ be a symmetric kernel defined on the vertex set $V$. Consider $n$ i.i.d. observations $(X_{j},X_{j}',Y_{j})$, $j=1,\ldots,n$, where $X_{j}$, $X_{j}'$ are independent random vertices sampled from the uniform distribution in $V$ and $Y_{j}\in{\mathbb{R}}$ is a real valued response variable…

冯·诺依曼熵惩罚与低秩矩阵估计AI 解读

We study a problem of estimation of a Hermitian nonnegatively definite matrix ρ of unit trace (e.g., a density matrix of a quantum system) based on n i.i.d. measurements (X1, Y1), …, (Xn, Yn), where Yj = tr(ρXj) + ξj, j = 1, …, n, {Xj} being random i.i.d. Hermitian matrices and {ξj} being i.i.d. random variables with ${\mathbb{E}}(\xi_{j}|X_{j})=0$. The estimator $$\hat{\rho}^{\varepsilon }:=\mathop{\arg\min}_{S\in{\mathcal{S}}}\Biggl[n^{-1}\sum_{j=1}^{n}\bigl(Y_{j}-\operatorname{tr}(SX_{j})\bigr)^{2}+\varepsilon \operatorname{tr}(S\log S)\Biggr] $$…

含噪低秩矩阵补全的核范数惩罚与最优收敛率AI 解读

This paper deals with the trace regression model where n entries or linear combinations of entries of an unknown m1 × m2 matrix A0 corrupted by noise are observed. We propose a new nuclear-norm penalized estimator of A0 and establish a general sharp oracle inequality for this estimator for arbitrary values of n, m1, m2 under the condition of isometry in expectation. Then this method is applied to the matrix completion problem. In this case, the estimator admits a simple…

多核学习中的稀疏性AI 解读

The problem of multiple kernel learning based on penalized empirical risk minimization is discussed. The complexity penalty is determined jointly by the empirical L2 norms and the reproducing kernel Hilbert space (RKHS) norms induced by the kernels with a data-driven choice of regularization parameters. The main focus is on the case when the total number of kernels is large, but only a relatively small number of them is needed to represent the target function, so that the…

通过熵惩罚在凸包中实现稀疏恢复AI 解读

Let (X, Y) be a random couple in S×T with unknown distribution P and (X1, Y1), …, (Xn, Yn) be i.i.d. copies of (X, Y). Denote Pn the empirical distribution of (X1, Y1), …, (Xn, Yn). Let h1, …, hN: S↦[−1, 1] be a dictionary that consists of N functions. For λ∈ℝN, denote fλ:=∑j=1Nλjhj. Let ℓ: T×ℝ↦ℝ be a given loss function and suppose it is convex with respect to the second variable. Let (ℓ•f)(x, y):=ℓ(y; f(x)). Finally, let Λ⊂ℝN be the simplex of all probability distributions…

含噪向量场积分曲线的核估计与检验：扩散张量成像中的统计问题AI 解读

Let $v$ be a vector field in a bounded open set $G\subset {\mathbb{R}}^d$. Suppose that $v$ is observed with a random noise at random points $X_i,\ i=1,\dots, n$, that are independent and uniformly distributed in $G$. The problem is to estimate the integral curve of the differential equation \[\frac{dx(t)}{dt}=v(x(t)),\qquad t\geq 0,x(0)=x_{0}\in G,\] starting at a given point $x(0)=x_0\in G$ and to develop statistical tests for the hypothesis that the integral curve reaches…

作者回复：局部 Rademacher 复杂度与风险最小化中的 oracle 不等式AI 解读

I would like to thank the discussants for a number of deep and interesting comments and for their inspiring work on the subject over the years.I will not be able to address all the issues raised in the discussion; I will concentrate just on several of them. Local complexities and excess risk bounds.The first question is about possible ways to define distribution-and data-dependent complexities (such as local Rademacher complexities).The approach taken in my paper is based on…

风险最小化中的局部拉德马赫复杂度与预言不等式AI 解读

Let ℱ be a class of measurable functions f:S↦[0, 1] defined on a probability space (S, $\mathcal{A}$, P). Given a sample (X1, …, Xn) of i.i.d. random variables taking values in S with common distribution P, let Pn denote the empirical measure based on (X1, …, Xn). We study an empirical risk minimization problem Pnf→min , f∈ℱ. Given a solution f̂n of this problem, the goal is to obtain very general upper bounds on its excess risk $$\mathcal{E}_{P}(\hat{f}_{n}):=P\hat{f}_{n}-\inf_{f\in \mathcal{F}}Pf,$$…

关于提升方法论文的讨论及作者回应AI 解读

Discussions of: "Process consistency for AdaBoost" [Ann. Statist. 32 (2004), no. 1, 13-29] by W. Jiang; "On the Bayes-risk consistency of regularized boosting methods" [ibid., 30-55] by G. Lugosi and N. Vayatis; and "Statistical behavior and consistency of classification methods based on convex risk minimization" [ibid., 56-85] by T. Zhang. Includes rejoinders by the authors.

三篇关于提升法的论文：导言AI 解读

The notion of boosting originated in the Machine Learning literature in the 1980's [VALIANT, L.G. (1984). A theory of the learnable. In Proc. 16th Annual ACM Symposium on Theory of Computing 436-445. ACM Press, New York]. The goal of boosting is to improve the generalization performance of weak (or base) learning algorithms by combining them in a certain way. The first algorithm of this type was discovered by Schapire [SCHAPIRE, R.E. (1990). The strength of weak…