arXiv AI By Jieke Wu, Qijie Zhu, Weimin Wu, Zeqi Ye, Minshuo Chen, Han Liu

D-DOIT: Training-free Adaptation of Discrete Diffusion via Doob's h-Transform

Read the original on arXiv AI →

D-DOIT (Discrete Doob-Oriented Inference-time Transformation) is a training‑free method that adapts discrete diffusion models to generic rewards by applying Doob's h‑transform to the reverse diffusion kernel. It reweights reverse transition probabilities using only reward values, avoiding costly future rollouts, and optionally refines trajectories near the end with a best‑of‑K strategy. Experiments on regulatory DNA design and protein inverse folding show that D-DOIT outperforms other training‑free guidance baselines, improving enhancer activity, cell‑type specificity, and protein folding success rates while maintaining sequence naturalness.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Sep 18

VGAS: Variance-Reduced Guidance and Adaptive Selection for Training-Free Reward Alignment in Discrete Diffusion

VGAS: Variance-Reduced Guidance and Adaptive Selection for Training-Free Reward Alignment in Discrete Diffusion proposes a new inference-time framework that improves steering of frozen masked discrete diffusion models. By reducing the variance of guidance estimates, applying reward tilting to clean-token logits, and adapting the selection temperature at each step, VGAS addresses three default choices in existing pipelines. Experiments on regulatory DNA, protein, and small-molecule benchmarks show that VGAS achieves the best training-free reward performance and matches or surpasses reward-fine-tuned generators.

By Kwanyoung Kim
arXiv Machine Learning
Aug 28

GRAS: Guided Reduced-Variance Proposals and Adaptive Selection for Training-Free Reward Alignment in Discrete Diffusion

The paper introduces GRAS, a method that improves training‑free reward alignment for discrete diffusion models by reducing variance in guided proposals and adapting the resampling temperature during search. It achieves this without adding denoiser cost, using Rao‑Blackwellized estimates for differentiable rewards and a leave‑one‑out baseline for non‑differentiable ones. Experiments on regulatory DNA and protein design show GRAS outperforms existing training‑free techniques and rivals reward‑fine‑tuned models.

By Kwanyoung Kim
arXiv AI
Sep 28

Spectral Feedback for Test-Time Alignment of Protein Diffusion Models

Spectral Feedback is a new algorithm for aligning discrete diffusion models at test time by iteratively revisiting and editing token positions rather than only steering the reverse process. It selects edit-sets—groups of token positions to re-mask and re-sample—using sparse Fourier representations of edit-set value functions, enabling efficient optimization of which tokens to revisit. The method is model-agnostic and improves alignment performance across pretrained, test‑time aligned, and fine‑tuned diffusion models, achieving significant gains in protein stability for inverse folding tasks.

By Shai Dickman, Mert Cemri, Landon Butler, Kannan Ramchandran
arXiv Machine Learning
Oct 9

Ambient Discrete Diffusion: Using the Wrong Data at the Right Time for Data Efficient Learning

The paper introduces RefineMix, a framework for training discrete diffusion models when data is scarce, common in scientific settings. RefineMix strategically incorporates out‑of‑distribution data at specific diffusion times to enhance generalization without distorting the sampling distribution. Experiments across five domain‑shift scenarios show that RefineMix matches or surpasses in‑domain fine‑tuning, and in protein sequence generation it nearly doubles the proportion of novel, foldable, in‑family proteins produced from just 197 in‑domain examples.

By Julian Kleutgens, Mauricio Tec, Claudio Battiloro, Francesca Dominici, Giannis Daras
arXiv Machine Learning
Jul 7

On the Design Space of Discrete Diffusion Online Adaptation for Molecular Optimization

arXiv:2607. 02834v1 Announce Type: new Abstract: Molecular optimization often starts from a pretrained generative model that captures a broad prior over valid molecular structures.

By Trevor Chen, Ariel Dai, Jason Yang, Riccardo De Santi, Daniel Khalil, Wenda Chu, Nate Gruver, Pranav Murugan, Alexander F. G. Goldberg, Maruan Al-Shedivat, Yisong Yue