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.)
'Breakthrough' algorithm exponentially faster than any previous one
11–20 of 20 posts
Re: 'Breakthrough' algorithm exponentially faster than any previous one
#12As 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.
Re: 'Breakthrough' algorithm exponentially faster than any previous one
#13So 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.)
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.
If this is true, then it's not an "optimization algorithm" at all.
Re: 'Breakthrough' algorithm exponentially faster than any previous one
#14Re: 'Breakthrough' algorithm exponentially faster than any previous one
#15Any link to a paper?
https://arxiv.org/pdf/1804.06355.pdf
> This algorithm therefore achieves an exponential speedup in parallel running time for submodular maximization at the expense of an arbitrarily small loss in approximation quality.
Based on this, it seems that this isn't so much a better search algorithm as much as it is a means of finding the optimum tradeoff between accuracy and speed in situations where processing the entire dataset is computationally prohibitive.
I'm no computer scientist, and algorithms in generally aren't really my area, so take this with a large grain of salt.
Re: 'Breakthrough' algorithm exponentially faster than any previous one
#16Any link to a paper?
https://arxiv.org/pdf/1804.06355.pdf
Re: 'Breakthrough' algorithm exponentially faster than any previous one
#17Re: 'Breakthrough' algorithm exponentially faster than any previous one
#18Earlier quoted context omitted.
https://scholar.harvard.edu/files/ericbalkanski/files/the-ad...
I don't think that's it. That's one of Singer's earlier works. I'm fairly sure the relevant one is https://arxiv.org/pdf/1804.06355.pdf (listed as 'under submission' at https://people.seas.harvard.edu/~yaron/papers.html , in line with the article's description)
Re: 'Breakthrough' algorithm exponentially faster than any previous one
#19To 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.
Re: 'Breakthrough' algorithm exponentially faster than any previous one
#20[0] https://spectrum.ieee.org/tech-talk/computing/software/new-o...
[1] https://scholar.harvard.edu/files/ericbalkanski/files/the-ad...