English

Flat Metric Minimization with Applications in Generative Modeling

Machine Learning 2019-05-14 v1 Computer Vision and Pattern Recognition Machine Learning

Abstract

We take the novel perspective to view data not as a probability distribution but rather as a current. Primarily studied in the field of geometric measure theory, kk-currents are continuous linear functionals acting on compactly supported smooth differential forms and can be understood as a generalized notion of oriented kk-dimensional manifold. By moving from distributions (which are 00-currents) to kk-currents, we can explicitly orient the data by attaching a kk-dimensional tangent plane to each sample point. Based on the flat metric which is a fundamental distance between currents, we derive FlatGAN, a formulation in the spirit of generative adversarial networks but generalized to kk-currents. In our theoretical contribution we prove that the flat metric between a parametrized current and a reference current is Lipschitz continuous in the parameters. In experiments, we show that the proposed shift to k>0k>0 leads to interpretable and disentangled latent representations which behave equivariantly to the specified oriented tangent planes.

Cite

@article{arxiv.1905.04730,
  title  = {Flat Metric Minimization with Applications in Generative Modeling},
  author = {Thomas Möllenhoff and Daniel Cremers},
  journal= {arXiv preprint arXiv:1905.04730},
  year   = {2019}
}
R2 v1 2026-06-23T09:04:04.865Z