Fetching the paper…
Reading the bibliography…
Recently, there has been a rising surge of momentum for deep representation learning in hyperbolic spaces due to theirhigh capacity of modeling data like knowledge graphs or synonym hierarchies, possessing hierarchical structure.
R. Kleinberg, “Geographic routing using hyperbolic space,” in IEEE INFOCOM 2007-26th IEEE International Conference on Computer Communications . IEEE, 2007, pp. 1902–1909
1909
Earlier work this paper cites.
G. Barth, “Stereographic projection,” 1937
1937
Earlier work this paper cites.
M. R. Fréchet, “Les éléments aléatoires de nature quelconque dans un espace distancié,” Annales de l’institut Henri Poincaré , vol. 10, no. 4, pp. 215–310, 1948
1948
Earlier work this paper cites.
M. Fréchet, “Les éléments aléatoires de nature quelconque dans un espace distancié,” in Annales de l’institut Henri Poincaré , vol. 10, no. 4, 1948, pp. 215–310
1948
Earlier work this paper cites.
R. T. Rockafellar et al. , “Extension of fenchel’duality theorem for convex functions,” Duke mathematical journal , vol. 33, no. 1, pp. 81–89, 1966
1966
Earlier work this paper cites.
A. M. Collins, M. R. Quillian et al. , “Retrieval time from semantic memory,” Journal of verbal learning and verbal behavior , vol. 8, no. 2, pp. 240–247, 1969
1969
Earlier work this paper cites.
H. Karcher, “Riemannian center of mass and mollifier smoothing,” Communications on pure and applied mathematics , vol. 30, no. 5, pp. 509–541, 1977
1977
Earlier work this paper cites.
R. Sibson, “Studies in the robustness of multidimensional scaling: Perturbational analysis of classical scaling,” Journal of the Royal Statistical Society: Series B (Methodological) , vol. 41, no. 2, pp. 217–229, 1979
1979
Earlier work this paper cites.
B. O’neill, Semi-Riemannian geometry with applications to relativity . Academic press, 1983
1983
Earlier work this paper cites.
M. Gromov, “Hyperbolic groups,” in Essays in group theory . Springer, 1987, pp. 75–263
1987
Earlier work this paper cites.
S. Gallot, D. Hulin, and J. Lafontaine, Riemannian geometry . Springer, 1990, vol. 2
1990
Earlier work this paper cites.
M. P. d. Carmo, Riemannian geometry . Birkhäuser, 1992
1992
Earlier work this paper cites.
S. Katok, Fuchsian groups . University of Chicago press, 1992
1992
Earlier work this paper cites.
M. A. Hearst, “Automatic acquisition of hyponyms from large text corpora,” in Coling 1992 volume 2: The 15th international conference on computational linguistics , 1992
1992
Earlier work this paper cites.
N. Linial, E. London, and Y. Rabinovich, “The geometry of graphs and some of its algorithmic applications,” Combinatorica , vol. 15, no. 2, pp. 215–245, 1995
1995
Earlier work this paper cites.
J. W. Cannon, W. J. Floyd, R. Kenyon, W. R. Parry et al. , “Hyperbolic geometry,” Flavors of geometry , vol. 31, pp. 59–115, 1997
1997
Earlier work this paper cites.
S. Hochreiter and J. Schmidhuber, “Long short-term memory,” Neural computation , vol. 9, no. 8, pp. 1735–1780, 1997
1997
Earlier work this paper cites.
J. M. Lee and R. Manifolds, “an introduction to curvature,” Graduate text in mathematics , vol. 176, 1997
1997
Earlier work this paper cites.
G. A. Miller, WordNet: An electronic lexical database . MIT press, 1998
1998
Earlier work this paper cites.
A. A. Ungar, “Hyperbolic trigonometry and its application in the poincaré ball model of hyperbolic geometry,” Computers & Mathematics with Applications , vol. 41, no. 1-2, pp. 135–147, 2001
2001
Earlier work this paper cites.
M. E. Newman, “The structure and function of complex networks,” SIAM review , vol. 45, no. 2, pp. 167–256, 2003
2003
Earlier work this paper cites.
G. Lebanon and J. Lafferty, “Hyperplane margin classifiers on the multinomial manifold,” in Proceedings of the twenty-first international conference on Machine learning , 2004, p. 66
2004
Earlier work this paper cites.
M. E. Newman, “Power laws, pareto distributions and zipf’s law,” Contemporary physics , vol. 46, no. 5, pp. 323–351, 2005
2005
Earlier work this paper cites.
M. Gori, G. Monfardini, and F. Scarselli, “A new model for learning in graph domains,” in Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005. , vol. 2. IEEE, 2005, pp. 729–734
2005
Earlier work this paper cites.
J. W. Anderson, Hyperbolic geometry . Springer Science & Business Media, 2006
2006
Earlier work this paper cites.
X. Pennec, “Intrinsic statistics on riemannian manifolds: Basic tools for geometric measurements,” Journal of Mathematical Imaging and Vision , vol. 25, no. 1, p. 127, 2006
2006
Earlier work this paper cites.
K. M. Borgwardt, A. Gretton, M. J. Rasch, H.-P. Kriegel, B. Schölkopf, and A. J. Smola, “Integrating structured biological data by kernel maximum mean discrepancy,” Bioinformatics , vol. 22, no. 14, pp. e49–e57, 2006
2006
Earlier work this paper cites.
J. M. Lee, Riemannian manifolds: an introduction to curvature . Springer Science & Business Media, 2006, vol. 176
2006
Earlier work this paper cites.
V. A. Toponogov, Differential geometry of curves and surfaces . Springer, 2006
2006
Earlier work this paper cites.
D. M. Roy, C. Kemp, V. K. Mansinghka, and J. B. Tenenbaum, “Learning annotated hierarchies from relational data,” in Advances in neural information processing systems , 2007, pp. 1185–1192
2007
Earlier work this paper cites.
I. Abraham, M. Balakrishnan, F. Kuhn, D. Malkhi, V. Ramasubramanian, and K. Talwar, “Reconstructing approximate tree metrics,” in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing , 2007, pp. 43–52
2007
Earlier work this paper cites.
A. A. Ungar, “A gyrovector space approach to hyperbolic geometry,” Synthesis Lectures on Mathematics and Statistics , vol. 1, no. 1, pp. 1–194, 2008
2008
Earlier work this paper cites.
M. A. Cox and T. F. Cox, “Multidimensional scaling,” in Handbook of data visualization . Springer, 2008, pp. 315–347
2008
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Transactions on Neural Networks , vol. 20, no. 1, pp. 61–80, 2008
2008
Earlier work this paper cites.
E. P. Hsu, “A brief introduction to brownian motion on a riemannian manifold,” lecture notes , 2008
2008
Earlier work this paper cites.
Y. Hu, Y. Koren, and C. Volinsky, “Collaborative filtering for implicit feedback datasets,” in 2008 Eighth IEEE International Conference on Data Mining . Ieee, 2008, pp. 263–272
2008
Earlier work this paper cites.
J. Deng, W. Dong, R. Socher, L.-J. Li, K. Li, and L. Fei-Fei, “Imagenet: A large-scale hierarchical image database,” in 2009 IEEE conference on computer vision and pattern recognition . Ieee, 2009, pp. 248–255
2009
Earlier work this paper cites.
A. Krizhevsky et al. , “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
R. P. Duin and E. Pkekalska, “Non-euclidean dissimilarities: causes and informativeness,” in Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) . Springer, 2010, pp. 324–333
2010
Earlier work this paper cites.
V. Nair and G. E. Hinton, “Rectified linear units improve restricted boltzmann machines,” in ICML , 2010
2010
Earlier work this paper cites.
D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguná, “Hyperbolic geometry of complex networks,” Physical Review E , vol. 82, no. 3, p. 036106, 2010
2010
Earlier work this paper cites.
S. Rendle, “Factorization machines,” in 2010 IEEE International Conference on Data Mining . IEEE, 2010, pp. 995–1000
2010
Earlier work this paper cites.
J. Duchi, E. Hazan, and Y. Singer, “Adaptive subgradient methods for online learning and stochastic optimization.” Journal of machine learning research , vol. 12, no. 7, 2011
2011
Earlier work this paper cites.
R. Sarkar, “Low distortion delaunay embedding of trees in hyperbolic plane,” in International Symposium on Graph Drawing . Springer, 2011, pp. 355–366
2011
Earlier work this paper cites.
2011
Earlier work this paper cites.
S.-H. Paeng, “Brownian motion on manifolds with time-dependent metrics and stochastic completeness,” Journal of Geometry and Physics , vol. 61, no. 5, pp. 940–946, 2011
2011
Earlier work this paper cites.
C. Wah, S. Branson, P. Welinder, P. Perona, and S. Belongie, “The caltech-ucsd birds-200-2011 dataset,” 2011
2011
Earlier work this paper cites.
M. D. Zeiler, “Adadelta: an adaptive learning rate method,” arXiv preprint arXiv:1212.5701 , 2012
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
J. M. Lee, “Smooth manifolds,” in Introduction to Smooth Manifolds . Springer, 2013, pp. 1–31
2013
Earlier work this paper cites.
F. C. Keil, Semantic and conceptual development: An ontological perspective . Harvard University Press, 2013
2013
Earlier work this paper cites.
A. B. Adcock, B. D. Sullivan, and M. W. Mahoney, “Tree-like structure in large social and information networks,” in 2013 IEEE 13th International Conference on Data Mining . IEEE, 2013, pp. 1–10
2013
Earlier work this paper cites.
C. Udriste, Convex functions and optimization methods on Riemannian manifolds . Springer Science & Business Media, 2013, vol. 297
2013
Earlier work this paper cites.
A. Graves, A.-r. Mohamed, and G. Hinton, “Speech recognition with deep recurrent neural networks,” in 2013 IEEE international conference on acoustics, speech and signal processing . IEEE, 2013, pp. 6645–6649
2013
Earlier work this paper cites.
S. Bonnabel, “Stochastic gradient descent on riemannian manifolds,” IEEE Transactions on Automatic Control , vol. 58, no. 9, pp. 2217–2229, 2013
2013
Earlier work this paper cites.
J. H. Conway and N. J. A. Sloane, Sphere packings, lattices and groups . Springer Science & Business Media, 2013, vol. 290
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
A. Bordes, N. Usunier, A. Garcia-Duran, J. Weston, and O. Yakhnenko, “Translating embeddings for modeling multi-relational data,” Advances in neural information processing systems , vol. 26, pp. 2787–2795, 2013
2013
Earlier work this paper cites.
J. Pennington, R. Socher, and C. D. Manning, “Glove: Global vectors for word representation,” in Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP) , 2014, pp. 1532–1543
2014
Earlier work this paper cites.
J. Voight, “The arithmetic of quaternion algebras,” preprint , vol. 4, pp. 16–17, 2014
2014
Cited alongside, same era.
D. P. Kingma and M. Welling, “Auto-encoding variational bayes,” 2014
2014
Cited alongside, same era.
D. J. Rezende, S. Mohamed, and D. Wierstra, “Stochastic backpropagation and approximate inference in deep generative models,” International Conference on Machine Learning (ICML) , 2014
2014
Cited alongside, same era.
S. Said, L. Bombrun, and Y. Berthoumieu, “New riemannian priors on the univariate normal model,” Entropy , vol. 16, no. 7, pp. 4015–4031, 2014
2014
Cited alongside, same era.
K. V. Mardia, Statistics of directional data . Academic press, 2014
2014
Cited alongside, same era.
T. D. Q. Vinh, Y. Tay, S. Zhang, G. Cong, and X.-L. Li, “Hyperbolic recommender systems,” Proceedings of the AAAI Conference on Artificial Intelligence , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
O. Shchur, M. Mumme, A. Bojchevski, and S. Günnemann, “Pitfalls of graph neural network evaluation,” arXiv , pp. arXiv–1811, 2018
2018
Later among the works it cites.
A. Suzuki, Y. Enokida, and K. Yamanishi, “Riemannian transe: Multi-relational graph embedding in non-euclidean space,” 2018
2018
Later among the works it cites.
A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga et al. , “Pytorch: An imperative style, high-performance deep learning library,” in Advances in neural information processing systems , 2019, pp. 8026–8037
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Perozzi, R. Al-Rfou, and S. Skiena, “Deepwalk: Online learning of social representations,” in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining , 2014, pp. 701–710
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” nature , vol. 521, no. 7553, pp. 436–444, 2015
2015
Cited alongside, same era.
K. Katayama and E. W. Maina, “Indexing method for hierarchical graphs based on relation among interlacing sequences of eigenvalues,” Journal of information processing , vol. 23, no. 2, pp. 210–220, 2015
2015
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Delving deep into rectifiers: Surpassing human-level performance on imagenet classification,” in Proceedings of the IEEE international conference on computer vision , 2015, pp. 1026–1034
2015
Cited alongside, same era.
2015
Cited alongside, same era.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” International Conference on Learning Representations (ICLR) , 2015
2015
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
I. Chami, Z. Ying, C. Ré, and J. Leskovec, “Hyperbolic graph convolutional neural networks,” in Advances in neural information processing systems , 2019, pp. 4868–4879
2019
Later among the works it cites.
Q. Liu, M. Nickel, and D. Kiela, “Hyperbolic graph neural networks,” in Advances in Neural Information Processing Systems , 2019, pp. 8230–8241
2019
Later among the works it cites.
H. Cho, B. DeMeo, J. Peng, and B. Berger, “Large-margin classification in hyperbolic space,” in The 22nd International Conference on Artificial Intelligence and Statistics . PMLR, 2019, pp. 1832–1840
2019
Later among the works it cites.
S. J. Reddi, S. Kale, and S. Kumar, “On the convergence of adam and beyond,” International Conference on Learning Representations (ICLR) , 2019
2019
Later among the works it cites.
G. Bécigneul and O.-E. Ganea, “Riemannian adaptive optimization methods,” 2019
2019
Later among the works it cites.
A. Tifrea, G. Bécigneul, and O.-E. Ganea, “Poincar \ \backslash ’e glove: Hyperbolic word embeddings,” International Conference on Learning Representations (ICLR) , 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
V. Cohen-Addad, V. Kanade, F. Mallmann-Trenn, and C. Mathieu, “Hierarchical clustering: Objective functions and algorithms,” Journal of the ACM (JACM) , vol. 66, no. 4, pp. 1–42, 2019
2019
Later among the works it cites.
N. Monath, M. Zaheer, D. Silva, A. McCallum, and A. Ahmed, “Gradient-based hierarchical clustering using continuous representations of trees in hyperbolic space,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , 2019, pp. 714–722
2019
Later among the works it cites.
J. Devlin, M.-W. Chang, K. Lee, and K. Toutanova, “Bert: Pre-training of deep bidirectional transformers for language understanding,” a Association for Computational Linguistics(ACL) , 2019
2019
Later among the works it cites.
M. Law, R. Liao, J. Snell, and R. Zemel, “Lorentzian distance learning for hyperbolic representations,” in International Conference on Machine Learning , 2019, pp. 3672–3681
2019
Later among the works it cites.
J. Lee, Y. Lee, J. Kim, A. Kosiorek, S. Choi, and Y. W. Teh, “Set transformer: A framework for attention-based permutation-invariant neural networks,” in International Conference on Machine Learning . PMLR, 2019, pp. 3744–3753
2019
Later among the works it cites.
T. Elsken, J. H. Metzen, and F. Hutter, “Neural architecture search: A survey,” 2019
2019
Later among the works it cites.
Y. Nagano, S. Yamaguchi, Y. Fujita, and M. Koyama, “A wrapped normal distribution on hyperbolic space for gradient-based learning,” Proceedings of the 36-th InternationalConference on Machine Learning , 2019
2019
Later among the works it cites.
L. Falorsi, P. de Haan, T. Davidson, and P. Forré, “Reparameterizing distributions on lie groups,” 2019
2019
Later among the works it cites.
E. Mathieu, C. Le Lan, C. J. Maddison, R. Tomioka, and Y. W. Teh, “Continuous hierarchical representations with poincaré variational auto-encoders,” in Advances in neural information processing systems , 2019, pp. 12 565–12 576
2019
Later among the works it cites.
2019
Later among the works it cites.
D. Grattarola, L. Livi, and C. Alippi, “Adversarial autoencoders with constant-curvature latent manifolds,” Applied Soft Computing , vol. 81, p. 105511, 2019
2019
Later among the works it cites.
L. Fang, C. Li, J. Gao, W. Dong, and C. Chen, “Implicit deep latent variable models for text generation,” EMNLP , 2019
2019
Later among the works it cites.
R. Aly, S. Acharya, A. Ossa, A. Köhn, C. Biemann, and A. Panchenko, “Every child should have parents: A taxonomy refinement algorithm based on hyperbolic term embeddings,” in Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics , 2019, pp. 4811–4817
2019
Later among the works it cites.
I. Balazevic, C. Allen, and T. Hospedales, “Multi-relational poincaré graph embeddings,” in Advances in Neural Information Processing Systems , 2019, pp. 4463–4473
2019
Later among the works it cites.
2019
Later among the works it cites.
F. López, B. Heinzerling, and M. Strube, “Fine-grained entity typing in hyperbolic space,” in Proceedings of the 4th Workshop on Representation Learning for NLP (RepL4NLP-2019) . Florence, Italy: Association for Computational Linguistics, Aug. 2019, pp. 169–180
2019
Later among the works it cites.
V. Verma, A. Lamb, C. Beckham, A. Najafi, I. Mitliagkas, D. Lopez-Paz, and Y. Bengio, “Manifold mixup: Better representations by interpolating hidden states,” in International Conference on Machine Learning . PMLR, 2019, pp. 6438–6447
2019
Later among the works it cites.
K. Yu, S. Visweswaran, and K. Batmanghelich, “Semi-supervised hierarchical drug embedding in hyperbolic space,” Journal of Chemical Information and Modeling , 2020, pMID: 33140969. [Online]. Available: https://doi.org/10.1021/acs.jcim.0c00681
2020
Later among the works it cites.
A. Lou, I. Katsman, Q. Jiang, S. Belongie, S.-N. Lim, and C. De Sa, “Differentiating through the fr \ \backslash ’echet mean,” Thirty-seventh International Conference on Machine Learning , 2020
2020
Later among the works it cites.
V. Khrulkov, L. Mirvakhabova, E. Ustinova, I. Oseledets, and V. Lempitsky, “Hyperbolic image embeddings,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2020, pp. 6418–6428
2020
Later among the works it cites.
G. Bachmann, G. Bécigneul, and O. Ganea, “Constant curvature graph convolutional networks,” in International Conference on Machine Learning . PMLR, 2020, pp. 486–496
2020
Later among the works it cites.
M. Weber, M. Zaheer, A. S. Rawat, A. Menon, and S. Kumar, “Robust large-margin learning in hyperbolic space,” Advances in Neural Information Processing Systems , 2020
2020
Later among the works it cites.
M. Kochurov, R. Karimov, and S. Kozlukov, “Geoopt: Riemannian optimization in pytorch,” 2020
2020
Later among the works it cites.
Y. Zhang, X. Wang, X. Jiang, C. Shi, and Y. Ye, “Hyperbolic graph attention network,” Proceedings of the AAAI Conference on Artificial Intelligence , 2020
2020
Later among the works it cites.
W. Peng, X. Hong, H. Chen, and G. Zhao, “Learning graph convolutional network for skeleton-based human action recognition by neural searching,” Proceedings of the AAAI Conference on Artificial Intelligence , 2020
2020
Later among the works it cites.
W. Peng, J. Shi, Z. Xia, and G. Zhao, “Mix dimension in poincaré geometry for 3d skeleton-based action recognition,” in Proceedings of the 28th ACM International Conference on Multimedia , 2020, pp. 1432–1440
2020
Later among the works it cites.
A. Dosovitskiy, L. Beyer, A. Kolesnikov, D. Weissenborn, X. Zhai, T. Unterthiner, M. Dehghani, M. Minderer, G. Heigold, S. Gelly, J. Uszkoreit, and N. Houlsby, “An image is worth 16x16 words: Transformers for image recognition at scale,” 2020
2020
Later among the works it cites.
M. Kochurov, S. Ivanov, and E. Burnaev, “Are hyperbolic representations in graphs created equal?” 2020
2020
Later among the works it cites.
I. Kobyzev, S. Prince, and M. Brubaker, “Normalizing flows: An introduction and review of current methods,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2020
2020
Later among the works it cites.
D. J. Rezende, G. Papamakarios, S. Racanière, M. S. Albergo, G. Kanwar, P. E. Shanahan, and K. Cranmer, “Normalizing flows on tori and spheres,” Proceedings of the 37th International Conference on Machine Learning, PMLR 119:8083-8092 , 2020
2020
Later among the works it cites.
J. Brehmer and K. Cranmer, “Flows for simultaneous manifold learning and density estimation,” Advances in neural information processing systems , 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
O. Skopek, O.-E. Ganea, and G. Bécigneul, “Mixed-curvature variational autoencoders,” International Conference on Learning Representations (ICLR) , 2020
2020
Later among the works it cites.
M. T. Law and J. Stam, “Ultrahyperbolic representation learning,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
S. Zhu, S. Pan, C. Zhou, J. Wu, Y. Cao, and B. Wang, “Graph geometry interaction learning,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
L. V. Tran, Y. Tay, S. Zhang, G. Cong, and X. Li, “Hyperml: A boosting metric learning approach in hyperbolic space for recommender systems.” in WSDM , 2020, pp. 609–617
2020
Later among the works it cites.
C. Xu and M. Wu, “Learning feature interactions with lorentzian factorization machine,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 04, 2020, pp. 6470–6477
2020
Later among the works it cites.
Y. Zhu, D. Zhou, J. Xiao, X. Jiang, X. Chen, and Q. Liu, “Hypertext: Endowing fasttext with hyperbolic geometry,” in Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing , 2020, pp. 1166–1171
2020
Later among the works it cites.
I. Chami, A. Wolf, D.-C. Juan, F. Sala, S. Ravi, and C. Ré, “Low-dimensional hyperbolic knowledge graph embeddings,” in Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics , 2020, pp. 6901–6914
2020
Later among the works it cites.
A. Bogatskiy, B. Anderson, J. T. Offermann, M. Roussi, D. W. Miller, and R. Kondor, “Lorentz group equivariant neural network for particle physics,” International Conference on Machine Learning (ICML) , 2020
2020
Later among the works it cites.
I. Chami, A. Gu, V. Chatziafratis, and C. Ré, “From trees to continuous embeddings and back: Hyperbolic hierarchical clustering,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
E. Mathieu and M. Nickel, “Riemannian continuous normalizing flows,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
R. Sonthalia and A. C. Gilbert, “Tree! i am no tree! i am a low dimensional hyperbolic embedding,” Advances in neural information processing systems , 2020
2020
Later among the works it cites.
F. López and M. Strube, “A fully hyperbolic neural model for hierarchical multi-class classification,” in EMNLP . Online: Association for Computational Linguistics, Nov. 2020, pp. 460–475
2020
Later among the works it cites.
R. Shimizu, Y. Mukuta, and T. Harada, “Hyperbolic neural networks++,” 2021
2021
Closest in time.
T. Yu and C. M. De Sa, “Numerically accurate hyperbolic embeddings using tiling-based models,” in Advances in Neural Information Processing Systems , 2019, pp. 2023–2033
2033
Closest in time.