ohxh
Joined 6 years ago
Joined 6 years ago
https://planetscale.com/benchmarks/aurora
Seems a bit better, but they benchmarked on a kind of small db (500gb db / db.r8g.xlarge)
But, they suggest this is because "Upon awakening, a leftward sleeping position would provide a fast left visual field view of objects", which seems suspect. When my cats sleep on their left, it's their left eye that's obscured by their paw, and their right eye that has a better field of view!
I always thought this problem was a funny choice for the comic, because it’s not that esoteric! It’s equivalent to asking about a 2d simple random walk on a lattice, which is fairly common. And in general the electrical network <-> random walk correspondence is a useful perspective too
[1] https://hedgehogreview.com/issues/markets-and-the-good/artic...
I always wondered: if we want to preserve distances between a billion points within 10%, that would mean we need ~18k dimensions. 1% would be 1.8m. Is there a stronger version of the lemma for points that are well spread out? Or are embeddings really just fine with low precision for the distance?
[1] https://en.wikipedia.org/wiki/Johnson%E2%80%93Lindenstrauss_...
I assume they mean the hidden subgroup problem for abelian groups? Later they mention short integer solutions (SIS) and learning with errors (LWE), which by my understanding both rely on the hardness of the shortest vector problem, corresponding to the hidden subgroup problem for some non-abelian groups. I haven't read into this stuff for a while, though