Pith. sign in

REVIEW 2 cited by

Associative Adversarial Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1611.06953 v1 pith:GLIL5GFC submitted 2016-11-18 cs.LG cs.AI

classification cs.LGcs.AI
keywords adversarialassociativedatahigher-levelnetworkssamplesdistributionlearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a higher-level associative memory for learning adversarial networks. Generative adversarial network (GAN) framework has a discriminator and a generator network. The generator (G) maps white noise (z) to data samples while the discriminator (D) maps data samples to a single scalar. To do so, G learns how to map from high-level representation space to data space, and D learns to do the opposite. We argue that higher-level representation spaces need not necessarily follow a uniform probability distribution. In this work, we use Restricted Boltzmann Machines (RBMs) as a higher-level associative memory and learn the probability distribution for the high-level features generated by D. The associative memory samples its underlying probability distribution and G learns how to map these samples to data space. The proposed associative adversarial networks (AANs) are generative models in the higher-levels of the learning, and use adversarial non-stochastic models D and G for learning the mapping between data and higher-level representation spaces. Experiments show the potential of the proposed networks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mixed-Binary Quadratic Programming via QUBO Sampling without Continuous-Variable Binarization

    quant-ph 2026-07 unverdicted novelty 6.0 of 10

    For separable mixed-binary quadratic programs, the continuous variables are integrated out analytically at fixed Lagrange multipliers, yielding a QUBO sampling formulation that avoids binarization and outperforms pena...

  2. QCA-MolGAN: Quantum Circuit Associative Molecular GAN with Multi-Agent Reinforcement Learning

    quant-ph 2025-09 reject novelty 4.0 of 10

    QCA-MolGAN couples a quantum circuit Born machine prior with a graph GAN and multi-agent RL to generate drug-like molecules on QM9, reporting property balances but no comparison to the classical baseline.

Pith tools