Lumifer comments on In Praise of Maximizing – With Some Caveats - Less Wrong

22 Post author: wallowinmaya 15 March 2015 07:40PM

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

Comments (19)

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

Comment author: Lumifer 16 March 2015 03:11:30PM 1 point [-]

I would probably put this one in the category of "satisficing," since this is just a generalization of "good enough" from "objective value" to "convergence criterion."

You can just as easily put it into the category of "maximizing" since you're maximizing your expected return (gain - costs).

Comment author: Vaniver 16 March 2015 03:22:05PM 1 point [-]

You can just as easily put it into the category of "maximizing" since you're maximizing your expected return (gain - costs).

In other frameworks, yes: a biologist or economist would think it natural to talk about real-world maximization (read: improvement) where costs are very relevant to profit.

In the framework of computational complexity, maximization problems are characterized by searching over a set of potential solutions and generating a proof that a particular solution is the best of those solutions. In the worst case where there is no structure on the set, that's an O(N) operation (start at the first element in the set, compare the element in memory to element i+1 and put the bigger one in memory) on a set that's typically exponential in problem size. So the generalization of expected return to maximization in this view is proving that a heuristic approach is the best possible heuristic approach to problems of a particular class--which is not a good concrete example of satisficing!

Comment author: Lumifer 16 March 2015 04:07:03PM 0 points [-]

maximization problems are characterized by searching over a set of potential solutions and generating a proof that a particular solution is the best of those solutions

You're just saying that in this framework the function-to-be-optimized does not contain search/optimization costs. I think for most real-life optimization problems it's a shortcoming :-)

Comment author: dxu 17 March 2015 04:34:18AM *  0 points [-]

I don't believe the field of computational complexity makes reference to search/opportunity costs. As to whether this is a shortcoming, well, I'll leave that to the professional mathematicians to decide.