On 10/12/2012 22:55, Matt Mahoney wrote:
I did find one paper in that category, which compared Kolmogorov complexity with Solomonoff probability. The difference is that Solomonoff probability combines many models M weighted by 2^-|M|, while Kolmogorov complexity just takes the shortest M as an approximation. The authors found that Solomonoff probability is more accurate at predicting sunspot data. More data sets would help, but it is still a useful result because it backs up a lot of independent results supporting ensemble methods of prediction. At least I know about such techniques because I use them for data compression.
"Differences between Kolmogorov Complexity and Solomonoff Probability: Consequences for AGI" - http://agi-conference.org/2012/wp-content/uploads/2012/12/paper_7.pdf It's Occam's razor refuted :-) -- __________ |im |yler http://timtyler.org/ [email protected] Remove lock to reply. ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
