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 pmarreck on Tuesday July 03, 2018 @10:41AM (#17450575)
So this is basically "early search-tree pruning"? Or, how is it different from that, exactly? (I believe early search-tree pruning has been used in chess algorithms for years.)
[ Parent | on HN ]
Re:'Breakthrough' algorithm exponentially faster than any pr... by sp332 on Tuesday July 03, 2018 @10:51AM (#17450654)
It samples from the data randomly, which can be massively parallelized. As it runs, it adapts the distribution that it samples from, which is similar to pruning.
[ Parent | on HN ]
Re:'Breakthrough' algorithm exponentially faster than any pr... by LyndsySimon on Tuesday July 03, 2018 @10:52AM (#17450662)
> It samples from the data randomly

If this is true, then it's not an "optimization algorithm" at all.

[ Parent | on HN ]