Kavli Affiliate: Max Tegmark | First 5 Authors: Andrew K. Tan, Max Tegmark, Isaac L. Chuang, , | Summary: At the heart of both lossy compression and clustering is a trade-off between the fidelity and size of the learned representation. Our goal is to map out and study the Pareto frontier that quantifies this trade-off. […]
Continue.. Pareto-optimal clustering with the primal deterministic information bottleneck