3 ms·
EDIT: I misread the quote below- it applies to a distribution over functions, not examples. My bad and thanks to one of the authors of the post for politely cor
by YeGoblynQueenne 7y ago
EDIT: I misread the quote below- it applies to a distribution over functions, not examples. My bad and thanks to one of the authors of the post for politely correcting me in the replying comment.
>> But there is one core problem with the Bayesian framework. In practice, we
never have access to the prior distribution Pr(f)! Who could ever claim to
know the real-world distribution of functions that solve classification tasks?
Not us, and certainly not Bayesians. Instead, BNNs simply choose an arbitrary
prior distribution q(f) over functions, and Bayesian inference is performed to
compute q(f∣D). The question of whether q(f) is close to the true distribution
Pr(f) is swept under the rug.
This is true but it's also nothing new: it's the standard PAC-Learning
assumption that the examples (the dataset) are drawn from the same
distribution as the target theory (the real-world distribution).
This assumption and the complete impossibility to verify it in practice is not
unique to Bayesian Neural Nets. It is true for _every_ machine learning
algorithm.
And this is certainly no surprise for machine learning researchers (or, if it
is, it is really concerning that it is). So the done thing in machine learning
research is to demonstrate that, under PAC-Learning assumptions, a certain
technique or algorithm _can_ correctly identify a hypothesis that approximates
a "true" function to within some amount of error.
I mean to say, when people publish papers reporting a new SOTA on
such-and-such dataset, they are not really claiming that their technique
somehow finds the "true" distribution of the real-world process that generated
the data in their dataset. They're claiming "we can correctly classify
instances in this dataset and if PAC-Learning assumptions hold, this technique
should also work in real-world data from the same domain".
Of course this is often left implicit- and the article makes me wonder to
what extent this is because researches tend to forget or even :gasp: ignore it
completely. A disturbing thought.
- cgel 7y agoAuthor. There is a misunderstanding in your argument. Your point is about the dataset being sampled from the true distribution. We are happy with that assumption (it's orthogonal to our point). The problem we have is that to apply Bayes rule you NEED a prior distribution over the correct functions, applied to the points on the dataset, and to the points outside of the dataset. In other words, one thing is assuming that the dataset is representative of the (unknown) classification task, the other is to assume that you know what the distribution over classification tasks is.
- YeGoblynQueenne 7y agoHi. Yes, I see- I misunderstood this. My apologies for the hasty reading of your post. But, in that case, there does exist a very good generalisation prior on function space that is well known and well understood: the simplest hypothesis (e.g. the one with the smallest minumum description length) is always better (because it results in a reduction of the hypothesis search space with a corresponding reduction to the size of the error on unseen data while keeping the number of examples constant). See: Occam's Razor (Blumer and friends): https://www.sciencedirect.com/science/article/pii/0020019087901141 https://www.sciencedirect.com/science/article/pii/0020019087... Quoting from the abstract: We show that a polynomial learning algorithm, as defined by ["A theory of the learnable", Valiant 1984], is obtained whenever there exists a polynomial-time method of producing, for any sequence of observations, a nearly minimum hypothesis that is consistent with these observations. Would that begin to address your concerns?
- deleted 7y ago[deleted]