Dan Lyke 01:54:06+0000 (2026-08-18)— twitter (1/0) facebook (0/0) flutterby (1/1) — Lat,Lon: (38.225,-122.628)
Dan Lyke 01:32:54+0000 (2026-08-18)— twitter (1/0) facebook (0/0) flutterby (1/1) — Lat,Lon: (38.225,-122.628)
If you had a bunch of collections of information, perhaps envisioned by folders full of PDFs and web links, how might you lay out clusters of that?
I can use semantic embeddings, but the two largest eigenvalues doesn't seem like enough info.
Also, what's the right granularity for those embeddings? More than folder name, I'd guess.
Maybe something involving distances in that space between each of the collections? What's the right algorithm for reducing that to 2D?
Dan Lyke 00:46:00+0000 (2026-08-18)— twitter (1/0) facebook (0/0) flutterby (1/1) — Lat,Lon: (38.2249,-122.628)
Elderly friend of mine gave up on recovering his Instagram account via a password change. The process led to a screen which asked him to log in on another device, or... and the "or" wasn't clickable.
So we abandoned it.
It's amazing that a company the size of Meta is fucking it up this badly.