Preprint · 2015 · Open access

Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions

Shah, Amar, Zoubin Ghahramani

arXiv (Cornell University), 28, 3330–3338 · Published 23 November 2015 · DOI 10.48550/arxiv.1511.07130

Open PDFView at the publisherCite this paper

In brief

“Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions” is a 2015 preprint by Shah, Amar and Zoubin Ghahramani, published in arXiv (Cornell University). OpenAlex counts 149 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
149
Most cited in
2019 (28)
References
37
Authors
2

Abstract

We develop parallel predictive entropy search (PPES), a novel algorithm for Bayesian optimization of expensive black-box objective functions. At each iteration, PPES aims to select a batch of points which will maximize the information gain about the global maximizer of the objective. Well known strategies exist for suggesting a single evaluation point based on previous observations, while far fewer are known for selecting batches of points to evaluate in parallel. The few batch selection schemes that have been studied all resort to greedy methods to compute an optimal batch. To the best of our knowledge, PPES is the first non-greedy batch Bayesian optimization strategy. We demonstrate the benefit of this approach in optimization performance on both synthetic and real world applications, including problems in machine learning, rocket science and robotics.

Cite this paper

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

APA 7

Amar, S., & Ghahramani, Z. (2015). Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions. arXiv (Cornell University), 28, 3330–3338. https://doi.org/10.48550/arxiv.1511.07130

MLA 9

Amar, Shah,, and Zoubin Ghahramani. “Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions.” arXiv (Cornell University), vol. 28, 2015, pp. 3330–3338. https://doi.org/10.48550/arxiv.1511.07130.

Chicago

Amar, Shah, and Zoubin Ghahramani. 2015. “Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions.” arXiv (Cornell University) 28: 3330–3338. https://doi.org/10.48550/arxiv.1511.07130.

Harvard

Amar, S. and Ghahramani, Z. (2015) ‘Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions’, arXiv (Cornell University), 28, pp. 3330–3338. doi:10.48550/arxiv.1511.07130.

IEEE

S. Amar and Z. Ghahramani, “Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions,” arXiv (Cornell University), vol. 28, pp. 3330–3338, 2015, doi: 10.48550/arxiv.1511.07130.

BibTeX

@misc{amar2015parallel,
  title     = {{Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions}},
  author    = {Amar, Shah, and Ghahramani, Zoubin},
  howpublished = {arXiv (Cornell University)},
  year      = {2015},
  volume    = {28},
  pages     = {3330--3338},
  doi       = {10.48550/arxiv.1511.07130},
  url       = {https://doi.org/10.48550/arxiv.1511.07130}
}

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

Citations by year

YearCitationsShare of the best year
20171313
201877
20192828
20202222
20212323
20221616
20231313
202477
20251010
202666

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research

  • Bayesian optimization
  • batch optimization
  • expensive black-box functions
  • information gain
  • global optimization
  • parallel evaluation

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Amar, S., & Ghahramani, Z. (2015). Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functions. arXiv (Cornell University), 28, 3330–3338. https://doi.org/10.48550/arxiv.1511.07130

How many times has this paper been cited?

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

Shah, Amar, Zoubin Ghahramani.

What is the DOI of this paper?

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