Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRobust Estimation of Mean Values
127
0
0.0
(
0
)
Added by
Xinjia Chen
Publication date
2008
fields
Informatics Engineering
and research's language is
English
Authors
Xinjia Chen
Ask ChatGPT about the research
No Arabic abstract
In this paper, we develop a computational approach for estimating the mean value of a quantity in the presence of uncertainty. We demonstrate that, under some mild assumptions, the upper and lower bounds of the mean value are efficiently computable via a sample reuse technique, of which the computational complexity is shown to posses a Poisson distribution.
rate research
Read More
In this paper, we develop a general approach for probabilistic estimation and optimization. An explicit formula and a computational approach are established for controlling the reliability of probabilistic estimation based on a mixed criterion of absolute and relative errors. By employing the Chernoff-Hoeffding bound and the concept of sampling, the minimization of a probabilistic function is transformed into an optimization problem amenable for gradient descendent algorithms.
A large class of problems in sciences and engineering can be formulated as the general problem of constructing random intervals with pre-specified coverage probabilities for the mean. Wee propose a general approach for statistical inference of mean values based on accumulated observational data. We show that the construction of such random intervals can be accomplished by comparing the endpoints of random intervals with confidence sequences for the mean. Asymptotic results are obtained for such sequential methods.
We study the problem of outlier robust high-dimensional mean estimation under a finite covariance assumption, and more broadly under finite low-degree moment assumptions. We consider a standard stability condition from the recent robust statistics literature and prove that, except with exponentially small failure probability, there exists a large fraction of the inliers satisfying this condition. As a corollary, it follows that a number of recently developed algorithms for robust mean estimation, including iterative filtering and non-convex gradient descent, give optimal error estimators with (near-)subgaussian rates. Previous analyses of these algorithms gave significantly suboptimal rates. As a corollary of our approach, we obtain the first computationally efficient algorithm with subgaussian rate for outlier-robust mean estimation in the strong contamination model under a finite covariance assumption.
Yang (1978) considered an empirical estimate of the mean residual life function on a fixed finite interval. She proved it to be strongly uniformly consistent and (when appropriately standardized) weakly convergent to a Gaussian process. These results are extended to the whole half line, and the variance of the the limiting process is studied. Also, nonparametric simultaneous confidence bands for the mean residual life function are obtained by transforming the limiting process to Brownian motion.
In this paper, we are basically discussing on a class of Baranchik type shrinkage estimators of the vector parameter in a location model, with errors belonging to a sub-class of elliptically contoured distributions. We derive conditions under Schwartz space in which the underlying class of shrinkage estimators outperforms the sample mean. Sufficient conditions on dominant class to outperform the usual James-Stein estimator are also established. It is nicely presented that the dominant properties of the class of estimators are robust truly respect to departures from normality.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
