Metraipolis › archive › dc_659014ba4cfc
LATS: Levy Adaptive Tree Sampling for Feedback-Driven Diverse Target Discovery — arXiv:2609.06761
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06761
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T13:57:22.279Z
- SHA-256 of the archived text
7e2ddb0e231971dc5c96a26e06624ef8aa1c8b2448d432f84eebe22120c6fff3- Stable URL of this page
https://metraipolis.com/documento/dc_659014ba4cfc
How to cite
LATS: Levy Adaptive Tree Sampling for Feedback-Driven Diverse Target Discovery — arXiv:2609.06761 — arXiv (en), https://arxiv.org/abs/2609.06761 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_659014ba4cfc (Metraipolis archive dc_659014ba4cfc, sha256 7e2ddb0e231971dc5c96a26e06624ef8aa1c8b2448d432f84eebe22120c6fff3)
BibTeX
@misc{dc659014ba4cfc,
title = {LATS: Levy Adaptive Tree Sampling for Feedback-Driven Diverse Target Discovery — arXiv:2609.06761},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06761},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_659014ba4cfc; sha256 7e2ddb0e231971dc5c96a26e06624ef8aa1c8b2448d432f84eebe22120c6fff3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06761. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
While diffusion models excel at capturing complex data distributions, scientific discovery often requires steering generation toward specific, uncharacterized regions that maximize a target objective. These high-utility modes frequently reside in low-likelihood tail regions and are only revealed sequentially through interactive feedback. Existing diffusion samplers fail in this regime: they inherit the pre-trained model's bias toward high-density regions, leaving rare yet promising phenomena underexplored. Conversely, exploration-heavy samplers ensure broad coverage but fail to efficiently exploit high-utility modes when constrained by a strict sampling budget. To resolve this dilemma, we introduce Levy Adaptive Tree Search (LATS), a principled sampling framework for online feedback-driven search. LATS leverages heavy-tailed exploration coupled with tree-based value backpropagation to progressively uncover preferred modes. By maintaining broad distributional coverage, LATS successfully discovers low-likelihood, high-utility regions while preserving sample fidelity and structural diversity. Experiments across diverse benchmarks, including materials science, demonstrate that LATS significantly outperforms baselines in target discovery efficiency. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-09 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.06761 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T13:39:42.908Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).