Adaptive Silhouette Tree builds semantic IDs with per-node branching for generative recommendation
_reachsumit · x · 2026-11-11
A new arXiv paper proposes Adaptive Silhouette Tree (AST) for constructing semantic IDs in generative recommendation:
- Key insight: existing residual/hierarchical vector quantization assumes tokens carry independent meaning per level, but semantic IDs are hierarchical paths whose token meanings depend on prefixes.
- Method: AST builds semantic IDs as tree paths via top-down divisive clustering, dynamically choosing each node's branching factor by maximizing the silhouette coefficient, with constrained variants enforcing minimum probability mass to improve long-tail supervision.
- Results: significant gains over strong baselines across five Amazon Review datasets of varying sizes and domains.
More from Research
- Cognitive scientists find AI generates ideas faster, but human teams stay more creative — CurieuxExplorer · 2026-11-11
- AI agents ran a biology lab end-to-end: AutoDNA completes DNA read-write cycle in 200 hours — CurieuxExplorer · 2026-11-11
- PufferLib: open-source RL library trains 60M samples/sec on one GPU — jsuarez · 2026-11-11
- Artificial Analysis Intelligence Index weights shift sharply across versions, chart reveals — HamelHusain · 2026-11-11
- Benchling's BenchBench-Refusals: GPT-6.1 Sol tops bio-safety refusals at 88.4%, unverified Opus 5.5 just 40.4% — nlarusstone · 2026-11-11
- Anthropic's top-cited AI scientists rack up 2x OpenAI's citations — NegotiationOk7535 · 2026-11-11