Title of article :
Complexity of simple nonlogarithmic loss functions
Author/Authors :
J.، Rissanen, نويسنده ,
Issue Information :
ماهنامه با شماره پیاپی سال 2003
Abstract :
The loss complexity for nonlogarithmic loss functions is defined analogously to the stochastic complexity for logarithmic loss functions such that its mean provides an achievable lower bound for estimation, the mean taken with respect to the worst case data generating distribution. The loss complexity also provides a lower bound for the worst case mean prediction error for all predictors. For the important (alpha)-loss functions |y(...)|/sup (alpha)/, where y-(...) denotes the prediction or fitting error and (alpha) is in the interval, an accurate asymptotic formula for the loss complexity is given.
Journal title :
IEEE Transactions on Information Theory
Journal title :
IEEE Transactions on Information Theory