I found "a monad is just a monoid in the category of endofunctors" the most useful explanation of monads. I didn't know what an endofunctor—or a moniod—was when I read it, but it gave me some hooks for research. Other explanations using analogies just left me confused, and nothing further I could look into.
Though that said, I revised that explanation after the others did not help me, so maybe I had absorbed enough context.
They're just locality-sensitive hash functions.
Farting out a quick one line answer is a boring comment
OP might be down voted because, even though the answer might be technically correct, it still completely fails to explain the concept (i.e., it's a useless explanation) and does so with a hint of arrogance and demeaning to readers.
Yours too, by the way.
It's like someone asks what is temperature and some smartass answers it's a scalar quantity that's mapped from a physical state into a semi-infinite continuous set. Great to know.
lsh: similarity(x, y) < thresh => E[P(d(lsh(x), lsh(y)) < 1)] > 1-eps for some eps
For a model that learns a good representation, and some suitable distance function to measure distances between embeddings (e.g. Euclidean) model: similarity(x, y) < thresh => E[P(d(emb(x), emb(y)) < r] > 1-eps
for some cutoff distance r in the vector space