Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.23346 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916038512214016 |
|---|---|
| author | Kim, Jaihoon Yoon, Taehoon Phunyaphibarn, Prin Kim, Seungjun Mardani, Morteza Sung, Minhyuk |
| author_facet | Kim, Jaihoon Yoon, Taehoon Phunyaphibarn, Prin Kim, Seungjun Mardani, Morteza Sung, Minhyuk |
| contents | Discrete diffusion models have emerged as powerful frameworks for generating structured categorical data. However, efficiently sampling from reward-tilted distributions remains a fundamental challenge. While Twisted Sequential Monte Carlo (SMC) offers asymptotic exactness for this task, estimating the optimal twist function in discrete state spaces necessitates costly Monte Carlo approximations, resulting a severe computational bottleneck at inference. To overcome this limitation, we introduce Contrastive Distribution Matching (CDM), a novel framework that amortizes the cost of SMC inference by learning a parameterized twist function via positive and negative samples. For efficient training, we reformulate the gradient estimator to leverage the closed-form forward kernels of discrete diffusion models. In practice, evaluating our learned twist function incurs less than 5% additional computational overhead compared to a single forward pass of the base model. Through extensive empirical evaluations, we demonstrate that CDM consistently outperforms existing baselines under matched wall-clock time. We validate the effectiveness and versatility of our approach across a diverse range of applications, including toxic text generation, regulatory DNA sequence design, protein designability, and diffusion large language model alignment. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_23346 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Contrastive Distribution Matching for Amortized Sequential Monte Carlo in Discrete Diffusion Kim, Jaihoon Yoon, Taehoon Phunyaphibarn, Prin Kim, Seungjun Mardani, Morteza Sung, Minhyuk Machine Learning Discrete diffusion models have emerged as powerful frameworks for generating structured categorical data. However, efficiently sampling from reward-tilted distributions remains a fundamental challenge. While Twisted Sequential Monte Carlo (SMC) offers asymptotic exactness for this task, estimating the optimal twist function in discrete state spaces necessitates costly Monte Carlo approximations, resulting a severe computational bottleneck at inference. To overcome this limitation, we introduce Contrastive Distribution Matching (CDM), a novel framework that amortizes the cost of SMC inference by learning a parameterized twist function via positive and negative samples. For efficient training, we reformulate the gradient estimator to leverage the closed-form forward kernels of discrete diffusion models. In practice, evaluating our learned twist function incurs less than 5% additional computational overhead compared to a single forward pass of the base model. Through extensive empirical evaluations, we demonstrate that CDM consistently outperforms existing baselines under matched wall-clock time. We validate the effectiveness and versatility of our approach across a diverse range of applications, including toxic text generation, regulatory DNA sequence design, protein designability, and diffusion large language model alignment. |
| title | Contrastive Distribution Matching for Amortized Sequential Monte Carlo in Discrete Diffusion |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2605.23346 |