Preprint · 2023 · Open access
qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling
arXiv (Cornell University) · Published 24 October 2023 · DOI 10.48550/arxiv.2310.15788
In brief
“qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling” is a 2023 preprint by S. Ashwin Renganathan and Carlson, Kade E., published in arXiv (Cornell University). OpenAlex counts 6 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 6
- Most cited in
- 2025 (3)
- References
- 45
- Authors
- 2
Abstract
Classical evolutionary approaches for multiobjective optimization are quite accurate but incur a lot of queries to the objectives; this can be prohibitive when objectives are expensive oracles. A sample-efficient approach to solving multiobjective optimization is via Gaussian process (GP) surrogates and Bayesian optimization (BO). Multiobjective Bayesian optimization (MOBO) involves the construction of an acquisition function which is optimized to acquire new observation candidates sequentially. This ``inner'' optimization can be hard due to various reasons: acquisition functions being nonconvex, nondifferentiable and/or unavailable in analytical form; batch sampling usually exacerbates these problems and the success of MOBO heavily relies on this inner optimization. This, ultimately, affects their sample efficiency. To overcome these challenges, we propose a Thompson sampling (TS) based approach ($q\texttt{POTS}$). Whereas TS chooses candidates according to the probability that they are optimal, $q\texttt{POTS}$ chooses candidates according to the probability that they are Pareto optimal. Instead of a hard acquisition function optimization, $q\texttt{POTS}~$ solves a cheap multiobjective optimization on the GP posteriors with evolutionary approaches. This way we get the best of both worlds: accuracy of evolutionary approaches and sample-efficiency of MOBO. New candidates are chosen on the posterior GP Pareto frontier according to a maximin distance criterion. $q\texttt{POTS}~$ is endowed with theoretical guarantees, a natural exploration-exploitation trade-off, and superior empirical performance.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Renganathan, S. A., & E., C. K. (2023). qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2310.15788
MLA 9
Renganathan, S. Ashwin, and Carlson, Kade E. “qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling.” arXiv (Cornell University), 2023. https://doi.org/10.48550/arxiv.2310.15788.
Chicago
Renganathan, S. Ashwin and Carlson, Kade E. 2023. “qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2310.15788.
Harvard
Renganathan, S. A. and E., C. K. (2023) ‘qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling’, arXiv (Cornell University). doi:10.48550/arxiv.2310.15788.
IEEE
S. A. Renganathan and C. K. E., “qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling,” arXiv (Cornell University), 2023, doi: 10.48550/arxiv.2310.15788.
BibTeX
@misc{renganathan2023qpots,
title = {{qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling}},
author = {Renganathan, S. Ashwin and E., Carlson, Kade},
howpublished = {arXiv (Cornell University)},
year = {2023},
doi = {10.48550/arxiv.2310.15788},
url = {https://doi.org/10.48550/arxiv.2310.15788}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 1 | |
| 2025 | 3 | |
| 2026 | 2 |
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms
- batch sampling
- Kriging surrogate model
- sample efficiency
- Pareto front
- exploration-exploitation balance
- expensive objective functions
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Renganathan, S. A., & E., C. K. (2023). qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2310.15788
How many times has this paper been cited?
6 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
S. Ashwin Renganathan, Carlson, Kade E..
What is the DOI of this paper?
10.48550/arxiv.2310.15788, permanently at https://doi.org/10.48550/arxiv.2310.15788. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.