← Back to all news
arXiv Machine Learning By Hyunjoo Kim, Sicheng Wu, Agastya Venkatraman, Guang Lin, Sehwan Kim

Deciding When to Switch: E-Processes for Adaptive Minimax Training for Generative Adversarial Nets

Read the original on arXiv Machine Learning →

arXiv:2608. 10096v1 Announce Type: cross Abstract: Modern data science increasingly gives rise to hypothesis-testing problems that are not naturally formulated in terms of parameters within prespecified statistical models.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Sep 22

When Does Adversarial Refinement Help? A Negative Result and Open Problem in Adapting R3GAN to Time Series Imputation

The paper investigates whether the stable GAN architecture R3GAN can improve time‑series imputation when adapted to 1‑D temporal data. Using a coarse‑to‑fine refinement framework and a frequency‑domain discriminator, the authors evaluate 14 saved configurations across three datasets and find a negative result: most configurations either show negligible improvement or degrade performance compared to baseline methods. The study highlights that the usual argument—GANs optimize distributional objectives rather than point‑wise ones—does not fully explain the lack of benefit, and it poses an open problem regarding why a learned discriminator fails to provide useful refinement gradients while diffusion denoisers succeed, offering practical guidance on when adversarial refinement may be worthwhile.

By Yufeng He
llmsdiffusionbenchmarkssafety
More like this →
arXiv Machine Learning
Sep 22

EmbeddGAN: A Novel GAN Framework Using an Embedding Network and Gini Distance Correlation

EmbeddGAN introduces a new GAN framework that replaces the traditional discriminator with an embedding network trained to maximize statistical dependence between embeddings and real/fake labels using Gini distance correlation (gCor). The generator simultaneously minimizes this dependence, encouraging real and generated samples to become indistinguishable in the learned low‑dimensional embedding space. Experiments on MNIST, CIFAR‑10, and CelebA show competitive performance and notably more stable training dynamics compared to established baselines.

By MaTais Caldwell, Yixin Chen, Xin Dang, Charles Walter
ragdiffusionsafety
More like this →
arXiv Machine Learning
Jul 8

Imbalance-Robust and Sampling-Efficient Continuous Conditional GANs via Adaptive Vicinal Learning and Auxiliary Regularization

arXiv:2508. 01725v5 Announce Type: replace Abstract: Recent advances in continuous conditional generative modeling, including Continuous conditional Generative Adversarial Network (CcGAN) and Continuous Conditional Diffusion Model (CCDM), estimate high-dimensional data distributions conditioned on scalar regression labels such as angles, ages, or temperatures.

By Xin Ding, Yun Chen, Yongwei Wang, Kao Zhang, Sen Zhang, Peibei Cao, Xiangxue Wang
diffusionsafety
More like this →