Denoising Markov Probabilistic Models (DMPM)
Published in Arxiv, 2025
This paper introduces a novel framework for discrete data generation on the hypercube ${0, 1}^d$. We establish theoretical and methodological alignment with classical continuous score-based modesls. We demonstrate the effectiveness of this approach on low and high dimensional datasets (Binary MNIST), beating other state-of-the-art methods like Discrete Flow Matching
Shariatian D., Pham L.T.N., Ocello A., Conforti G., Durmus A.O. (2025). Denoising Markov Probabilistic Models. ArXiv, abs/2502.07939.
See paper | GitHub Repository