http://elis.dvo.ru/~lab_11/bib/hershkowitz-nadal.pdf
I found a thesis on the topic.
Seems the upper bound of estimation when using bayesian probability for estimating parameters with data gets overestimated when the size of the data grows.
It does not makes sense to me, can someone explain this to me as if I was an idiot?
PS one of the searcher in his lab used to say: if you try to find to hard a physical law, you might eventually find it.
(quote from the thesis below)
Most of the results concerning the behavior of the mutual
information, observed for this particular family, are ‘‘universal,’’ in that they will be qualitatively the same for any problem that can be formulated as either a parameter estimation task or a neural coding task.
....
Besides the asymptotic regime p large, N arbitrary, we
have also considered the case of large N at any given value
of a5p/N. In this regime we have both replica calculations
and exact bounds, in particular, an upper bound for the class information and explicit upper and lower bounds for the mutual information obtained with the techniques of [7]. The results suggest that the replica symmetry ansatz give the correct solution. The lower bound is then quite good whereas the upper bound overestimate the mutual information by a factor that keeps increasing with the data size.