On genetic programming representations and fitness functions for interpretable dimensionality reduction

• URL: http://arxiv.org/abs/2203.00528v1
• Date: Tue, 1 Mar 2022 15:12:17 GMT
• Title: On genetic programming representations and fitness functions for interpretable dimensionality reduction
• Abstract summary: Dimensionality reduction (DR) is an important technique for data exploration and knowledge discovery. Most of the main DR methods are either linear (e.g., PCA) or do not provide an explicit mapping between the original data and its lower-dimensional representation. Recently, genetic programming (GP) has been used to evolve interpretable DR mappings in the form of symbolic expressions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dimensionality reduction (DR) is an important technique for data exploration and knowledge discovery. However, most of the main DR methods are either linear (e.g., PCA), do not provide an explicit mapping between the original data and its lower-dimensional representation (e.g., MDS, t-SNE, isomap), or produce mappings that cannot be easily interpreted (e.g., kernel PCA, neural-based autoencoder). Recently, genetic programming (GP) has been used to evolve interpretable DR mappings in the form of symbolic expressions. There exists a number of ways in which GP can be used to this end and no study exists that performs a comparison. In this paper, we fill this gap by comparing existing GP methods as well as devising new ones. We evaluate our methods on several benchmark datasets based on predictive accuracy and on how well the original features can be reconstructed using the lower-dimensional representation only. Finally, we qualitatively assess the resulting expressions and their complexity. We find that various GP methods can be competitive with state-of-the-art DR algorithms and that they have the potential to produce interpretable DR mappings.

Related papers

• Does Generative Retrieval Overcome the Limitations of Dense Retrieval? [117.49076770892583]
  Generative retrieval (GR) has emerged as a new paradigm in neural information retrieval.<n>We investigate how GR fundamentally diverges from dense retrieval (DR) in both learning objectives and representational capacity.
  arXiv  Detail & Related papers  (2025-09-26T09:38:01Z)
• Minimally Supervised Learning using Topological Projections in Self-Organizing Maps [55.31182147885694]
  We introduce a semi-supervised learning approach based on topological projections in self-organizing maps (SOMs) Our proposed method first trains SOMs on unlabeled data and then a minimal number of available labeled data points are assigned to key best matching units (BMU) Our results indicate that the proposed minimally supervised model significantly outperforms traditional regression techniques.
  arXiv  Detail & Related papers  (2024-01-12T22:51:48Z)
• Thin and Deep Gaussian Processes [43.22976185646409]
  This work proposes a novel synthesis of both previous approaches: Thin and Deep GP (TDGP) We show with theoretical and experimental results that i) TDGP is tailored to specifically discover lower-dimensional manifold in the input data, ii) TDGP behaves well when increasing the number of layers, and iv) TDGP performs well in standard benchmark datasets.
  arXiv  Detail & Related papers  (2023-10-17T18:50:24Z)
• Differentiable Genetic Programming for High-dimensional Symbolic Regression [13.230237932229052]
  Symbolic regression (SR) is considered an effective way to reach interpretable machine learning (ML) Genetic programming (GP) has been the dominator in solving SR problems. We propose a differentiable approach named DGP to construct GP trees towards high-dimensional SR.
  arXiv  Detail & Related papers  (2023-04-18T11:39:45Z)
• Dimensionality Reduction as Probabilistic Inference [10.714603218784175]
  Dimensionality reduction (DR) algorithms compress high-dimensional data into a lower dimensional representation while preserving important features of the data. We introduce the ProbDR variational framework, which interprets a wide range of classical DR algorithms as probabilistic inference algorithms in this framework.
  arXiv  Detail & Related papers  (2023-04-15T23:48:59Z)
• Interactive Segmentation as Gaussian Process Classification [58.44673380545409]
  Click-based interactive segmentation (IS) aims to extract the target objects under user interaction. Most of the current deep learning (DL)-based methods mainly follow the general pipelines of semantic segmentation. We propose to formulate the IS task as a Gaussian process (GP)-based pixel-wise binary classification model on each image.
  arXiv  Detail & Related papers  (2023-02-28T14:01:01Z)
• Deep Generative Symbolic Regression with Monte-Carlo-Tree-Search [29.392036559507755]
  Symbolic regression is a problem of learning a symbolic expression from numerical data. Deep neural models trained on procedurally-generated synthetic datasets showed competitive performance. We propose a novel method which provides the best of both worlds, based on a Monte-Carlo Tree Search procedure.
  arXiv  Detail & Related papers  (2023-02-22T09:10:20Z)
• Scaling Structured Inference with Randomization [64.18063627155128]
  We propose a family of dynamic programming (RDP) randomized for scaling structured models to tens of thousands of latent states. Our method is widely applicable to classical DP-based inference. It is also compatible with automatic differentiation so can be integrated with neural networks seamlessly.
  arXiv  Detail & Related papers  (2021-12-07T11:26:41Z)
• The Deep Generative Decoder: MAP estimation of representations improves modeling of single-cell RNA data [0.0]
  We present a simple generative model that computes model parameters and representations directly via maximum a posteriori (MAP) estimation. The advantages of this approach are its simplicity and its capability to provide representations of much smaller dimensionality than a comparable VAE.
  arXiv  Detail & Related papers  (2021-10-13T12:17:46Z)
• Deep Representational Similarity Learning for analyzing neural signatures in task-based fMRI dataset [81.02949933048332]
  This paper develops Deep Representational Similarity Learning (DRSL), a deep extension of Representational Similarity Analysis (RSA) DRSL is appropriate for analyzing similarities between various cognitive tasks in fMRI datasets with a large number of subjects.
  arXiv  Detail & Related papers  (2020-09-28T18:30:14Z)
• Learning Reasoning Strategies in End-to-End Differentiable Proving [50.9791149533921]
  Conditional Theorem Provers learn optimal rule selection strategy via gradient-based optimisation. We show that Conditional Theorem Provers are scalable and yield state-of-the-art results on the CLUTRR dataset.
  arXiv  Detail & Related papers  (2020-07-13T16:22:14Z)
• The data-driven physical-based equations discovery using evolutionary approach [77.34726150561087]
  We describe the algorithm for the mathematical equations discovery from the given observations data. The algorithm combines genetic programming with the sparse regression. It could be used for governing analytical equation discovery as well as for partial differential equations (PDE) discovery.
  arXiv  Detail & Related papers  (2020-04-03T17:21:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.