Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Generating from Discrete Distributions Using Diffusions: Insights from Random Constraint Satisfaction Problems
by
Bhatt, Alankrita
, Germain Kolossov
, Montanari, Andrea
, Gupta, Mukur
in
Benchmarks
/ Constraints
2026
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Generating from Discrete Distributions Using Diffusions: Insights from Random Constraint Satisfaction Problems
by
Bhatt, Alankrita
, Germain Kolossov
, Montanari, Andrea
, Gupta, Mukur
in
Benchmarks
/ Constraints
2026
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Generating from Discrete Distributions Using Diffusions: Insights from Random Constraint Satisfaction Problems
Paper
Generating from Discrete Distributions Using Diffusions: Insights from Random Constraint Satisfaction Problems
2026
Request Book From Autostore
and Choose the Collection Method
Overview
Generating data from discrete distributions is important for a number of application domains including text, tabular data, and genomic data. Several groups have recently used random \\(k\\)-satisfiability (\\(k\\)-SAT) as a synthetic benchmark for new generative techniques. In this paper, we show that fundamental insights from the theory of random constraint satisfaction problems have observable implications (sometime contradicting intuition) on the behavior of generative techniques on such benchmarks. More precisely, we study the problem of generating a uniformly random solution of a given (random) \\(k\\)-SAT or \\(k\\)-XORSAT formula. Among other findings, we observe that: \\((i)\\)~Continuous diffusions outperform masked discrete diffusions; \\((ii)\\)~Learned diffusions can match the theoretical `ideal' accuracy; \\((iii)\\)~Smart ordering of the variables can significantly improve accuracy, although not following popular heuristics.
Publisher
Cornell University Library, arXiv.org
Subject
MBRLCatalogueRelatedBooks
This website uses cookies to ensure you get the best experience on our website.