BHTV: Eliezer Yudkowsky and Andrew Gelman
post by MichaelGR · 2009-10-13T20:09:18.348Z · LW · GW · Legacy · 4 commentsContents
4 comments
Percontations: The Nature of Probability
4 comments
Comments sorted by top scores.
comment by Jonathan_Graehl · 2009-10-13T22:01:03.510Z · LW(p) · GW(p)
What does Eliezer mean by "ideal Bayesian computation reacting to a stream of data (given some prior)"? I think he means that if a person (or AI) invents a new model, that he prefers to think of it as having had some prior all along (and had various posteriors along the way); that is, ideally there are no new models; that no actual updating was done prior to the invention of the hypothesis (or promotion of it to explicit consideration) is merely about approximation to his ideal. Did Gelman not understand Eliezer to mean that, or did he disagree that it was a useful perspective?
[Edit: in the final two minutes (@56m) it seems that Eliezer made the above explicit, and Gelman responds as if he understands it.]
I was delighted by the method of Robin Hanson reported by Eliezer: to find the correlation between two variables (or even just the distribution of a single variable in a population), look only at published papers for which the variables of interest (to him) are merely controls (for the authors' goal). In Robin's opinion, variables of political significance, when they're the focus of a paper, are distorted by dishonesty or publication bias (in some politically correct direction).
Replies from: timtylercomment by roland · 2009-10-13T21:46:40.821Z · LW(p) · GW(p)
One interesting thing in the discussion was the Netflix challenge, unfortunately they didn't get much into it. Would a simpler method be able to solve it more efficiently?
Replies from: Jonathan_Graehl↑ comment by Jonathan_Graehl · 2009-10-13T22:20:46.766Z · LW(p) · GW(p)
I saw an interesting argument that weighted average of prediction by each system should be expected to win based on a property of the error metric used (root mean square error is convex).