The ``automatic'' robustness of minimum distance functionals (Q1825558)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4121220
Language Label Description Also known as
default for all languages
No label defined
    English
    The ``automatic'' robustness of minimum distance functionals
    scientific article; zbMATH DE number 4121220

      Statements

      The ``automatic'' robustness of minimum distance functionals (English)
      0 references
      0 references
      0 references
      1988
      0 references
      If \(\{P_{\theta}\}\) is a model indexed by real parameter \(\theta\) and \(\mu\) is a metric between probabilities then the minimum distance (MD) functional \({\hat \theta}\)(P) is a solution of \(\mu (P,P_{{\hat \theta}})=\min_{\theta}\mu (P,P_{\theta}).\) The authors show that the functional is very stable with respect to the quantity being estimated in the following sense. Denote by \(\delta\) a measure of distortion of an ideal distribution \(P_ 0\) and define the bias distortion curve for a functional T to be \[ b(\epsilon)=\sup \{| T(P)-T(P_ 0)|:\quad \delta (P,P_ 0)\leq \epsilon \}. \] The slope \(\gamma^*\) of b(\(\epsilon)\) at zero can be sometimes interpreted as the gross error sensitivity while \(\epsilon^*\) is equal to the smallest \(\epsilon\) such that the graph of b has no singularities in the ball of radius \(\leq \epsilon\) as the break down point of T. The basic proposition of the paper claims that whenever the distortion measure \(\delta =\mu\) then for the MD functionals based on \(\mu\) we have \(b_ 0(\epsilon)\leq b(\epsilon)\leq b_ 0(2\epsilon),\) where \[ b_ 0(\epsilon)=\sup \{| \theta -\theta_ 0|:\quad \mu (P_{\theta},P_ 0)\}. \] This then implies \(\gamma^*(\theta)<2 \inf_{T} \gamma^*(T)\) and \(\epsilon^*(\theta)>\sup_{T} \epsilon^*(T)/2\), where the inf and sup are taken over Fisher consistent T. Thus the MD functional is shown to have within a factor of 2 the smallest sensitivity and the best breakdown point among Fisher consistent functionals. These statements are then improved for Hilbertian distances and invariant cases. Generalizations are given for multidimensional parameter models, semiparametric models and minimum discrepancy functionals. Also consistency and finite sample robustness of MD estimators are studied.
      0 references
      minimum distance functional
      0 references
      quantitative robustness
      0 references
      gross-error sensitivity
      0 references
      breakdown point
      0 references
      Kolmogorov
      0 references
      Lévy
      0 references
      Prokhorov
      0 references
      variation
      0 references
      Hellinger distances
      0 references
      Cramér-von Mises discrepancy
      0 references
      bias distortion curve
      0 references
      break down point
      0 references
      distortion measure
      0 references
      Fisher consistent functionals
      0 references
      multidimensional parameter models
      0 references
      semiparametric models
      0 references
      minimum discrepancy functionals
      0 references
      consistency
      0 references
      finite sample robustness
      0 references

      Identifiers