Manify: A Python Library for Learning Non-Euclidean Representations
Not on the map. Why?
Abstract (arXiv)
We present Manify, an open-source Python library for non-Euclidean representation learning. Leveraging manifold learning techniques, Manify provides tools for learning embeddings in (products of) non-Euclidean spaces, performing classification and regression with data that lives in such spaces, estimating the curvature of a manifold, and more. Manify aims to advance research and applications in machine learning by offering a comprehensive suite of tools for manifold-based data analysis. Our source code, examples, and documentation are available at https://github.com/pchlenski/manify.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 18 of its 32 references that are in the map. First posted on arXiv 12 Mar 2025.
Builds on
18 of 32 references.
References · 18
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2019Hyperbolic Graph Convolutional Neural Networkscited by 400
- 2018Hyperbolic Neural Networkscited by 393
- 2019Hyperbolic Graph Neural Networkscited by 244
- 2019Hyperbolic Image Embeddingscited by 219
- 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 172
- 2019Constant Curvature Graph Convolutional Networkscited by 106
- 2019Mixed-curvature Variational Autoencoderscited by 85
- 2021Neural Distance Embeddings for Biological Sequencescited by 17
6 more
- 2023Curve Your Attention: Mixed-Curvature Transformers for Graph Representation Learningcited by 15
- 2021Linear Classifiers in Product Space Formscited by 11
- 2023Fast hyperboloid decision tree algorithmscited by 7
- 2023HypLL: The Hyperbolic Learning Librarycited by 6
- 2023Principal Component Analysis in Space Formscited by 5
- 2024Mixed-curvature decision trees and random forestscited by 2
Built on by
Citing papers per year: 2025: 2.
2 papers.
- 2025Hyperbolic Genome Embeddingscited by 3
- 2025Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approachcited by 0
- 2025Hyperbolic Genome Embeddings29 Jul 2025
- 2025Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach4 Jun 2025