论文检索

一般测量误差分布假设下的密度反卷积AI 解读

In this paper, we study the problem of density deconvolution under general assumptions on the measurement error distribution. Typically, deconvolution estimators are constructed using Fourier transform techniques, and it is assumed that the characteristic function of the measurement errors does not have zeros on the real line. This assumption is rather strong and is not fulfilled in many cases of interest. In this paper, we develop a methodology for constructing optimal…

核密度估计的带宽选择：Oracle 不等式与自适应极小极大最优性AI 解读

We address the problem of density estimation with "$\mathbb{L}_{s}$-loss by selection of kernel estimators. We develop a selection procedure and derive corresponding $\mathbb{L}_{s}$-risk oracle inequalities. It is shown that the proposed selection rule leads to the estimator being minimax adaptive over a scale of the anisotropic Nikol’skii classes. The main technical tools used in our derivations are uniform bounds on the $\mathbb{L}_{s}$-norms of empirical processes…

一种通用的估计量聚合程序AI 解读

In this paper we study the aggregation problem that can be formulated as follows. Assume that we have a family of estimators $\mathcal{F}$ built on the basis of available observations. The goal is to construct a new estimator whose risk is as close as possible to that of the best estimator in the family. We propose a general aggregation scheme that is universal in the following sense: it applies for families of arbitrary estimators and a wide variety of models and global…

从模糊且含噪的观测中恢复凸边界AI 解读

We consider the problem of estimating convex boundaries from blurred and noisy observations. In our model, the convolution of an intensity function f is observed with additive Gaussian white noise. The function f is assumed to have convex support G whose boundary is to be recovered. Rather than directly estimating the intensity function, we develop a procedure which is based on estimating the support function of the set G. This approach is closely related to the method of…

霍夫变换估计量AI 解读

This article pursues a statistical study of the Hough transform, the celebrated computer vision algorithm used to detect the presence of lines in a noisy image. We first study asymptotic properties of the Hough transform estimator, whose objective is to find the line that “best” fits a set of planar points. In particular, we establish strong consistency and rates of convergence, and characterize the limiting distribution of the Hough transform estimator. While the…

自回归时间序列建模的非渐近界AI 解读

The subject of this paper is autoregressive (AR) modeling of a stationary, Gaussian discrete time process, based on a finite sequence of observations. The process is assumed to admit an AR($\infty$) representation with exponentially decaying coefficients. We adopt the nonparametric minimax framework and study how well the process can be approximated by a finite­order AR model. A lower bound on the accuracy of AR approximations is derived, and a nonasymptotic upper bound on…

回归模型选择的渐近极小极大遗憾规则与维数惩罚AI 解读

This paper addresses the topic of model selection in regression.We emphasize the case of two models, testing which model provides a better prediction based on $n$ observations. Within a family of selection rules, based on maximizing a penalized log-likelihood under a normal model, we search for asymptotically minimax rules over a class $\mathscr{G}$ of possible joint distributions of the explanatory and response variables. For the class $\mathscr{G}$ of multivariate normal…