Set estimation: Another bridge between statistics and geometry.
A. Cuevas (2009)
Boletín de Estadística e Investigación Operativa. BEIO
Similarity:
A. Cuevas (2009)
Boletín de Estadística e Investigación Operativa. BEIO
Similarity:
Stanisław Trybuła (2002)
Applicationes Mathematicae
Similarity:
The problem of minimax estimation of parameters of multinomial distribution is considered for a loss function being the sum of the losses of the statisticians taking part in the estimation process.
Hélène Lescornel, Jean-Michel Loubes, Claudie Chabriac (2014)
ESAIM: Probability and Statistics
Similarity:
We consider a model selection estimator of the covariance of a random process. Using the Unbiased Risk Estimation (U.R.E.) method, we build an estimator of the risk which allows to select an estimator in a collection of models. Then, we present an oracle inequality which ensures that the risk of the selected estimator is close to the risk of the oracle. Simulations show the efficiency of this methodology.
Rafail Khasminskii (2004)
SORT
Similarity:
A survey of some recent results on nonparametric on-line estimation is presented. The first result deals with an on-line estimation for a smooth signal S(t) in the classic 'signal plus Gaussian white noise' model. Then an analogous on-line estimator for the regression estimation problem with equidistant design is described and justified. Finally some preliminary results related to the on-line estimation for the diffusion observed process are described.
Karine Bertin, Nicolas Klutchnikoff (2014)
ESAIM: Probability and Statistics
Similarity:
In this paper we are interested in the estimation of a density − defined on a compact interval of ℝ− from independent and identically distributed observations. In order to avoid boundary effect, beta kernel estimators are used and we propose a procedure (inspired by Lepski’s method) in order to select the bandwidth. Our procedure is proved to be adaptive in an asymptotically minimax framework. Our estimator is compared with both the cross-validation algorithm and the oracle estimator...
Yuri A. Kutoyants (2004)
SORT
Similarity:
We present a review of several results concerning invariant density estimation by observations of ergodic diffusion process and some related problems. In every problem we propose a lower minimax bound on the risks of all estimators and then we construct an asymptotically efficient estimator.
Romain Azaïs, François Dufour, Anne Gégout-Petit (2013)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
This paper is devoted to the nonparametric estimation of the jump rate and the cumulative rate for a general class of non-homogeneous marked renewal processes, defined on a separable metric space. In our framework, the estimation needs only one observation of the process within a long time. Our approach is based on a generalization of the multiplicative intensity model, introduced by Aalen in the seventies. We provide consistent estimators of these two functions, under some assumptions...
Jan Ámos Víšek (1992)
Kybernetika
Similarity:
Cristina Butucea (2004)
SORT
Similarity:
In this paper we consider a kernel estimator of a density in a convolution model and give a central limit theorem for its integrated square error (ISE). The kernel estimator is rather classical in minimax theory when the underlying density is recovered from noisy observations. The kernel is fixed and depends heavily on the distribution of the noise, supposed entirely known. The bandwidth is not fixed, the results hold for any sequence of bandwidths decreasing to 0. In particular the...
Nicolas W. Hengartner, Éric Matzner-Løber (2009)
ESAIM: Probability and Statistics
Similarity:
This paper introduces a computationally tractable density estimator that has the same asymptotic variance as the classical Nadaraya-Watson density estimator but whose asymptotic bias is zero. We achieve this result using a two stage estimator that applies a multiplicative bias correction to an oversmooth pilot estimator. Simulations show that our asymptotic results are available for samples as low as , where we see an improvement of as much as 20% over the traditionnal estimator. ...
Piotr Oprocha, Guohua Zhang (2011)
Studia Mathematica
Similarity:
We introduce the concept of weakly mixing sets of order n and show that, in contrast to weak mixing of maps, a weakly mixing set of order n does not have to be weakly mixing of order n + 1. Strictly speaking, we construct a minimal invertible dynamical system which contains a non-trivial weakly mixing set of order 2, whereas it does not contain any non-trivial weakly mixing set of order 3. In dimension one this difference is not that much visible, since we prove that...