Conference paper · 2020 · Open access
Multiobjective tree-structured parzen estimator for computationally expensive optimization problems
Genetic and Evolutionary Computation Conference (GECCO), 533–541 · Published 25 June 2020 · DOI 10.1145/3377930.3389817
In brief
“Multiobjective tree-structured parzen estimator for computationally expensive optimization problems” is a 2020 conference paper by Yoshihiko Ozaki and 3 co-authors, published in Genetic and Evolutionary Computation Conference (GECCO). OpenAlex counts 319 citations as of 19 November 2026, which puts it in the top 7% of works published in 2020 by citations. It is open access: the full text is free to read at Genetic and Evolutionary Computation Conference (GECCO).
- Citations
- 319
- Most cited in
- 2025 (82)
- Field-weighted impact
- 18.83
- References
- 32
- Authors
- 4
Abstract
Practitioners often encounter computationally expensive multiobjective optimization problems to be solved in a variety of real-world applications. On the purpose of challenging these problems, we propose a new surrogate-based multiobjective optimization algorithm that does not require a large evaluation budget. It is called Multiobjective Tree-structured Parzen Estimator (MOTPE) and is an extension of the tree-structured Parzen estimator widely used to solve expensive single-objective optimization problems. Our empirical evidences reveal that MOTPE can approximate Pareto fronts of many benchmark problems better than existing methods with a limited budget. In this paper, we discuss furthermore the influence of MOTPE configurations to understand its behavior.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Ozaki, Y., Tanigaki, Y., Watanabe, S., & Onishi, M. (2020). Multiobjective tree-structured parzen estimator for computationally expensive optimization problems. Genetic and Evolutionary Computation Conference (GECCO), 533–541. https://doi.org/10.1145/3377930.3389817
MLA 9
Ozaki, Yoshihiko, et al. “Multiobjective tree-structured parzen estimator for computationally expensive optimization problems.” Genetic and Evolutionary Computation Conference (GECCO), 2020, pp. 533–541. https://doi.org/10.1145/3377930.3389817.
Chicago
Ozaki, Yoshihiko, Yuki Tanigaki, Shuhei Watanabe, and Masaki Onishi. 2020. “Multiobjective tree-structured parzen estimator for computationally expensive optimization problems.” Genetic and Evolutionary Computation Conference (GECCO): 533–541. https://doi.org/10.1145/3377930.3389817.
Harvard
Ozaki, Y. et al. (2020) ‘Multiobjective tree-structured parzen estimator for computationally expensive optimization problems’, Genetic and Evolutionary Computation Conference (GECCO), pp. 533–541. doi:10.1145/3377930.3389817.
IEEE
Y. Ozaki, Y. Tanigaki, S. Watanabe, and M. Onishi, “Multiobjective tree-structured parzen estimator for computationally expensive optimization problems,” Genetic and Evolutionary Computation Conference (GECCO), pp. 533–541, 2020, doi: 10.1145/3377930.3389817.
BibTeX
@inproceedings{ozaki2020multiobjective,
title = {{Multiobjective tree-structured parzen estimator for computationally expensive optimization problems}},
author = {Ozaki, Yoshihiko and Tanigaki, Yuki and Watanabe, Shuhei and Onishi, Masaki},
booktitle = {Genetic and Evolutionary Computation Conference (GECCO)},
year = {2020},
pages = {533--541},
doi = {10.1145/3377930.3389817},
url = {https://doi.org/10.1145/3377930.3389817}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2020 | 2 | |
| 2021 | 9 | |
| 2022 | 29 | |
| 2023 | 60 | |
| 2024 | 63 | |
| 2025 | 82 | |
| 2026 | 74 |
Its field-weighted citation impact is 18.83: it has been cited 18.83 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
- tree-structured Parzen estimator
- surrogate-based optimization
- computationally expensive optimization
- multi-objective optimization
- Pareto front approximation
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Ozaki, Y., Tanigaki, Y., Watanabe, S., & Onishi, M. (2020). Multiobjective tree-structured parzen estimator for computationally expensive optimization problems. Genetic and Evolutionary Computation Conference (GECCO), 533–541. https://doi.org/10.1145/3377930.3389817
How many times has this paper been cited?
319 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 Genetic and Evolutionary Computation Conference (GECCO): sign in and open the PDF from this page.
Who wrote this paper?
Yoshihiko Ozaki, Yuki Tanigaki, Shuhei Watanabe, Masaki Onishi.
What is the DOI of this paper?
10.1145/3377930.3389817, permanently at https://doi.org/10.1145/3377930.3389817. 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.