直方图理论与最优直方图制作

直方图是一种最为常见的密度估计和数据分析工具. 在直方图理论和制作过程中, 组距的选择和边界点的确定尤为重要. 然而, 许多学者对这两个参数的选择仍然采用经验的方法, 甚至现在大多数统计软件在确定直方图分组数时也是默认采用粗略的计算公式. 本文主要介绍直方图理论和最优直方图制作的最新研究成果, 强调面向样本的最优直方图制作方法.     

Optimal kernel estimation of densities

Precise asymptotic behavior for mean integrated squared error (MISE) is determined for sequences of kernel estimators of a density in a broad class, including discontinuous and possibly unbounded densities. The paper shows that the sequence using the kernel optimal at each fixed sample size is asymptotically more efficient than a sequence generated by changing the bandwidth of a fixed kernel shape, regardless of the kernel shape. The class of densities considered are those whose characteristic functions behave at large arguments like the product of a Fourier series and a regularly varying function. This condition may be related to the smoothness of an m-th derivative of the density.Partially supported by National Science Foundation Grant DMS-8711924.     

A KERNEL ESTIMATOR OF A DENSITY FUNCTION IN MULTIVARIATE CASE FROM RANDOMLY CENSORED DATA

ＡＫＥＲＮＥＬＥＳＴＩＭＡＴＯＲＯＦＡＤＥＮＳＩＴＹＦＵＮＣＴＩＯＮＩＮＭＵＬＴＩＶＡＲＩＡＴＥＣＡＳＥＦＲＯＭＲＡＮＤＯＭＬＹＣＥＮＳＯＲＥＤＤＡＴＡ￥ＺｈｏｕＹｏｎｇ（周勇）（ＰｒｏｂａｂｉｌｉｔｙｌａｂｏｒａｔｏｒｙｉｎＩｎｓｔ．ｏｆＡｐｐｌ．...     

On the modal resolution of kernel density estimators

The ability of a kernel density estimator to resolve modes of the underlying density is investigated. For various bimodal densities and three different kernels, the smallest sample size required for the expectation of an optimally smoothed kernel estimator to be bimodal is determined. The optimality criterion employed is equivalent to asymptotic mean integrated squared error for sufficiently smooth densities.     

Multivariate Hazard Rates under Random Censorship

The data consists of multivariate failure times under right random censorship. By the kernel smoothing technique, convolutions of cumulative multivariate hazard functions suggest estimators of the so-called multivariate hazard functions. We establish strong i.i.d. representations and uniform bounds of the remainder terms on some compact sets of the underlying space. Thus asymptotic normality and uniform consistency on such sets are obtained. The asymptotic mean squared error gives an optimal bandwidth by the plug-in method. Simulations assess the performance of our estimators.     

Probability density estimation with surrogate data and validation sample

The probability density estimation problem with surrogate data and validation sample is considered. A regression calibration kernel density estimator is defined to incorporate the information contained in both surrogate variates and validation sample. Also, we define two weighted estimators which have less asymptotic variances but have bigger biases than the regression calibration kernel density estimator. All the proposed estimators are proved to be asymptotically normal. And the asymptotic representations for the mean squared error and mean integrated square error of the proposed estimators are established, respectively. A simulation study is conducted to compare the finite sample behaviors of the proposed estimators.     

Non-parametric kernel regression for multinomial data

This paper presents a kernel smoothing method for multinomial regression. A class of estimators of the regression functions is constructed by minimizing a localized power-divergence measure. These estimators include the bandwidth and a single parameter originating in the power-divergence measure as smoothing parameters. An asymptotic theory for the estimators is developed and the bias-adjusted estimators are obtained. A data-based algorithm for selecting the smoothing parameters is also proposed. Simulation results reveal that the proposed algorithm works efficiently.     

强相关数据回归函数的小波估计

讨论了在强相关数据情形下对回归函数的小波估计,并且给出了估计量的均方误差的一个渐近展开表示式． 对研究估计量的优劣,所推导的近似表示式显得非常重要．对一般的回归函数核估计,如果回归函数不是充分光滑,这个均方误差表示式并不成立A·D2但对小波估计,即使回归函数间断连续,这个均方误差表示式仍然成立．因此,小波估计的收敛速度要比核估计来得快,从而小波估计在某种程度上改进了现有的核估计．     

Nonlinear wavelet density estimation with censored dependent data

In this paper, we provide an asymptotic expansion for the mean integrated squared error (MISE) of nonlinear wavelet estimator of survival density for a censorship model when the data exhibit some kind of dependence. It is assumed that the observations form a stationary and α‐mixing sequence. This asymptotic MISE expansion, when the density is only piecewise smooth, is same. However, for the kernel estimators, the MISE expansion fails if the additional smoothness assumption is absent. Also, we establish the asymptotic normality of the nonlinear wavelet estimator. Copyright © 2011 John Wiley & Sons, Ltd.     

Backus—Gilbert方法对不精确数据解的误差估计

1 引言 1968年地质学家G Backus and F Gilbert给出了求解线性(非线性)矩问题的一种方法,用来求解地球物理反问题。后来称这种方法为B-G方法。过去几年,数学家们从理论和应用方面研究了B-G方法。从理论上分析了其收敛性并给出了误差估计。第一类算子方程在不同函数空间的离散化得到不同形式的矩问题。[4]、[5]研究了再生核空间和小波空间的B-G方法。并用于信号恢复问题。由于矩问题的不适定性,有必要分析B-G方法解的正则性,本文得到了B-G方法对不精确数据的误差估计,从而证明了B-G方法是—种正则化方法。 考虑线性矩问题     

Rate of convergence of a convolution-type estimator of the marginal density of a MA(1) process

