Discrete Markov Bridge

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Li, Hengli, Wang, Yuxuan, Zhu, Song-Chun, Wu, Ying Nian, Zheng, Zilong
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915305381429248
author Li, Hengli
Wang, Yuxuan
Zhu, Song-Chun
Wu, Ying Nian
Zheng, Zilong
author_facet Li, Hengli
Wang, Yuxuan
Zhu, Song-Chun
Wu, Ying Nian
Zheng, Zilong
contents Discrete diffusion has recently emerged as a promising paradigm in discrete data modeling. However, existing methods typically rely on a fixed rate transition matrix during training, which not only limits the expressiveness of latent representations, a fundamental strength of variational methods, but also constrains the overall design space. To address these limitations, we propose Discrete Markov Bridge, a novel framework specifically designed for discrete representation learning. Our approach is built upon two key components: Matrix Learning and Score Learning. We conduct a rigorous theoretical analysis, establishing formal performance guarantees for Matrix Learning and proving the convergence of the overall framework. Furthermore, we analyze the space complexity of our method, addressing practical constraints identified in prior studies. Extensive empirical evaluations validate the effectiveness of the proposed Discrete Markov Bridge, which achieves an Evidence Lower Bound (ELBO) of 1.38 on the Text8 dataset, outperforming established baselines. Moreover, the proposed model demonstrates competitive performance on the CIFAR-10 dataset, achieving results comparable to those obtained by image-specific generation approaches.
format Preprint
id arxiv_https___arxiv_org_abs_2505_19752
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Discrete Markov Bridge
Li, Hengli
Wang, Yuxuan
Zhu, Song-Chun
Wu, Ying Nian
Zheng, Zilong
Machine Learning
Artificial Intelligence
Computation and Language
Discrete diffusion has recently emerged as a promising paradigm in discrete data modeling. However, existing methods typically rely on a fixed rate transition matrix during training, which not only limits the expressiveness of latent representations, a fundamental strength of variational methods, but also constrains the overall design space. To address these limitations, we propose Discrete Markov Bridge, a novel framework specifically designed for discrete representation learning. Our approach is built upon two key components: Matrix Learning and Score Learning. We conduct a rigorous theoretical analysis, establishing formal performance guarantees for Matrix Learning and proving the convergence of the overall framework. Furthermore, we analyze the space complexity of our method, addressing practical constraints identified in prior studies. Extensive empirical evaluations validate the effectiveness of the proposed Discrete Markov Bridge, which achieves an Evidence Lower Bound (ELBO) of 1.38 on the Text8 dataset, outperforming established baselines. Moreover, the proposed model demonstrates competitive performance on the CIFAR-10 dataset, achieving results comparable to those obtained by image-specific generation approaches.
title Discrete Markov Bridge
topic Machine Learning
Artificial Intelligence
Computation and Language
url https://arxiv.org/abs/2505.19752