Skip to content
AI News HubLIVE
Original source2 min read

Diffusion Tree Sampling for Inference Time Adaptation of Crystal Generative Models

Summary

Researchers adapt diffusion-based crystal generative models at inference time using Diffusion Tree Sampling (DTS), a Monte Carlo tree search over the denoising trajectory, enabling guidance toward multiple conflicting properties without fine-tuning and extending to multi-objective sampling across a Pareto front.

SourcearXiv Machine LearningAuthor: Daniel T. Levy, Vineet Jain, Tara Akhound-Sadegh, S\'ekou-Oumar Kaba, Siamak Ravanbakhsh
Diffusion Tree Sampling for Inference Time Adaptation of Crystal Generative Models
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 12 Nov 2026]

Title:Diffusion Tree Sampling for Inference Time Adaptation of Crystal Generative Models

View a PDF of the paper titled Diffusion Tree Sampling for Inference Time Adaptation of Crystal Generative Models, by Daniel T. Levy and 4 other authors

View PDF HTML (experimental)

Abstract:Diffusion-based generative models have become strong priors over plausible crystal structures, but turning that prior into promising candidates requires steering toward several conflicting properties at once. Fine-tuning is expensive and produces a new model for every new objective, while differentiable guidance is not applicable to many real-world tasks. We instead adapt these generative models at inference time using Diffusion Tree Sampling (DTS), a Monte Carlo tree search procedure over the denoising trajectory. We make two technical contributions on top of DTS that are particularly relevant for AI-for-science applications. First, we show how to use existing property-conditional generative models (e.g., models fine-tuned for classifier-free guidance) as guided proposals inside DTS, without distorting the target distribution. Second, we extend DTS to multi-objective sampling, so that a single search produces samples spanning an entire Pareto front. We instantiate both adaptations on de novo crystal generation: improving the stability of crystals generated by different models, using pretrained conditional models to generate crystals belonging to rare space groups or with high bulk modulus, and generating crystals along a Pareto front of high dielectric constant and high bandgap materials. Across these tasks, DTS-based inference-time adaptation successfully improves model outputs without modifying the models themselves.

Comments: 24 pages, 7 figures. Accepted to NeurIPS 2026

Subjects:

Machine Learning (cs.LG); Materials Science (cond-mat.mtrl-sci); Artificial Intelligence (cs.AI)

Cite as: arXiv:2611.17462 [cs.LG]

(or arXiv:2611.17462v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.17462

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Daniel Levy [view email] [v1] Thu, 12 Nov 2026 19:40:38 UTC (1,978 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Diffusion Tree Sampling for Inference Time Adaptation of Crystal Generative Models, by Daniel T. Levy and 4 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.LG

new | recent | 2026-11

Change to browse by:

cond-mat cond-mat.mtrl-sci cs cs.AI

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • DTS performs Monte Carlo tree search over the denoising trajectory to steer generation at inference time.
  • Existing property-conditional models can serve as guided proposals within DTS without distorting the target distribution.
  • A multi-objective extension lets a single search produce samples spanning an entire Pareto front.
  • The approach improves crystal stability, rare space group generation, and dielectric-bandgap trade-offs without modifying the models.

Highlights and analysis are generated automatically and may contain errors. Check the original source.