pith. sign in

hub Mixed citations

Generative Adversarial Networks

Mixed citation behavior. Most common role is background (59%).

76 Pith papers citing it
Background 59% of classified citations
abstract

We propose a new framework for estimating generative models via an adversarial process, in which we simultaneously train two models: a generative model G that captures the data distribution, and a discriminative model D that estimates the probability that a sample came from the training data rather than G. The training procedure for G is to maximize the probability of D making a mistake. This framework corresponds to a minimax two-player game. In the space of arbitrary functions G and D, a unique solution exists, with G recovering the training data distribution and D equal to 1/2 everywhere. In the case where G and D are defined by multilayer perceptrons, the entire system can be trained with backpropagation. There is no need for any Markov chains or unrolled approximate inference networks during either training or generation of samples. Experiments demonstrate the potential of the framework through qualitative and quantitative evaluation of the generated samples.

hub tools

citation-role summary

background 18 method 4

citation-polarity summary

clear filters

representative citing papers

NICE: Non-linear Independent Components Estimation

cs.LG · 2014-10-30 · accept · novelty 8.0

NICE learns a composition of invertible neural-network layers that transform data into independent latent variables, enabling exact log-likelihood training and sampling for density estimation.

Reweighting Adversarial Networks for Unbinned Unfolding

hep-ph · 2026-06-04 · unverdicted · novelty 7.0

RANs generalize moment unfolding to full phase-space unbinned unfolding via detector-level Wasserstein critics without requiring support overlap or multiple iterations.

Sampling two-dimensional spin systems with transformers

cond-mat.dis-nn · 2026-04-30 · unverdicted · novelty 7.0

Transformer networks sample up to 180x180 2D Ising systems and 64x64 Edwards-Anderson systems by generating spin groups with probability approximations, yielding ~20x higher effective sample size than prior neural samplers at criticality.

Contour Refinement using Discrete Diffusion in Low Data Regime

cs.CV · 2026-02-05 · unverdicted · novelty 7.0

A CNN-based discrete diffusion method refines sparse contours from segmentation masks using simplified denoising steps and minimal post-processing, outperforming baselines on small medical and environmental datasets while running 3.5 times faster.

Diffusion Models Beat GANs on Image Synthesis

cs.LG · 2021-05-11 · accept · novelty 7.0

Diffusion models with architecture improvements and classifier guidance achieve superior FID scores to GANs on unconditional and conditional ImageNet image synthesis.

Tac-DINO: Learning Vision-Tactile Features with Patch Alignment

cs.CV · 2026-06-10 · unverdicted · novelty 6.0

Tac-DINO constructs a large tactile dataset and Vis-Tac Holographic Matching Benchmark, then proposes Vision-Tactile Patch Alignment (VTPA) methods that outperform non-aligned baselines on local-to-global feature matching.

citing papers explorer

Showing 0 of 0 citing papers after filters.

No citing papers match the current filters.