Abstract
Average-case analysis provides knowledge about the quality of estimation algorithms in the case when the influence of outliers (exceptionally difficult elements) is to be neglected. This is in contrast with the worst-case analysis, where exceptionally difficult elements are of particular interest. In this paper we consider the average behavior of estimation algorithms based on corrupted information, with values in a subspace of the problem element space. We study two local average errors, with respect to probability measures defined by a class of weight functions. We define the optimal algorithm and derive exact error formulas, in Euclidean norms in problem element and information spaces. The formulas explicitly show the dependence of the errors on basic components of the problem, in particular on the weights. Attention is paid to the class of isotropic weight functions, examples of which are provided by truncated Gaussian weight functions. An extension of the results to non-Euclidean norms in the information space in a special case is shown.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Mathematics of Control, Signals, and Systems (MCSS)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.