about
Masked Generative Modeling with Enhanced Sampling Scheme (arxiv.org)
1 point by PaulHoule on Sep 25, 2023 | hide | past | pdf | discuss on HN

In plain words: Masked generators fill hidden tokens step by step to build a sample. This scheme fills them freely, erases tokens that make the result look fake, refills them with a realism checker, keeping variety and quality. It beat the usual fill-in decoding on 128 time-series datasets.

Abstract

This paper presents a novel sampling scheme for masked non-autoregressive generative modeling. We identify the limitations of TimeVQVAE, MaskGIT, and Token-Critic in their sampling processes, and propose Enhanced Sampling Scheme (ESS) to overcome these limitations. ESS explicitly ensures both sample diversity and fidelity, and consists of three stages: Naive Iterative Decoding, Critical Reverse Sampling, and Critical Resampling. ESS starts by sampling a token set using the naive iterative decoding as proposed in MaskGIT, ensuring sample diversity. Then, the token set undergoes the critical reverse sampling, masking tokens leading to unrealistic samples. After that, critical resampling reconstructs masked tokens until the final sampling step is reached to ensure high fidelity. Critical resampling uses confidence scores obtained from a self-Token-Critic to better measure the realism of sampled tokens, while critical reverse sampling uses the structure of the quantized latent vector space to discover unrealistic sample paths. We demonstrate significant performance gains of ESS in both unconditional sampling and class-conditional sampling using all the 128 datasets in the UCR Time Series archive.

Daesoo Lee, Erlend Aune, Sara Malacarne
arXiv:2309.07945 · cs.LG, cs.AI, stat.ML · submitted Sep 14, 2023
abstract · pdf · html

add comment on HN