arXiv:2611.14656v1 Announce Type: new
Abstract: Thompson sampling is natural randomized strategy for optimizing unknown functions in a black-box manner. In continuous global optimization, Thompson sampling has largely been restricted to Gaussian process priors, as these are essentially the only class for which computing the posterior distribution has been tractable in practice. In this work, we introduce \emph{prior-fitted diffusion transformers}, which are diffusion models that perform Thompson sampling in-context at inference time, after being pre-trained using the prior-fitted network paradigm. To apply these models, we develop a set of practical non-Gaussian priors for general black-box functions—including those that have characteristics that cannot be achieved under Gaussianity, such as priors over unimodal functions. We also quantify the tradeoff between model size and the number of pre-training iterations, and show that these models follow scaling laws akin to those observed in transformers defined over other modalities. Across a set of global optimization benchmarks, we show that prior-fitted diffusion transformers with non-Gaussian priors can achieve improved performance compared to traditional pipelines built on Gaussian processes.
Trending
- An Open Dataset and Agentic Framework for CUDA Kernel Generation
- AudioLDM 2, but faster ⚡️
- Bitdefender Antivirus Plus Review: Undercutting the Competition
- Closing the Loop: Co-Evolving EM for Irregular Time Series Generation in Lifted Representations
- Fetch Cuts ML Processing Latency by 50% Using Amazon SageMaker & Hugging Face
- Thompson Sampling using Prior-fitted Diffusion Transformers
- Spread Your Wings: Falcon 180B is here
- [2609.09854] When Does Low-Bit Quantization Preserve the Decisions of Vector Search?
