An Approximate MSE Expression for Maximum Likelihood and Other Implicitly Defined Estimators of Non-Random Parameters

Date

2023-03-01

Author

Mehmetcik, Erdal
Orguner, Umut
Candan, Çağatay

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

196
views

0
downloads

An approximate mean square error (MSE) expression for the performance analysis of implicitly defined estimators of non-random parameters is proposed. An implicitly defined estimator (IDE) declares the minimizer/maximizer of a selected cost/reward function as the parameter estimate. The maximum likelihood (ML) and the least squares estimators are among the well known examples of this class. In this paper, an exact MSE expression for implicitly defined estimators with a symmetric and unimodal objective function is given. It is shown that the expression reduces to the Cramer-Rao lower bound (CRLB) and misspecified CRLB in the large sample size regime for ML and misspecified ML estimation, respectively. The expression is shown to yield the Ziv-Zakai bound (without the valley filling function) for the maximum a posteriori (MAP) estimator when it is used in a Bayesian setting, that is, when an a-priori distribution is assigned to the unknown parameter. In addition, extension of the suggested expression to the case of nuisance parameters is studied and some approximations are given to ease the computations for this case. Numerical results indicate that the suggested MSE expression not only predicts the estimator performance in the asymptotic region; but it is also applicable for the threshold region analysis, even for IDEs whose objective functions do not satisfy the symmetry and unimodality assumptions. Advantages of the suggested MSE expression are its conceptual simplicity and its relatively straightforward numerical calculation due to the reduction of the estimation problem to a binary hypothesis testing problem, similar to the usage of Ziv-Zakai bounds in random parameter estimation problems.

Subject Keywords

Cramer-Rao Lower Bound, Implicitly Defined Estimator, Maximum Likelihood, Misspecified Maximum Likelihood, Parameter Estimation, Performance Prediction, Ziv-Zakai Bound

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85141919504&origin=inward
https://hdl.handle.net/11511/101649

Journal

Signal Processing

DOI

https://doi.org/10.1016/j.sigpro.2022.108838

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

A Methodology to Implement Box-Cox Transformation When No Covariate is Available Dag, Osman; Asar, Ozgur; İlk Dağ, Özlem (2014-01-01) Box-Cox transformation is one of the most commonly used methodologies when data do not follow normal distribution. However, its use is restricted since it usually requires the availability of covariates. In this article, the use of a non-informative auxiliary variable is proposed for the implementation of Box-Cox transformation. Simulation studies are conducted to illustrate that the proposed approach is successful in attaining normality under different sample sizes and most of the distributions and in esti...
A new anisotropic perfectly matched layer medium for mesh truncation in finite difference time domain analysis Tong, MS; Chen, YC; Kuzuoğlu, Mustafa; Mittra, R (1999-09-01) In this paper an unsplit anisotropic perfectly matched layer (PML) medium, previously utilized in the context of finite element analysis, is implemented in the finite difference time domain (FDTD) algorithm. The FDTD anisotropic PML is easy to implement in the existing FDTD codes, and is well suited for truncating inhomogeneous and layered media without special treatment required in the conventional PML approach. A further advantage of the present approach is improved performance at lower frequencies. The a...
A binomial noised model for cluster validation Toledano-Kitai, Dvora; Avros, Renata; Volkovich, Zeev; Weber, Gerhard Wilhelm; Yahalom, Orly (IOS Press, 2013-01-01) Cluster validation is the task of estimating the quality of a given partition of a data set into clusters of similar objects. Normally, a clustering algorithm requires a desired number of clusters as a parameter. We consider the cluster validation problem of determining the optimal ("true") number of clusters. We adopt the stability testing approach, according to which, repeated applications of a given clustering algorithm provide similar results when the specified number of clusters is correct. To implemen...
A SUPER-SET OF PATTERSON-WIEDEMANN FUNCTIONS: UPPER BOUNDS AND POSSIBLE NONLINEARITIES Kavut, Selcuk; MAİTRA, Subhamoy; Özbudak, Ferruh (2018-01-01) Construction of Boolean functions on an odd number of variables with nonlinearity exceeding the bent concatenation bound is one of the most difficult combinatorial problems within the domain of Boolean functions. This problem also has deep implications in coding theory and cryptology. Patterson and Wiedemann demonstrated instances of such functions back in 1983. For more than three decades efforts have been channeled into obtaining such instances. For the first time, in this paper we explore nontrivial uppe...
A Meta-Heuristic Paradigm for solving the Forward Kinematics of 6-6 General Parallel Manipulator Chandra, Rohitash; Frean, Marcus; Rolland, Luc (2009-12-18) The forward kinematics of the general Gough platform, namely the 6-6 parallel manipulator is solved using hybrid meta-heuristic techniques in which the simulated annealing algorithm replaces the mutation operator in a genetic algorithm. The results are compared with the standard simulated annealing and genetic algorithm. It shows that the standard simulated annealing algorithm outperforms standard genetic algorithm in terms of computation time and overall accuracy of the solution on this problem. However, t...

Citation Formats

E. Mehmetcik, U. Orguner, and Ç. Candan, “An Approximate MSE Expression for Maximum Likelihood and Other Implicitly Defined Estimators of Non-Random Parameters,” Signal Processing, vol. 204, pp. 0–0, 2023, Accessed: 00, 2023. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85141919504&origin=inward.