A new variable bandwidth selector for kernel estimation is proposed. The application of this bandwidth selector leads to kernel estimates that achieve optimal rates of convergence over Besov classes. This implies that the procedure adapts to spatially inhomogeneous smoothness. In particular, the estimates share optimality properties with wavelet estimates based on thresholding of empirical wavelet coefficients.
Suppose that one observes a process Y on the unit interval, where dY(t) =n1/2 f(t)dt +dW (t) with an unknown function parameter f, given scale parameter n <=1 ("sample size") and standard Brownian motion W. We propose two classes of tests of qualitative nonparametric hypotheses about f such as monotonicity or concavity. These tests are asymptotically optimal and adaptive in a certain sense. They are constructed via a new class of multiscale statistics and an extension of Lévy's modulus of continuity of Brownian motion.
Let a function f be observed with a noise. We wish to test the null hypothesis that the function is identically zero, against a composite nonparametric alternative: functions from the alternative set are separated away from zero in an integral (e.g., $L_2$) norm and also possess some smoothness properties. The minimax rate of testing for this problem was evaluated in earlier papers by Ingster and by Lepski and Spokoiny under different kinds of smoothness assumptions. It was shown that both the optimal rate of testing and the structure of optimal (in rate) tests depend on smoothness parameters which are usually unknown in practical applications. In this paper the problem of adaptive (assumption free) testing is considered. It is shown that adaptive testing without loss of efficiency is impossible. An extra log log-factor is inessential but unavoidable payment for the adaptation. A simple adaptive test based on wavelet technique is constructed which is nearly minimax for a wide range of Besov classes.
The problem of optimal adaptive estimation of a function at a given point from noisy data is considered. Two procedures are proved to be asymptotically optimal for different settings. First we study the problem of bandwidth selection for nonparametric pointwise kernel estimation with a given kernel. We propose a bandwidth selection procedure and prove its optimality in the asymptotic sense. Moreover, this optimality is stated not only among kernel estimators with a variable bandwidth. The resulting estimator is asymptotically optimal among all feasible estimators. The important feature of this procedure is that it is fully adaptive and it "works" for a very wide class of functions obeying a mild regularity restriction. With it the attainable accuracy of estimation depends on the function itself and is expressed in terms of the "ideal adaptive bandwidth" corresponding to this function and a given kernel. The second procedure can be considered as a specialization of the first one under the qualitative assumption that the function to be estimated belongs to some Hölder class $\Sigma (\beta, L)$ with unknown parameters $\beta, L$. This assumption allows us to choose a family of kernels in an optimal way and the resulting procedure appears to be asymptotically optimal in the adaptive sense in any range of adaptation with $\beta \leq 2$.