arXiv:1610.02920
Generative Adversarial Nets from a Density Ratio Estimation Perspective
원문 초록
Generative adversarial networks (GANs) are successful deep generative models. GANs are based on a two-player minimax game. However, the objective function derived in the original motivation is changed to obtain stronger gradients when learning the generator. We propose a novel algorithm that repeats the density ratio estimation and f-divergence minimization. Our algorithm offers a new perspective toward the understanding of GANs and is able to make use of multiple viewpoints obtained in the research of density ratio estimation, e.g. what divergence is stable and relative density ratio is useful.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Savage-Dickey density ratio estimation with normalizing flows for Bayesian model comparison
Dequantified Diffusion-Schr{ö}dinger Bridge for Density Ratio Estimation
Learning the Optimal Stopping for Early Classification within Finite Horizons via Sequential Probability Ratio Test
Your copula is a classifier in disguise: classification-based copula density estimation
How to Leverage Demonstration Data in Alignment for Large Language Model? A Self-Imitation Learning Perspective
Robust Conformal Volume Estimation in 3D Medical Images
토론
이 논문과 연결된 포럼 글이 아직 없습니다.