4 ms·
This comparison is silly and unfair. It is tantamount to use anti-aircraft guns to fight mosquitoes then conclude that heavy weapons are too slow for anti-mosqu
by snnn 11y ago
This comparison is silly and unfair. It is tantamount to use anti-aircraft guns to fight mosquitoes then conclude that heavy weapons are too slow for anti-mosquitoes.
In these experiments, p is quite small(About 1K). So the sizeof the weight vector (or weight gradient vector) is only about 4K (for float) or 8K (for double). It should take less than 0.1 second to transfer these vectors. So there are no need to use tree allreduce or bittorrent to transfer them. These big inventions from VW and Spark become useless and burdensome. And also, in such scene, Spark's accumlator has no advantage than the tranditional map-reduce.
Another point is: Though correctness is more important than performance, it's very difficult to get a correct implementation even for the most basic problems. e.g. Most implementations of OWLQN(which is for L1 regularized convex problems) are wrong. More serious, sometimes the system you relied on is problematic or unstable by design. e.g. This Spark issue https://issues.apache.org/jira/browse/SPARK-5490 https://issues.apache.org/jira/browse/SPARK-5490 may never be fixed.
I would also recommand google's sensei(https://github.com/google/sensei https://github.com/google/sensei) as an alternative to be evaluated. I recommand it just because it comes from google. But it's not well-known yet.
- math_and_stuff 11y agoSince when did Spark invent tree allreduces (which have been standard practice within MPI for decades)?
- rxin 11y agoI don't think he said anything about Spark inventing allreduce. Spark did use torrent broadcast, which I believe is pretty unique.
- math_and_stuff 11y ago"So there [sic] are no need to use tree allreduce [...] These big inventions from Spark..."
- rxin 11y ago"tree allreduce or bittorrent"