3 ms·
We’re optimistic about using our own algorithms and models to evaluate another model. In theoretical computer science, it is easier to verify a correct solution
by darren_hsu 3y ago
We’re optimistic about using our own algorithms and models to evaluate another model. In theoretical computer science, it is easier to verify a correct solution than to generate a correct solution (P vs NP problem).
- lancesells 3y agoDo you, or will you, use human labor in any instance on evaluating images?
- darren_hsu 3y agoWe currently don't since its not scalable
- vore 3y agoNot to nitpick but this is NOT the right takeaway from P vs NP.
- bagels 3y agoI don't think p vs np has anything to do with it, but also, I don't think your maxim is always (but maybe often is) true anyways. Problem: traveling salesman, solution: one particular path. I think verification that the solution is optimal in this case is exactly the same problem as finding the solution.