English

Adversarial Jamming for Autoencoder Distribution Matching

Machine Learning 2025-12-03 v1 Information Theory math.IT

Abstract

We propose the use of adversarial wireless jamming to regularise the latent space of an autoencoder to match a diagonal Gaussian distribution. We consider the minimisation of a mean squared error distortion, where a jammer attempts to disrupt the recovery of a Gaussian source encoded and transmitted over the adversarial channel. A straightforward consequence of existing theoretical results is the fact that the saddle point of a minimax game - involving such an encoder, its corresponding decoder, and an adversarial jammer - consists of diagonal Gaussian noise output by the jammer. We use this result as inspiration for a novel approach to distribution matching in the latent space, utilising jamming as an auxiliary objective to encourage the aggregated latent posterior to match a diagonal Gaussian distribution. Using this new technique, we achieve distribution matching comparable to standard variational autoencoders and to Wasserstein autoencoders. This approach can also be generalised to other latent distributions.

Keywords

Cite

@article{arxiv.2512.02740,
  title  = {Adversarial Jamming for Autoencoder Distribution Matching},
  author = {Waleed El-Geresy and Deniz Gündüz},
  journal= {arXiv preprint arXiv:2512.02740},
  year   = {2025}
}

Comments

Presented at ICASSP 2024. 5 pages, 3 figures

R2 v1 2026-07-01T08:05:39.176Z