Fast Generation for Convolutional Autoregressive Models
Prajit Ramachandran, Tom Le Paine, Pooya Khorrami, Mohammad, Babaeizadeh, Shiyu Chang, Yang Zhang, Mark A. Hasegawa-Johnson, Roy H., Campbell, Thomas S. Huang

TL;DR
This paper introduces a caching method to accelerate generation in convolutional autoregressive models, significantly reducing computation time and enabling practical deployment.
Contribution
The paper presents a novel caching technique that speeds up generation in convolutional autoregressive models like Wavenet and PixelCNN++, achieving up to 183x faster inference.
Findings
Up to 21x speedup for Wavenet
Up to 183x speedup for PixelCNN++
Enables real-time generation in practice
Abstract
Convolutional autoregressive models have recently demonstrated state-of-the-art performance on a number of generation tasks. While fast, parallel training methods have been crucial for their success, generation is typically implemented in a na\"{i}ve fashion where redundant computations are unnecessarily repeated. This results in slow generation, making such models infeasible for production environments. In this work, we describe a method to speed up generation in convolutional autoregressive models. The key idea is to cache hidden states to avoid redundant computation. We apply our fast generation method to the Wavenet and PixelCNN++ models and achieve up to and speedups respectively.
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Reservoir Computing · Generative Adversarial Networks and Image Synthesis · Speech Recognition and Synthesis
MethodsMixture of Logistic Distributions · Dilated Causal Convolution · WaveNet
