QTD turns continuous data into binary codes and uses a Hamming-distance Markov chain with truncated uniformization to sample, provably reaching epsilon TV error with O(d ln^2(d/epsilon)) score evaluations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Almost Linear Convergence under Minimal Score Assumptions: Quantized Transition Diffusion
QTD turns continuous data into binary codes and uses a Hamming-distance Markov chain with truncated uniformization to sample, provably reaching epsilon TV error with O(d ln^2(d/epsilon)) score evaluations.