Manifold Learning Benefits GANs

• URL: http://arxiv.org/abs/2112.12618v1
• Date: Thu, 23 Dec 2021 14:59:05 GMT
• Title: Manifold Learning Benefits GANs
• Authors: Yao Ni, Piotr Koniusz, Richard Hartley, Richard Nock
• Abstract summary: We improve Generative Adversarial Networks by incorporating a manifold learning step into the discriminator. In our design, the manifold learning and coding steps are intertwined with layers of the discriminator. We show substantial improvements over different recent state-of-the-art baselines.
• Score: 59.30818650649828
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we improve Generative Adversarial Networks by incorporating a manifold learning step into the discriminator. We consider locality-constrained linear and subspace-based manifolds, and locality-constrained non-linear manifolds. In our design, the manifold learning and coding steps are intertwined with layers of the discriminator, with the goal of attracting intermediate feature representations onto manifolds. We adaptively balance the discrepancy between feature representations and their manifold view, which represents a trade-off between denoising on the manifold and refining the manifold. We conclude that locality-constrained non-linear manifolds have the upper hand over linear manifolds due to their non-uniform density and smoothness. We show substantial improvements over different recent state-of-the-art baselines.

Related papers

• Scaling Riemannian Diffusion Models [68.52820280448991]
  We show that our method enables us to scale to high dimensional tasks on nontrivial manifold. We model QCD densities on $SU(n)$ lattices and contrastively learned embeddings on high dimensional hyperspheres.
  arXiv  Detail & Related papers  (2023-10-30T21:27:53Z)
• Alignment and Outer Shell Isotropy for Hyperbolic Graph Contrastive Learning [69.6810940330906]
  We propose a novel contrastive learning framework to learn high-quality graph embedding. Specifically, we design the alignment metric that effectively captures the hierarchical data-invariant information. We show that in the hyperbolic space one has to address the leaf- and height-level uniformity which are related to properties of trees.
  arXiv  Detail & Related papers  (2023-10-27T15:31:42Z)
• Generative Modeling on Manifolds Through Mixture of Riemannian Diffusion Processes [57.396578974401734]
  We introduce a principled framework for building a generative diffusion process on general manifold. Instead of following the denoising approach of previous diffusion models, we construct a diffusion process using a mixture of bridge processes. We develop a geometric understanding of the mixture process, deriving the drift as a weighted mean of tangent directions to the data points.
  arXiv  Detail & Related papers  (2023-10-11T06:04:40Z)
• Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivity [62.11981948274508]
  The study of LLFC transcends and advances our understanding of LMC by adopting a feature-learning perspective. We provide comprehensive empirical evidence for LLFC across a wide range of settings, demonstrating that whenever two trained networks satisfy LMC, they also satisfy LLFC in nearly all the layers.
  arXiv  Detail & Related papers  (2023-07-17T07:16:28Z)
• Inversion dynamics of class manifolds in deep learning reveals tradeoffs underlying generalisation [0.0]
  We report on numerical experiments showing how the optimisation dynamics finds representations that balance opposing tendencies with a non-monotonic trend. The training error at the inversion is stable under subsampling, and across network initialisations and optimisers, which characterises it as a property solely of the data structure and (very weakly) of the architecture.
  arXiv  Detail & Related papers  (2023-03-09T10:35:40Z)
• Invariance-based Multi-Clustering of Latent Space Embeddings for Equivariant Learning [12.770012299379099]
  We present an approach to disentangle equivariance feature maps in a Lie group manifold by enforcing deep, group-invariant learning. Our experiments show that this model effectively learns to disentangle the invariant and equivariant representations with significant improvements in the learning rate.
  arXiv  Detail & Related papers  (2021-07-25T03:27:47Z)
• IntraLoss: Further Margin via Gradient-Enhancing Term for Deep Face Recognition [14.562043494026849]
  Existing classification-based face recognition methods have achieved remarkable progress. Poor feature distribution will wipe out the performance improvement brought about by margin scheme. In this paper, we propose the gradient-enhancing term' that concentrates on the distribution characteristics within the class.
  arXiv  Detail & Related papers  (2021-07-07T16:53:45Z)
• Multi-chart flows [0.0]
  We present a flow-based model for concurrently learning non-trivial topologically non-trivial manifold operations. Our model learns the local manifold topology piecewise by "gluing" it back together through a collection of learned coordinate charts. We show better sample efficiency and competitive or superior performance against current state-of-the-art.
  arXiv  Detail & Related papers  (2021-06-07T10:37:06Z)
• Rectangular Flows for Manifold Learning [38.63646804834534]
  Normalizing flows are invertible neural networks with tractable change-of-volume terms. Data of interest is typically assumed to live in some (often unknown) low-dimensional manifold embedded in high-dimensional ambient space. We propose two methods to tractably the gradient of this term with respect to the parameters of the model.
  arXiv  Detail & Related papers  (2021-06-02T18:30:39Z)
• Embedding Propagation: Smoother Manifold for Few-Shot Classification [131.81692677836202]
  We propose to use embedding propagation as an unsupervised non-parametric regularizer for manifold smoothing in few-shot classification. We empirically show that embedding propagation yields a smoother embedding manifold. We show that embedding propagation consistently improves the accuracy of the models in multiple semi-supervised learning scenarios by up to 16% points.
  arXiv  Detail & Related papers  (2020-03-09T13:51:09Z)

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.