3 ms·

I agree. The failures have to be explicable if we are to trust a model.

• asah 6y ago
  Doesn't it depends on the application ? i.e. some applications can tolerate false positives/negatives ?
  • baybal2 6y ago
    May well be, but if you spend more compute, and human time checking for those corner cases than if you went with another, more consistent exhaustive search algorith, then the method looses to it economically. This is more the case the more close to bruteforce you come, like encryption cracking. Imagine, spending years of HPC cluster time, trying to break a password, while knowing you have a single digit chance to miss the right key, in a way which would be completely impossible with with a conventional solution.