In this paper moving-average processes with no parametric assumption on the error distribution are considered. A new convolution-type estimator of the marginal density of a MA(1) is presented. This estimator is closely related to some previous ones used to estimate the integrated squared density and has a structure similar to the ordinary kernel density estimator. For second-order kernels, the rate of convergence of this new estimator is investigated and the rate of the optimal bandwidth obtained. Under limit conditions on the smoothing parameter the convolution-type estimator is proved to be -consistent, which contrasts with the asymptotic behavior of the ordinary kernel density estimator, that is only -consistent.     

Mean Integrated Squared Error of Nonlinear Wavelet-based Estimators with Long Memory Data

We consider the nonparametric regression model with long memory data that are not necessarily Gaussian and provide an asymptotic expansion for the mean integrated squared error (MISE) of nonlinear wavelet-based mean regression function estimators. We show this MISE expansion, when the underlying mean regression function is only piecewise smooth, is the same as analogous expansion for the kernel estimators. However, for the kernel estimators, this MISE expansion generally fails if an additional smoothness assumption is absent. Research supported in part by the NSF grant DMS-0103939.     

Error density estimation in high-dimensional sparse linear model

This paper is concerned with the error density estimation in high-dimensional sparse linear model, where the number of variables may be larger than the sample size. An improved two-stage refitted cross-validation procedure by random splitting technique is used to obtain the residuals of the model, and then traditional kernel density method is applied to estimate the error density. Under suitable sparse conditions, the large sample properties of the estimator including the consistency and asymptotic normality, as well as the law of the iterated logarithm are obtained. Especially, we gave the relationship between the sparsity and the convergence rate of the kernel density estimator. The simulation results show that our error density estimator has a good performance. A real data example is presented to illustrate our methods.

     

OPTIMAL ERROR BOUNDS FOR THE CUBIC SPLINE INTERPOLATION OF LOWER SMOOTH FUNCTION （Ⅱ）

In this paper, by using the explicit expression of the kernel of the cubic spline interpolation, the optimal error bounds for the cubic spline interpolation of lower soomth functions are obtained.     

Smoothed cross-validation

Summary For bandwidth selection of a kernel density estimator, a generalization of the widely studied least squares cross-validation method is considered. The essential idea is to do a particular type of presmoothing of the data. This is seen to be essentially the same as using the smoothed bootstrap estimate of the mean integrated squared error. Analysis reveals that a rather large amount of presmoothing yields excellent asymptotic performance. The rate of convergence to the optimum is known to be best possible under a wide range of smoothness conditions. The method is more appealing than other selectors with this property, because its motivation is not heavily dependent on precise asymptotic analysis, and because its form is simple and intuitive. Theory is also given for choice of the amount of presmoothing, and this is used to derive a data-based method for this choice.Research of the second author was done while on leave from the University of North Carolina. That of both the second and third was partially supported by National Science Foundation Grants DMS-8701201 and DMS-8902973     

Optimizing the smoothed bootstrap

In this paper we develop the technique of a generalized rescaling in the smoothed bootstrap, extending Silverman and Young's idea of shrinking. Unlike most existing methods of smoothing, with a proper choice of the rescaling parameter the rescaled smoothed bootstrap method produces estimators that have the asymptotic minimum mean (integrated) squared error, asymptotically improving existing bootstrap methods, both smoothed and unsmoothed. In fact, the new method includes existing smoothed bootstrap methods as special cases. This unified approach is investigated in the problems of estimation of global and local functionals and kernel density estimation. The emphasis of this investigation is on theoretical improvements which in some cases offer practical potential.     

Asymptotically optimal choice of the smoothing parameter in a nonparametric kernel estimator for a probability density

This paper presents a method of estimation of an “optimal” smoothing parameter (window width) in kernel estimators for a probability density. The obtained estimator is calculated directly from observations. By “optimal” smoothing parameters we mean those parameters which minimize the mean integral square error (MISE) or the integral square error (ISE) of approximation of an unknown density by the kernel estimator. It is shown that the asymptotic “optimality” properties of the proposed estimator correspond (with respect to the order) to those of the well-known cross-validation procedure [1, 2]. Translated fromStatisticheskie Metody Otsenivaniya i Proverki Gipotez, pp. 67–80, Perm, 1990.     

Sequential Confidence Bands for Quantile Densities Under Truncated and Censored Data

In this paper an asymptotic distribution is obtained for the maximal deviation between the kernel quantile density estimator and the quantile density when the data are subject to random left truncation and right censorship. Based on this result we propose a fully sequential procedure for construct ing a fixed-width confidence band for the quantile density on a finite interval and show that the procedure has the desired coverage probability asymptotically as the width of the band approaches zero.     

Stahel-Donoho kernel estimation for fixed design nonparametric regression models

This paper reports a robust kernel estimation for fixed design nonparametric regression models. A Stahel-Donoho kernel estimation is introduced, in which the weight functions depend on both the depths of data and the distances between the design points and the estimation points. Based on a local approximation, a computational technique is given to approximate to the incomputable depths of the errors. As a result the new estimator is computationally efficient. The proposed estimator attains a high breakdown point and has perfect asymptotic behaviors such as the asymptotic normality and convergence in the mean squared error. Unlike the depth-weighted estimator for parametric regression models, this depth-weighted nonparametric estimator has a simple variance structure and then we can compare its efficiency with the original one. Some simulations show that the new method can smooth the regression estimation and achieve some desirable balances between robustness and efficiency.     

Almost sure L1-norm convergence for data-based histogram density estimates

The main result of this paper is summarized in Theorem 1, which states that when certain conditions of a general nature are satisfied, the data-based histogram density estimator is strongly consistent in the sence that the mean absolute derivation of the estimator and the density function converges to zero almost surely for any density function, as the sample size increases to infinity.