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.
Associative Adversarial Networks
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
REJECT 1roles
extension 1polarities
extend 1representative citing papers
citing papers explorer
-
QCA-MolGAN: Quantum Circuit Associative Molecular GAN with Multi-Agent Reinforcement Learning
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.