You're looking at Less Wrong's discussion board. This includes all posts, including those that haven't been promoted to the front page yet. For more information, see About Less Wrong.

ThisSpaceAvailable comments on Approximating Solomonoff Induction - Less Wrong Discussion

6 Post author: Houshalter 29 May 2015 12:23PM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Article Navigation

Comments (45)
Tags: neural solomonoff networks induction aixi

Comments (45)

You are viewing a single comment's thread. Show more comments above.

Comment author: Lumifer 02 June 2015 02:48:35AM 0 points [-]

It's true that it's only possible to find local optima, but that's true with any algorithm.

Whaaaat? Exhaustive search is an algorithm, it will find you the global optimum anywhere. For many structures of the search space it's not hard to find the global optimum with appropriate algorithms.

Everything approximates Bayesian inference, it's just a matter of how ideal the approximation is. If you have enough data, the maximum liklihood approaches bayesian inference.

Huh?

Comment author: ThisSpaceAvailable 02 June 2015 04:00:44AM 1 point [-]

You can't do an exhaustive search on an infinite set.

Comment author: Lumifer 02 June 2015 04:57:34AM 0 points [-]

You can't do an exhaustive search on an infinite set.

I haven't seen any infinite sets in reality.

Comment author: ThisSpaceAvailable 04 June 2015 10:30:42PM -1 points [-]

The set of possible Turing Machines is infinite. Whether you consider that to satisfy your personal definition of "seen" or "in reality" isn't really relevant.

Powered by Reddit Powered by Reddit