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.

Manfred comments on What are you working on? August 2012 - Less Wrong Discussion

7 Post author: RobertLumley 03 August 2012 03:10PM

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

Article Navigation

Comments (95)
Tags: community waywo

Comments (95)

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

Comment author: Manfred 04 August 2012 08:19:14AM *  8 points [-]

Decision-making for an Agent with Bounded Resources

C. Manfred
Department of Computer Science, University of Illinois at Urbana-Champaign

We consider the behavior of a decision-making agent with bounded resources, which faces problems whose complete solution exceeds those resources. While there are several available methods to treat the resulting "logical uncertainty," a rigorous treatment has until now escaped realization. We show that, as intuitively expected, there exists an optimal decision-making procedure analogous to expected-utility maximization. We present two practical algorithms for determining the weights in this procedure, which are shown to be correct in the extreme limits. When these algorithms are interpolated, the resulting weights do not differ from the optimum by more than a small constant.

Comment author: gwern 04 August 2012 03:10:31PM *  10 points [-]

Comment on Manfred 2012

G. Branwen
Department of Commenting, LessWrong at The Internets

In Manfred (2012), the author presents a result on an asymptotically ideal utility-maximization of a function in the presence of incomplete information. We discuss the hidden assumption used in the proof, and exhibit a repaired proof which can be shown to be only a special case of long-established asymptotic universal search algorithms based on Solomonoff induction over all computably enumerable functions, from which the Manfred algorithm does not improve except by a constant factor ε in limited domains.

Comment author: shminux 04 August 2012 09:34:25PM 0 points [-]

Both abstracts are pretty impressive. I certainly could not tell the difference from a real thing. Maybe this should be a regular feature. Care to fake something EY would author?

Powered by Reddit Powered by Reddit