Conference paper · 2024 · Open access

Lower Confidence Bound for Preference Selection in Interactive Multi-Objective Optimization

Arash Heidari, Sebastian Rojas Gonzalez, Tom Dhaene, Ivo Couckuyt

Genetic and Evolutionary Computation Conference Companion (GECCO Companion), 339–342 · Published 14 July 2024 · DOI 10.1145/3638530.3654317

Open PDFView at the publisherCite this paper

In brief

“Lower Confidence Bound for Preference Selection in Interactive Multi-Objective Optimization” is a 2024 conference paper by Arash Heidari and 3 co-authors, published in Genetic and Evolutionary Computation Conference Companion (GECCO Companion). OpenAlex counts 5 citations as of 19 November 2026, which puts it in the top 6% of works published in 2024 by citations. It is open access: the full text is free to read at Ghent University Academic Bibliography (Ghent University).

Citations
5
Most cited in
2025 (3)
Field-weighted impact
1.17
References
19
Authors
4

Abstract

In multi-objective optimization, the goal is to find the non-dominated or Pareto-optimal set that reveals the optimal trade-offs among the conflicting objectives. Conventionally, the Decision-Maker (DM) selects their preferred solution from this set post-optimization. Evidently, this approach necessitates the computation of numerous non-dominated solutions, incurring high computational costs when the evaluation of the objectives is expensive. To address these challenges, interactive optimization offers a potentially more efficient approach: sequential interactions with the DM during the optimization process, enabling the judicious allocation of the optimization budget by guiding the process toward the most desirable regions of the Pareto front. In this study, we propose to exploit the well-known Lower Confidence Bound acquisition function in Bayesian optimization, to interactively estimate the DM's preferred solution in a data-efficient manner, even in scenarios where the DM experiences uncertainty in their decision-making process.

Cite this paper

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

APA 7

Heidari, A., Gonzalez, S. R., Dhaene, T., & Couckuyt, I. (2024). Lower Confidence Bound for Preference Selection in Interactive Multi-Objective Optimization. Genetic and Evolutionary Computation Conference Companion (GECCO Companion), 339–342. https://doi.org/10.1145/3638530.3654317

MLA 9

Heidari, Arash, et al. “Lower Confidence Bound for Preference Selection in Interactive Multi-Objective Optimization.” Genetic and Evolutionary Computation Conference Companion (GECCO Companion), 2024, pp. 339–342. https://doi.org/10.1145/3638530.3654317.

Chicago

Heidari, Arash, Sebastian Rojas Gonzalez, Tom Dhaene, and Ivo Couckuyt. 2024. “Lower Confidence Bound for Preference Selection in Interactive Multi-Objective Optimization.” Genetic and Evolutionary Computation Conference Companion (GECCO Companion): 339–342. https://doi.org/10.1145/3638530.3654317.

Harvard

Heidari, A. et al. (2024) ‘Lower Confidence Bound for Preference Selection in Interactive Multi-Objective Optimization’, Genetic and Evolutionary Computation Conference Companion (GECCO Companion), pp. 339–342. doi:10.1145/3638530.3654317.

IEEE

A. Heidari, S. R. Gonzalez, T. Dhaene, and I. Couckuyt, “Lower Confidence Bound for Preference Selection in Interactive Multi-Objective Optimization,” Genetic and Evolutionary Computation Conference Companion (GECCO Companion), pp. 339–342, 2024, doi: 10.1145/3638530.3654317.

BibTeX

@inproceedings{heidari2024lower,
  title     = {{Lower Confidence Bound for Preference Selection in Interactive Multi-Objective Optimization}},
  author    = {Heidari, Arash and Gonzalez, Sebastian Rojas and Dhaene, Tom and Couckuyt, Ivo},
  booktitle = {Genetic and Evolutionary Computation Conference Companion (GECCO Companion)},
  year      = {2024},
  pages     = {339--342},
  doi       = {10.1145/3638530.3654317},
  url       = {https://doi.org/10.1145/3638530.3654317}
}

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

Topic and keywords

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

  • lower confidence bound
  • acquisition functions
  • Bayesian optimization
  • preference elicitation
  • decision maker preferences
  • Pareto front
  • Pareto optimal solutions

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?

Heidari, A., Gonzalez, S. R., Dhaene, T., & Couckuyt, I. (2024). Lower Confidence Bound for Preference Selection in Interactive Multi-Objective Optimization. Genetic and Evolutionary Computation Conference Companion (GECCO Companion), 339–342. https://doi.org/10.1145/3638530.3654317

How many times has this paper been cited?

5 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 Ghent University Academic Bibliography (Ghent University): sign in and open the PDF from this page.

Who wrote this paper?

Arash Heidari, Sebastian Rojas Gonzalez, Tom Dhaene, Ivo Couckuyt.

What is the DOI of this paper?

10.1145/3638530.3654317, permanently at https://doi.org/10.1145/3638530.3654317. 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.