Conference paper · 2024 · Open access

Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization

Alaleh Ahmadianshalchi, Syrine Belakaria, Janardhan Rao Doppa

Proceedings of the AAAI Conference on Artificial Intelligence, 38(10), 10784–10794 · Published 24 March 2024 · DOI 10.1609/aaai.v38i10.28951

Open PDFView at the publisherCite this paper

In brief

“Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization” is a 2024 conference paper by Alaleh Ahmadianshalchi and 2 co-authors, published in Proceedings of the AAAI Conference on Artificial Intelligence. OpenAlex counts 23 citations as of 18 November 2026, which puts it in the top 7% of works published in 2024 by citations. It is open access: the full text is free to read at Proceedings of the AAAI Conference on Artificial Intelligence.

Citations
23
Most cited in
2025 (12)
Field-weighted impact
4.84
References
69
Authors
3

Abstract

We consider the problem of multi-objective optimization (MOO) of expensive black-box functions with the goal of discovering high-quality and diverse Pareto fronts where we are allowed to evaluate a batch of inputs. This problem arises in many real-world applications including penicillin production where diversity of solutions is critical. We solve this problem in the framework of Bayesian optimization (BO) and propose a novel approach referred to as Pareto front-Diverse Batch Multi-Objective BO (PDBO). PDBO tackles two important challenges: 1) How to automatically select the best acquisition function in each BO iteration, and 2) How to select a diverse batch of inputs by considering multiple objectives. We propose principled solutions to address these two challenges. First, PDBO employs a multi-armed bandit approach to select one acquisition function from a given library. We solve a cheap MOO problem by assigning the selected acquisition function for each expensive objective function to obtain a candidate set of inputs for evaluation. Second, it utilizes Determinantal Point Processes (DPPs) to choose a Pareto-front-diverse batch of inputs for evaluation from the candidate set obtained from the first step. The key parameters for the methods behind these two steps are updated after each round of function evaluations. Experiments on multiple MOO benchmarks demonstrate that PDBO outperforms prior methods in terms of both the quality and diversity of Pareto solutions.

Cite this paper

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

APA 7

Ahmadianshalchi, A., Belakaria, S., & Doppa, J. R. (2024). Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization. Proceedings of the AAAI Conference on Artificial Intelligence, 38(10), 10784–10794. https://doi.org/10.1609/aaai.v38i10.28951

MLA 9

Ahmadianshalchi, Alaleh, et al. “Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 10, 2024, pp. 10784–10794. https://doi.org/10.1609/aaai.v38i10.28951.

Chicago

Ahmadianshalchi, Alaleh, Syrine Belakaria, and Janardhan Rao Doppa. 2024. “Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization.” Proceedings of the AAAI Conference on Artificial Intelligence 38 (10): 10784–10794. https://doi.org/10.1609/aaai.v38i10.28951.

Harvard

Ahmadianshalchi, A., Belakaria, S. and Doppa, J. R. (2024) ‘Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization’, Proceedings of the AAAI Conference on Artificial Intelligence, 38(10), pp. 10784–10794. doi:10.1609/aaai.v38i10.28951.

IEEE

A. Ahmadianshalchi, S. Belakaria, and J. R. Doppa, “Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 10, pp. 10784–10794, 2024, doi: 10.1609/aaai.v38i10.28951.

BibTeX

@inproceedings{ahmadianshalchi2024pareto,
  title     = {{Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization}},
  author    = {Ahmadianshalchi, Alaleh and Belakaria, Syrine and Doppa, Janardhan Rao},
  booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year      = {2024},
  volume    = {38},
  number    = {10},
  pages     = {10784--10794},
  doi       = {10.1609/aaai.v38i10.28951},
  url       = {https://doi.org/10.1609/aaai.v38i10.28951}
}

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

Citations by year

YearCitationsShare of the best year
202422
20251212
202699

Its field-weighted citation impact is 4.84: it has been cited 4.84 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

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

  • multi-objective Bayesian optimization
  • Pareto front diversity
  • multi-armed bandits
  • determinantal point processes
  • expensive black-box functions
  • penicillin production

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?

Ahmadianshalchi, A., Belakaria, S., & Doppa, J. R. (2024). Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization. Proceedings of the AAAI Conference on Artificial Intelligence, 38(10), 10784–10794. https://doi.org/10.1609/aaai.v38i10.28951

How many times has this paper been cited?

23 times, according to OpenAlex on 18 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 Proceedings of the AAAI Conference on Artificial Intelligence: sign in and open the PDF from this page.

Who wrote this paper?

Alaleh Ahmadianshalchi, Syrine Belakaria, Janardhan Rao Doppa.

What is the DOI of this paper?

10.1609/aaai.v38i10.28951, permanently at https://doi.org/10.1609/aaai.v38i10.28951. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 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.