UMAP 0.6 recursive init: UMAP initializing itself, 32s vs 4min for spectral
leland_mcinnes · x · 2026-11-11
UMAP 0.6's new recursive initialization works by initializing UMAP with UMAP itself: lay out a coarse version of the graph, then refine recursively. On 3.07M papers it takes just 32s (PCA: 1m14s, spectral: 4m08s) while producing a starting point far closer to the final layout than the blurry blobs of either alternative.
Related event: UMAP 0.6's Recursive Initialization Beats PCA and Spectral Methods(2 posts)→
More from Research
- Mobile AI Factory: agentic pipeline builds on-device SLMs that beat 5-shot frontier models — kalyan_kpl · 2026-11-11
- Amazon paper: multi-agent setups burn 1.4-4.7x tokens for small gains; single agent is the default — rohanpaul_ai · 2026-11-11
- MIT's Buehler builds "recursive meta-intelligence": hundreds of AI agents inhabit self-created worlds to study material failure — ProfBuehlerMIT · 2026-11-11
- Explosion launches Ellf directory: 52 NLP templates plus multi-agent annotation workflow — _inesmontani · 2026-11-11
- STABLE Optimizer Accepted at NeurIPS 2026: Taming Continual Learning Forgetting at the Optimizer Level — v_lomonaco · 2026-11-11
- From Bahdanau to FlashAttention: a timeline of attention's 8-year evolution — cneuralnetwork · 2026-11-11