From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clustering Ines Chami Albert Gu Vaggos Chatziafratis Christopher Ré

Neural Information Processing Systems 

In this work, we provide the first continuous relaxation of Dasgupta's discrete optimization problem with provable quality guarantees.