Preprint · 2018 · Open access

A Batched Scalable Multi-Objective Bayesian Optimization Algorithm

Xi Lin, Zhen, Hui-Ling, Zhenhua Li, Qingfu Zhang, Sam Kwong

arXiv (Cornell University) · Published 4 November 2018 · DOI 10.48550/arxiv.1811.01323

Open PDFView at the publisherCite this paper

In brief

“A Batched Scalable Multi-Objective Bayesian Optimization Algorithm” is a 2018 preprint by Xi Lin and 4 co-authors, published in arXiv (Cornell University). OpenAlex counts 16 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
16
Most cited in
2023 (4)
References
51
Authors
5

Abstract

The surrogate-assisted optimization algorithm is a promising approach for solving expensive multi-objective optimization problems. However, most existing surrogate-assisted multi-objective optimization algorithms have three main drawbacks: 1) cannot scale well for solving problems with high dimensional decision space, 2) cannot incorporate available gradient information, and 3) do not support batch optimization. These drawbacks prevent their use for solving many real-world large scale optimization problems. This paper proposes a batched scalable multi-objective Bayesian optimization algorithm to tackle these issues. The proposed algorithm uses the Bayesian neural network as the scalable surrogate model. Powered with Monte Carlo dropout and Sobolov training, the model can be easily trained and can incorporate available gradient information. We also propose a novel batch hypervolume upper confidence bound acquisition function to support batch optimization. Experimental results on various benchmark problems and a real-world application demonstrate the efficiency of the proposed algorithm.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Lin, X., Hui-Ling, Z., Li, Z., Zhang, Q., & Kwong, S. (2018). A Batched Scalable Multi-Objective Bayesian Optimization Algorithm. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1811.01323

MLA 9

Lin, Xi, et al. “A Batched Scalable Multi-Objective Bayesian Optimization Algorithm.” arXiv (Cornell University), 2018. https://doi.org/10.48550/arxiv.1811.01323.

Chicago

Lin, Xi, Zhen, Hui-Ling, Zhenhua Li, Qingfu Zhang, and Sam Kwong. 2018. “A Batched Scalable Multi-Objective Bayesian Optimization Algorithm.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1811.01323.

Harvard

Lin, X. et al. (2018) ‘A Batched Scalable Multi-Objective Bayesian Optimization Algorithm’, arXiv (Cornell University). doi:10.48550/arxiv.1811.01323.

IEEE

X. Lin, Z. Hui-Ling, Z. Li, Q. Zhang, and S. Kwong, “A Batched Scalable Multi-Objective Bayesian Optimization Algorithm,” arXiv (Cornell University), 2018, doi: 10.48550/arxiv.1811.01323.

BibTeX

@misc{lin2018batched,
  title     = {{A Batched Scalable Multi-Objective Bayesian Optimization Algorithm}},
  author    = {Lin, Xi and Hui-Ling, Zhen, and Li, Zhenhua and Zhang, Qingfu and Kwong, Sam},
  howpublished = {arXiv (Cornell University)},
  year      = {2018},
  doi       = {10.48550/arxiv.1811.01323},
  url       = {https://doi.org/10.48550/arxiv.1811.01323}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202033
202122
202222
202344
202444
202511

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Multi-Objective Optimization Algorithms

  • multi-objective Bayesian optimization
  • batch optimization
  • Bayesian neural networks
  • Monte Carlo dropout
  • gradient information
  • acquisition functions

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Lin, X., Hui-Ling, Z., Li, Z., Zhang, Q., & Kwong, S. (2018). A Batched Scalable Multi-Objective Bayesian Optimization Algorithm. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1811.01323

How many times has this paper been cited?

16 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?

Xi Lin, Zhen, Hui-Ling, Zhenhua Li, Qingfu Zhang, Sam Kwong.

What is the DOI of this paper?

10.48550/arxiv.1811.01323, permanently at https://doi.org/10.48550/arxiv.1811.01323. 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.