Genetic Programming for Manifold Learning: Preserving Local Topology
Andrew Lensen, Bing Xue, Mengjie Zhang

TL;DR
This paper introduces a novel genetic programming approach for manifold learning that preserves local topology, leading to improved performance and interpretability in low-dimensional embeddings of high-dimensional data.
Contribution
The paper presents a new genetic programming method for manifold learning that explicitly preserves local topology, enhancing performance and interpretability over previous approaches.
Findings
Our method often outperforms baseline manifold learning techniques.
It shows clear improvements over previous genetic programming approaches.
The evolved mappings are interpretable and reusable.
Abstract
Manifold learning methods are an invaluable tool in today's world of increasingly huge datasets. Manifold learning algorithms can discover a much lower-dimensional representation (embedding) of a high-dimensional dataset through non-linear transformations that preserve the most important structure of the original data. State-of-the-art manifold learning methods directly optimise an embedding without mapping between the original space and the discovered embedded space. This makes interpretability - a key requirement in exploratory data analysis - nearly impossible. Recently, genetic programming has emerged as a very promising approach to manifold learning by evolving functional mappings from the original space to an embedding. However, genetic programming-based manifold learning has struggled to match the performance of other approaches. In this work, we propose a new approach to using…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
