Well, yes, the prior that yields counting algorithms is not universal. But in many cases it’s good idea! And if you decide to use, for example, some rule-of-succession style modifications, the same situation appears.
In the case of a finite urn, you might see different biases (or none at all if your algorithm stubbornly refuses to update because you chose a silly prior).
Well, yes, the prior that yields counting algorithms is not universal. But in many cases it’s good idea! And if you decide to use, for example, some rule-of-succession style modifications, the same situation appears.
In the case of a finite urn, you might see different biases (or none at all if your algorithm stubbornly refuses to update because you chose a silly prior).