PCF-GAN: generating sequential data via the characteristic function of measures on the path space
Hang Lou, Siran Li, Hao Ni

TL;DR
This paper introduces PCF-GAN, a novel generative adversarial network that uses the path characteristic function to effectively generate and reconstruct high-fidelity time series data, outperforming existing methods.
Contribution
The paper develops the PCF-GAN framework with theoretical foundations, efficient training schemes, and an auto-encoder integration for improved time series generation.
Findings
PCF-GAN achieves superior generation quality over state-of-the-art baselines.
Theoretical properties of the PCF distance ensure stable and feasible training.
Auto-encoder integration enhances reconstruction capabilities.
Abstract
Generating high-fidelity time series data using generative adversarial networks (GANs) remains a challenging task, as it is difficult to capture the temporal dependence of joint probability distributions induced by time-series data. Towards this goal, a key step is the development of an effective discriminator to distinguish between time series distributions. We propose the so-called PCF-GAN, a novel GAN that incorporates the path characteristic function (PCF) as the principled representation of time series distribution into the discriminator to enhance its generative performance. On the one hand, we establish theoretical foundations of the PCF distance by proving its characteristicity, boundedness, differentiability with respect to generator parameters, and weak continuity, which ensure the stability and feasibility of training the PCF-GAN. On the other hand, we design efficient…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsTime Series Analysis and Forecasting · Music and Audio Processing · Generative Adversarial Networks and Image Synthesis
