KL miniball: defining redundancy as the radius of a smallest enclosing information disk
FrnkNlsn · x · 2026-10-08
The author frames redundancy as the radius of a "KL miniball", obtained by minimizing the right-hand-side Kullback-Leibler divergence, and links a paper computing it exactly: "On the smallest enclosing information disk". It transports the classic smallest enclosing ball problem into information geometry.
More from Research
- New OpenAI paper extends Riemann zeta zero-free region to Re(s) > 7/8 — PTenigma · 2026-10-08
- OpenAI math paper on Weil classes reported flawed, raising doubts about unformalized proofs — ctjlewis · 2026-10-08
- ZooWork-ShopRanker: open e-commerce rerankers (0.6B-8B) aligned to shopping preferences — kalyan_kpl · 2026-10-08
- Ethereum's Justin Drake calls for 'bunker mode' crypto migration as AI math advances threaten assumptions — marcvanderchijs · 2026-10-08
- Lean proof may not map 1-to-1 to paper: GPT formalization takes shortcuts on hard lemmas — ctjlewis · 2026-10-08
- 'Alignment Whack-a-Mole' gets COLM 2026 oral slot, TV interview teased — TuhinChakr · 2026-10-08