论文检索

块稀疏信号 ℓ₁ 恢复的精度保证AI 解读

We introduce a general framework to handle structured models (sparse and block-sparse with possibly overlapping blocks). We discuss new methods for their recovery from incomplete observation, corrupted with deterministic and stochastic noise, using block-$\ell_{1}$ regularization. While the current theory provides promising bounds for the recovery errors under a number of different, yet mostly hard to verify conditions, our emphasis is on verifiable conditions on the problem…

正性、单调性与凸性的非参数检验AI 解读

We consider the problem of estimating the distance from an unknown signal, observed in a white-noise model, to convex cones of positive/monotone/convex functions. We show that, when the unknown function belongs to a Hölder class, the risk of estimating the $L_r$-distance, $1 \leq r < \infty$, from the signal to a cone is essentially the same (up to a logarithmic factor) as that of estimating the signal itself. The same risk bounds hold for the test of positivity,…

结构自适应降维方法AI 解读

We propose a new method of effective dimension reduction for a multi-index model which is based on iterative improvement of the family of average derivative estimates. The procedure is computationally straightforward and does not require any prior information about the structure of the underlying model. We show that in the case when the effective dimension $m$ of the index space does not exceed 3, this space can be estimated with the rate $n^{-1/2}$ under rather mild…

单指标模型中指标系数的直接估计AI 解读

Single-index modeling is widely applied in,for example,econometric studies as a compromise between too restrictive parametric models and flexible but hardly estimable purely nonparametric models. By such modeling the statistical analysis usually focuses on estimating the index coefficients. The average derivative estimator (ADE) of the index vector is based on the fact that the average gradient of a single index function $f(x^{\top}\beta)$ is proportional to the index vector…

非参数回归中的函数聚合AI 解读

We consider the problem of estimating an unknown function $f$ from $N$ noisy observations on a random grid. In this paper we address the following aggregation problem: given $M$ functions $f_1,\dots, f_M$, find an “aggregated ”estimator which approximates $f$ nearly as well as the best convex combination $f^*$ of $f_1,\dots, f_M$. We propose algorithms which provide approximations of $f^*$ with expected $L_2$ accuracy $O(N^{-1/4}\ln^{1/4} M$. We show that this approximation…