Risk of an estimator #
An estimation problem is defined by a parameter space Ī, a data generating kernel P : Kernel Ī š§
and a loss function ā : Ī ā šØ ā āā„0ā.
A (randomized) estimator is a kernel Īŗ : Kernel š§ šØ that maps data to estimates of a quantity
of interest that depends on the parameter. Often the quantity of interest is the parameter itself
and šØ = Ī.
The quality of an estimate y when data comes from the distribution with parameter Īø is measured
by the value of the loss function ā Īø y (lower is better).
Main definitions #
The risk is the average loss of the estimator Īŗ on data generated by P with parameter Īø,
equal to ā«ā» y, ā Īø y ā((Īŗ āā P) Īø). We do not introduce a definition for that risk, but we refer
to that integral as risk in lemma names.
avgRisk ā P Īŗ Ļ: the average of the risk of the estimator with respect to the priorĻ : Measure Ī.bayesRisk ā P Ļ: the Bayes risk with respect to the priorĻ, minimum of the average risks over all estimators, that is over all Markov kernelsĪŗ : Kernel š§ šØ.minimaxRisk ā P: minimax risk, infimum over all estimators of the maximum overĪøof the risk.
The average risk of an estimator Īŗ on an estimation task with loss ā and
data generating kernel P with respect to a prior Ļ.
Equations
Instances For
The Bayes risk with respect to a prior Ļ, defined as the infimum of the average risks of all
estimators.
Equations
Instances For
The minimax risk, defined as the infimum over estimators of the maximal risk of the estimator.