paper-with-me

홈 › Papers

A New GAN-based End-to-End TTS Training Algorithm

2019-04-09 · Haohan Guo, Frank K. Soong, Lei He, Lei Xie

End-to-end, autoregressive model-based TTS has shown significant performance improvements over the conventional one. However, the autoregressive module training is affected by the exposure bias, or the mismatch between the different distributions of real and predicted data. While real data is available in training, but in testing, only predicted data is available to feed the autoregressive module. By introducing both real and generated data sequences in training, we can alleviate the effects of the exposure bias. We propose to use Generative Adversarial Network (GAN) along with the key idea of Professor Forcing in training. A discriminator in GAN is jointly trained to equalize the difference between real and predicted data. In AB subjective listening test, the results show that the new approach is preferred over the standard transfer learning with a CMOS improvement of 0.1. Sentence level intelligibility tests show significant improvement in a pathological test set. The GAN-trained new model is also more stable than the baseline to produce better alignments for the Tacotron output.

📄 PDF Abstract BibTeX arXiv:1904.04775

Code (0)

등록된 구현이 없습니다.

Tasks

Generative Adversarial NetworkSentenceTransfer Learning

Methods 이 논문이 사용한 방법론

Griffin-Lim Algorithm The Griffin-Lim Algorithm (GLA) is a phase reconstruction method based on the redundancy of the short-time Fourier transform. It promotes the consistency of a spectrogram by…
Sigmoid Activation 설명 없음
Highway Layer 설명 없음
Residual Connection 설명 없음
Batch Normalization 설명 없음
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Residual GRU A Residual GRU is a gated recurrent unit (GRU) that incorporates the idea of residual connections from…
BiGRU A Bidirectional GRU, or BiGRU, is a sequence processing model that consists of two GRUs. one taking the input in a forward…

Similar Papers 제목 키워드 기반

Really should we pruning after model be totally trained? Pruning based on a small amount of training

2019-01-24 · Li Yue, Zhao Weibin, Shang Lin

Pre-training of models in pruning algorithms plays an important role in pruning decision-making. We find that excessive pre-training is not necessary for pruning algorithms. According to this idea, we propose a pruning a…

Decision Making

Selection of Most Appropriate Backpropagation Training Algorithm in Data Pattern Recognition

2014-09-11 · Hindayati Mustafidah, Sri Hartati, Retantyo Wardoyo, Agus Harjoko

There are several training algorithms for backpropagation method in neural network. Not all of these algorithms have the same accuracy level demonstrated through the percentage level of suitability in recognizing pattern…

On the Algorithmic Stability of Adversarial Training

2021-12-01 · NeurIPS 2021 12 · Yue Xing, Qifan Song, Guang Cheng

The adversarial training is a popular tool to remedy the vulnerability of deep learning models against adversarial attacks, and there is rich theoretical literature on the training loss of adversarial training algorithms…

SpSC: A Fast and Provable Algorithm for Sampling-Based GNN Training

2021-09-29 · Shihui Song, Peng Jiang

Neighbor sampling is a commonly used technique for training Graph Neural Networks (GNNs) on large graphs. Previous work has shown that sampling-based GNN training can be considered as Stochastic Compositional Optimizatio…

CPUGPU

Benchmarking Neural Network Training Algorithms

2023-06-12 · George E. Dahl, Frank Schneider, Zachary Nado, Naman Agarwal 외

Training algorithms, broadly construed, are an essential part of every deep learning pipeline. Training algorithm improvements that speed up training across a wide variety of workloads (e.g., better update rules, tuning …

Benchmarking