paper-with-me

홈 › Papers

Composition and decomposition of GANs

2019-01-23 · Yeu-Chern Harn, Zhenghao Chen, Vladimir Jojic

In this work, we propose a composition/decomposition framework for adversarially training generative models on composed data - data where each sample can be thought of as being constructed from a fixed number of components. In our framework, samples are generated by sampling components from component generators and feeding these components to a composition function which combines them into a "composed sample". This compositional training approach improves the modularity, extensibility and interpretability of Generative Adversarial Networks (GANs) - providing a principled way to incrementally construct complex models out of simpler component models, and allowing for explicit "division of responsibility" between these components. Using this framework, we define a family of learning tasks and evaluate their feasibility on two datasets in two different data modalities (image and text). Lastly, we derive sufficient conditions such that these compositional generative models are identifiable. Our work provides a principled approach to building on pre-trained generative models or for exploiting the compositional nature of data distributions to train extensible and interpretable models.

📄 PDF Abstract BibTeX arXiv:1901.07667

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Interpretability 설명 없음

Similar Papers 제목 키워드 기반

Summable Reparameterizations of Wasserstein Critics in the One-Dimensional Setting

2017-09-19 · Christopher Grimm, Yuhang Song, Michael L. Littman

Generative adversarial networks (GANs) are an exciting alternative to algorithms for solving density estimation problems---using data to assess how likely samples are to be drawn from the same distribution. Instead of ex…

Density Estimation

Sparse and Low-Rank Tensor Decomposition

2015-12-01 · NeurIPS 2015 12 · Parikshit Shah, Nikhil Rao, Gongguo Tang

Motivated by the problem of robust factorization of a low-rank tensor, we study the question of sparse and low-rank tensor decomposition. We present an efficient computational algorithm that modifies Leurgans' algoirthm …

Tensor Decomposition

JoIN: Joint GANs Inversion for Intrinsic Image Decomposition

2023-05-18 · Viraj Shah, Svetlana Lazebnik, Julien Philip

In this work, we propose to solve ill-posed inverse imaging problems using a bank of Generative Adversarial Networks (GAN) as a prior and apply our method to the case of Intrinsic Image Decomposition for faces and materi…

Image RelightingIntrinsic Image Decomposition

Enhancing GANs with MMD Neural Architecture Search, PMish Activation Function, and Adaptive Rank Decomposition

2024-10-23 · IEEE Access 2024 10 · Prasanna Reddy Pulakurthi, Mahsa Mozaffari, Sohail Dianat, Jamison Heard 외

Generative Adversarial Networks (GANs) have gained considerable attention owing to their impressive ability to generate high-quality, realistic images from a desired data distribution. This research introduces advancemen…

Image Generation

Guiding Network Analysis using Graph Slepians: An Illustration for the C. Elegans Connectome

2017-08-15 · Dimitri Van De Ville, Robin Demesmaeker, Maria Giulia Preti

Spectral approaches of network analysis heavily rely upon the eigendecomposition of the graph Laplacian. For instance, in graph signal processing, the Laplacian eigendecomposition is used to define the graph Fourier tran…