1989•Biometrical JournalRequires access

Estimators Asymptotically Minimax in Wide Sense

Igor Vajda

Open publisher page 2 citations

Abstract

Abstract Estimators of location are considered. Huber (1964) introduced estimators asymptotically minimax on the set 𝔖 of all regular M‐estimators, for a given contamination ε and for the set Q of all regular symmetric alternative data sources. We extend his concept by admitting arbitrary sets 𝔖 of regular M‐estimators and arbitrary sets Q or regular symmetric alternative sources, and also by replacing the singletons [ε] ⊂ (0, 1) by arbitrary subsets 𝔖 ⊂ (0, 1). The resulting estimator cannot in general be evaluated explicitly. But for finite T it exists and, if 𝔖 and Q are finite too, it may be chosen by a computer. This extra burden is justified in some cases since more than 100% relative efficiency gain against all Huber's Hk is achievable in this manner. Such gains are achieved for a nontrivial family Q by the estimator proposed in Vajda (1984), with redescending influence curve, which is shown to be asymptotically minimax in wide sense.

About this research paper

What this paper is about

Abstract Estimators of location are considered. Huber (1964) introduced estimators asymptotically minimax on the set 𝔖 of all regular M‐estimators, for a given contamination ε and for the set Q of all regular symmetric alternative data sources. We extend his concept by admitting arbitrary sets 𝔖 of regular M‐estimators and arbitrary sets Q or regular symmetric alternative sources, and also by replacing the singletons [ε] ⊂ (0, 1) by arbitrary subsets 𝔖 ⊂ (0, 1). The resulting estimator cannot in general be evaluated explicitly. But for finite T it exists and, if 𝔖 and Q are finite too, it may be chosen by a computer. This extra burden is justified in some cases since more than 100% relative efficiency gain against all Huber's Hk is achievable in this manner. Such gains are achieved for a nontrivial family Q by the estimator proposed in Vajda (1984), with redescending influence curve, which is shown to be asymptotically minimax in wide sense.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract Estimators of location are considered. Huber (1964) introduced estimators asymptotically minimax on the set 𝔖 of all regular M‐estimators, for a given contamination ε and for the set Q of all regular symmetric alternative data sources. We extend his concept by admitting arbitrary sets 𝔖 of regular M‐estimators and arbitrary sets Q or regular symmetric alternative sources, and also by replacing the singletons [ε] ⊂ (0, 1) by arbitrary subsets 𝔖 ⊂ (0, 1). The resulting estimator cannot in general be evaluated explicitly. But for finite T it exists and, if 𝔖 and Q are finite too, it may be chosen by a computer. This extra burden is justified in some cases since more than 100% relative efficiency gain against all Huber's Hk is achievable in this manner. Such gains are achieved for a nontrivial family Q by the estimator proposed in Vajda (1984), with redescending influence curve, which is shown to be asymptotically minimax in wide sense.

Key concepts: Minimax, Estimator, Mathematics, Applied mathematics, Set (abstract data type), Minimax estimator, Asymptotically optimal algorithm, Finite set

Related papers

Back to paper searchBrowse research topicsOriginal source
Estimators Asymptotically Minimax in Wide Sense — Research Paper | ScholarLens