Latent Space Exploration Using Generative Kernel PCA

• URL: http://arxiv.org/abs/2105.13949v1
• Date: Fri, 28 May 2021 16:17:37 GMT
• Title: Latent Space Exploration Using Generative Kernel PCA
• Authors: David Winant, Joachim Schreurs and Johan A.K. Suykens
• Abstract summary: Kernel PCA is a powerful feature extractor which recently has seen a reformulation in the context of Restricted Kernel Machines (RKMs) RKMs allow for a representation of kernel PCA in terms of hidden and visible units similar to Restricted Boltzmann Machines. This connection has led to insights on how to use kernel PCA in a generative procedure, called generative kernel PCA. New points can be generated by gradually moving in the latent space, which allows for an interpretation of the components.
• Score: 14.236193187116049
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Kernel PCA is a powerful feature extractor which recently has seen a reformulation in the context of Restricted Kernel Machines (RKMs). These RKMs allow for a representation of kernel PCA in terms of hidden and visible units similar to Restricted Boltzmann Machines. This connection has led to insights on how to use kernel PCA in a generative procedure, called generative kernel PCA. In this paper, the use of generative kernel PCA for exploring latent spaces of datasets is investigated. New points can be generated by gradually moving in the latent space, which allows for an interpretation of the components. Firstly, examples of this feature space exploration on three datasets are shown with one of them leading to an interpretable representation of ECG signals. Afterwards, the use of the tool in combination with novelty detection is shown, where the latent space around novel patterns in the data is explored. This helps in the interpretation of why certain points are considered as novel.

Related papers

• Reconstruction of muon bundles in KM3NeT detectors using machine learning methods [0.0]
  The KM3NeT Collaboration is installing the ARCA and ORCA neutrino detectors at the bottom of the Mediterranean Sea. The focus of ARCA is neutrino astronomy, while ORCA is optimised for neutrino oscillation studies. Both detectors are already operational in their intermediate states and collect valuable data. This work explores the potential of machine learning models for the reconstruction of muon bundles.
  arXiv  Detail & Related papers  (2025-03-03T11:37:38Z)
• MIK: Modified Isolation Kernel for Biological Sequence Visualization, Classification, and Clustering [3.9146761527401424]
  This research proposes a novel approach called the Modified Isolation Kernel (MIK) as an alternative to the Gaussian kernel. MIK uses adaptive density estimation to capture local structures more accurately and integrates robustness measures. It exhibits improved preservation of the local and global structure and enables better visualization of clusters and subclusters in the embedded space.
  arXiv  Detail & Related papers  (2024-10-21T06:57:09Z)
• Inferring Kernel $ε$-Machines: Discovering Structure in Complex Systems [49.1574468325115]
  We introduce causal diffusion components that encode the kernel causal-state estimates as a set of coordinates in a reduced dimension space. We show how each component extracts predictive features from data and demonstrate their application on four examples.
  arXiv  Detail & Related papers  (2024-10-01T21:14:06Z)
• Autonomous microARPES [10.192534266541687]
  Angle-resolved photoemission spectroscopy (ARPES) is a technique used to map the occupied electronic structure of solids. Recent progress in X-ray focusing optics has led to the development of ARPES into a microscopic tool. We implement a protocol to autonomously search both $mathbfk$- and real space in order to find positions of particular interest.
  arXiv  Detail & Related papers  (2024-02-16T13:41:05Z)
• 3D Mitochondria Instance Segmentation with Spatio-Temporal Transformers [101.44668514239959]
  We propose a hybrid encoder-decoder framework that efficiently computes spatial and temporal attentions in parallel. We also introduce a semantic clutter-background adversarial loss during training that aids in the region of mitochondria instances from the background.
  arXiv  Detail & Related papers  (2023-03-21T17:58:49Z)
• Local manifold learning and its link to domain-based physics knowledge [53.15471241298841]
  In many reacting flow systems, the thermo-chemical state-space is assumed to evolve close to a low-dimensional manifold (LDM) We show that PCA applied in local clusters of data (local PCA) is capable of detecting the intrinsic parameterization of the thermo-chemical state-space.
  arXiv  Detail & Related papers  (2022-07-01T09:06:25Z)
• Omni-supervised Point Cloud Segmentation via Gradual Receptive Field Component Reasoning [41.83979510282989]
  We bring the first omni-scale supervision method to point cloud segmentation via the proposed gradual Receptive Field Component Reasoning (RFCR) Our method brings new state-of-the-art performances for S3DIS as well as Semantic3D and ranks the 1st in the ScanNet benchmark among all the point-based methods.
  arXiv  Detail & Related papers  (2021-05-21T08:32:02Z)
• Turning Channel Noise into an Accelerator for Over-the-Air Principal Component Analysis [65.31074639627226]
  Principal component analysis (PCA) is a technique for extracting the linear structure of a dataset. We propose the deployment of PCA over a multi-access channel based on the algorithm of gradient descent. Over-the-air aggregation is adopted to reduce the multi-access latency, giving the name over-the-air PCA.
  arXiv  Detail & Related papers  (2021-04-20T16:28:33Z)
• Upper and Lower Bounds on the Performance of Kernel PCA [15.745403317380282]
  We contribute lower and upper bounds on the efficiency of kernel PCA. Two bounds are for fixed estimators, and two are for randomized estimators through the PAC-Bayes theory. We dissect the bounds to highlight strengths and limitations of the kernel PCA algorithm.
  arXiv  Detail & Related papers  (2020-12-18T17:19:31Z)
• Kernel learning approaches for summarising and combining posterior similarity matrices [68.8204255655161]
  We build upon the notion of the posterior similarity matrix (PSM) in order to suggest new approaches for summarising the output of MCMC algorithms for Bayesian clustering models. A key contribution of our work is the observation that PSMs are positive semi-definite, and hence can be used to define probabilistically-motivated kernel matrices.
  arXiv  Detail & Related papers  (2020-09-27T14:16:14Z)
• Isolation Distributional Kernel: A New Tool for Point & Group Anomaly Detection [76.1522587605852]
  Isolation Distributional Kernel (IDK) is a new way to measure the similarity between two distributions. We demonstrate IDK's efficacy and efficiency as a new tool for kernel based anomaly detection for both point and group anomalies.
  arXiv  Detail & Related papers  (2020-09-24T12:25:43Z)

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.