Papers › Single-level Adversarial Data Synthesis based on Neural Tangent Kernels

Single-level Adversarial Data Synthesis based on Neural Tangent Kernels

8 Apr 2022arXiv:2204.04090archive 2025-07-28

Yu-Rong Zhang, Ruei-Yang Su, Sheng Yen Chou, Shan-Hung Wu

Abstract Generative adversarial networks (GANs) have achieved impressive performance in data synthesis and have driven the development of many applications. However, GANs are known to be hard to train due to their bilevel objective, which leads to the problems of convergence, mode collapse, and gradient vanishing. In this paper, we propose a new generative model called the generative adversarial NTK (GA-NTK) that has a single-level objective. The GA-NTK keeps the spirit of adversarial learning (which helps generate plausible data) while avoiding the training difficulties of GANs. This is done by modeling the discriminator as a Gaussian process with a neural tangent kernel (NTK-GP) whose training dynamics can be completely described by a closed-form formula. We analyze the convergence behavior of GA-NTK trained by gradient descent and give some sufficient conditions for convergence. We also conduct extensive experiments to study the advantages and limitations of GA-NTK and propose some techniques that make GA-NTK more practical.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

ga-ntk/ga-ntk officialmentioned in paperjaxSyntology: not harvested report
lionelmessi6410/ntga officialmentioned in paperjaxApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Densely Connected Convolutional Networks (arXiv:1608.06993; that paper's own run record: 48 ran (of which 0 constructed an object rather than computing a result; 32 with no instrument failure: 2 honoured, 0 violated, 30 with no contract checked; 16 where Syntology's instrument failed) · 23 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Bilevel Optimization

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

BASEGaussian ProcessNTK

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections