|
|
|
|
|
by tnecniv
1066 days ago
|
|
While I disagree with the RL assertion without a source, linear programs are convex, so local optima are global optima. However, unless there is some aspect of the problem which is not known (e.g., you don’t exactly know the objective or constraints), so you model it as a distribution over LPs, I really don’t know how RL will help you. Gradient-based methods can give you improvements if your problem is very large scale and doesn’t have, e.g., sparse structure, but the above claim is bold. |
|