Conference paper · 2024 · Open access

Preference-Aware Constrained Multi-Objective Bayesian Optimization

Alaleh Ahmadianshalchi, Syrine Belakaria, Janardhan Rao Doppa

Joint International Conference on Data Science & Management of Data (CODS-COMAD), 182–191 · Published 3 January 2024 · DOI 10.1145/3632410.3632427

Open PDFView at the publisherCite this paper

In brief

“Preference-Aware Constrained Multi-Objective Bayesian Optimization” is a 2024 conference paper by Alaleh Ahmadianshalchi and 2 co-authors, published in Joint International Conference on Data Science & Management of Data (CODS-COMAD). OpenAlex counts 17 citations as of 19 November 2026, which puts it in the top 4% of works published in 2024 by citations. It is open access under a CC BY licence: the full text is free to read at Joint International Conference on Data Science & Management of Data (CODS-COMAD).

Citations
17
Most cited in
2025 (8)
Field-weighted impact
4.10
References
73
Authors
3

Abstract

This paper addresses the problem of constrained multi-objective optimization over black-box objective functions with practitioner-specified preferences over the objectives when a large fraction of the input space is infeasible (i.e., violates constraints). This problem arises in many engineering design problems, including analog circuits and electric power system design. We aim to approximate the optimal Pareto set over the small fraction of feasible input designs. The key challenges include the massive size of the design space, multiple objectives, a large number of constraints, and the small fraction of feasible input designs, which can be identified only after performing expensive experiments/simulations. We propose a novel and efficient preference-aware constrained multi-objective Bayesian optimization approach referred to as PAC-MOO to address these challenges. The key idea is to learn surrogate models for both output objectives and constraints, and select the candidate input for evaluation in each iteration that maximizes the information gained about the optimal constrained Pareto front while factoring in the preferences over objectives. Our experiments on synthetic and challenging real-world analog circuit design optimization problems demonstrate the efficacy of PAC-MOO over baseline methods.

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). Preference-Aware Constrained Multi-Objective Bayesian Optimization. Joint International Conference on Data Science & Management of Data (CODS-COMAD), 182–191. https://doi.org/10.1145/3632410.3632427

MLA 9

Ahmadianshalchi, Alaleh, et al. “Preference-Aware Constrained Multi-Objective Bayesian Optimization.” Joint International Conference on Data Science & Management of Data (CODS-COMAD), 2024, pp. 182–191. https://doi.org/10.1145/3632410.3632427.

Chicago

Ahmadianshalchi, Alaleh, Syrine Belakaria, and Janardhan Rao Doppa. 2024. “Preference-Aware Constrained Multi-Objective Bayesian Optimization.” Joint International Conference on Data Science & Management of Data (CODS-COMAD): 182–191. https://doi.org/10.1145/3632410.3632427.

Harvard

Ahmadianshalchi, A., Belakaria, S. and Doppa, J. R. (2024) ‘Preference-Aware Constrained Multi-Objective Bayesian Optimization’, Joint International Conference on Data Science & Management of Data (CODS-COMAD), pp. 182–191. doi:10.1145/3632410.3632427.

IEEE

A. Ahmadianshalchi, S. Belakaria, and J. R. Doppa, “Preference-Aware Constrained Multi-Objective Bayesian Optimization,” Joint International Conference on Data Science & Management of Data (CODS-COMAD), pp. 182–191, 2024, doi: 10.1145/3632410.3632427.

BibTeX

@inproceedings{ahmadianshalchi2024preference,
  title     = {{Preference-Aware Constrained Multi-Objective Bayesian Optimization}},
  author    = {Ahmadianshalchi, Alaleh and Belakaria, Syrine and Doppa, Janardhan Rao},
  booktitle = {Joint International Conference on Data Science \& Management of Data (CODS-COMAD)},
  year      = {2024},
  pages     = {182--191},
  doi       = {10.1145/3632410.3632427},
  url       = {https://doi.org/10.1145/3632410.3632427}
}

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

Citations by year

YearCitationsShare of the best year
202455
202588
202644

Its field-weighted citation impact is 4.10: it has been cited 4.10 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

  • Pareto front approximation
  • black-box optimization
  • surrogate models
  • analog circuit design

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). Preference-Aware Constrained Multi-Objective Bayesian Optimization. Joint International Conference on Data Science & Management of Data (CODS-COMAD), 182–191. https://doi.org/10.1145/3632410.3632427

How many times has this paper been cited?

17 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 Joint International Conference on Data Science & Management of Data (CODS-COMAD): 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.1145/3632410.3632427, permanently at https://doi.org/10.1145/3632410.3632427. 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.