Performance Bounds for Parameter Estimation under Misspecified Models: Fundamental findings and applications
Not on the map. Why?
Abstract (arXiv)
Inferring information from a set of acquired data is the main objective of any signal processing (SP) method. In particular, the common problem of estimating the value of a vector of parameters from a set of noisy measurements is at the core of a plethora of scientific and technological advances in the last decades; for example, wireless communications, radar and sonar, biomedicine, image processing, and seismology, just to name a few. Developing an estimation algorithm often begins by assuming a statistical model for the measured data, i.e. a probability density function (pdf) which if correct, fully characterizes the behaviour of the collected data/measurements. Experience with real data, however, often exposes the limitations of any assumed data model since modelling errors at some level are always present. Consequently, the true data model and the model assumed to derive the estimation algorithm could differ. When this happens, the model is said to be mismatched or misspecified. Therefore, understanding the possible performance loss or regret that an estimation algorithm could experience under model misspecification is of crucial importance for any SP practitioner. Further, understanding the limits on the performance of any estimator subject to model misspecification is of practical interest. Motivated by the widespread and practical need to assess the performance of a mismatched estimator, the goal of this paper is to help to bring attention to the main theoretical findings on estimation theory, and in particular on lower bounds under model misspecification, that have been published in the statistical and econometrical literature in the last fifty years. Secondly, some applications are discussed to illustrate the broad range of areas and problems to which this framework extends, and consequently the numerous opportunities available for SP researchers.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Sep 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
4 papers.
- 2022Inverse Extended Kalman Filter -- Part II: Highly Non-Linear and Uncertain Systemscited by 5
- 2022Learning to Bound: A Generative Cram'er-Rao Boundcited by 2
- 2025Towards Smarter Sensing: 2D Clutter Mitigation in RL-Driven Cognitive MIMO Radarcited by 1
- 2026A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptionscited by 1
- 2026A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions11 Feb 2026
- 2025Towards Smarter Sensing: 2D Clutter Mitigation in RL-Driven Cognitive MIMO Radar7 Feb 2025
- 2022Inverse Extended Kalman Filter -- Part II: Highly Non-Linear and Uncertain Systems13 Aug 2022
- 2022Learning to Bound: A Generative Cram'er-Rao Bound7 Mar 2022