News for hackers. Stuff that matters.

A comment on 'Breakthrough' algorithm exponentially faster than any previous one.

Re:'Breakthrough' algorithm exponentially faster than any pr... by LyndsySimon on Tuesday July 03, 2018 @10:51AM (#17450655)
To say this is vague would be an understatement.

As for "adaptive sampling" - by definition, if some paths are being discarded without analysis, then there's no guarantee that your selection is truly the best available.

I'm tentatively labeling this as "hype and marketing" unless I see something more detailed and accurate.

[ Parent | on HN ]
Re:'Breakthrough' algorithm exponentially faster than any pr... by Hnrobert42 on Tuesday July 03, 2018 @10:09PM (#17454871)
I think the point is that they are willing to accept the risk of not choosing the truly best available solution in return for speed. Most practical solutions for these NP problems make the same sacrifice. The authors are just claiminng to be more effecient in deriving an approximate solution.
[ Parent | on HN ]