Re:Stochastic Superoptimization [pdf]
by jules on Tuesday April 29, 2014 @05:55AM
(#7665938)
No, they are completely different. Sampling problem is: given a probability distribution P(x), draw random samples from such that each x has probability P(x) to be generated. Optimization problem is: given a cost function f(x), find the x that minimizes f(x).
[ Parent
| on HN ]
What I meant was, approximal optimization problems are a species of search problem (find a solution "at least this good"), and search problems are equivalent to sampling problems (per the reference) in the sense that either is reducible to the other.
(Obviously search and sampling problems have different definitions.)