= 27d567bc2d48d9f40e9ccc20ea370b15)
owencb comments on The Value Learning Problem - LessWrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (37)
I'll give examples, though this is more representative than a claim that you should change these details.
On page 2, you say "In linear programming, the maximum of an objective function tends to occur on a vertex of the space." Here "tends to" seems unnecessary hedging -- I think this is just a theorem! Perhaps there's an interpretation where it fails, but you hedge far less on other much more controversial things.
On the other hand the very next sentence: "Similarly, the optimal solution to a goal tends to occur on an edge (hyperface) of the possibility space." appears to have a similar amount of hedging for what is a much weaker sense of "tends", and what's a much weaker conclusion (being in a hyperface is much weaker than being at a vertex).
Another example: the top paragraph of the right column of page 3 uses "must" but seems to presuppose an internal representation with utility functions.
Thanks. I've re-worded these particular places, and addressed a few other things that pattern-matched on a quick skim. I don't have time to go back over this paper with a fine comb, but if you find other examples, I'm happy to tweak the wording :-)
Thanks for the quick update! Perhaps this will be most useful when writing new things, as I agree that it may not be worth your time to rewrite carefully (and should have said that).
It is. If there exists an optimal solution, at least one vertex will be optimal, and as RyanCarey points out, if a hyperface is optimal it will have at least one vertex.
A stronger statement is that the Simplex algorithm will always return an optimal vertex (interior point algorithms will return the center of the hyperface, which is only a vertex if that's the only optimal point).
... Even if the optimum occurs along an edge, it'll at least include vertices.