Preprint · 2019 · Open access

Ordinal Bayesian Optimisation

Victor Picheny, Sattar Vakili, Artem Artemev

arXiv (Cornell University) · Published 5 December 2019 · DOI 10.48550/arxiv.1912.02493

Open PDFView at the publisherCite this paper

In brief

“Ordinal Bayesian Optimisation” is a 2019 preprint by Victor Picheny and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 14 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
14
Most cited in
2023 (4)
References
21
Authors
3

Abstract

Bayesian optimisation is a powerful tool to solve expensive black-box problems, but fails when the stationary assumption made on the objective function is strongly violated, which is the case in particular for ill-conditioned or discontinuous objectives. We tackle this problem by proposing a new Bayesian optimisation framework that only considers the ordering of variables, both in the input and output spaces, to fit a Gaussian process in a latent space. By doing so, our approach is agnostic to the original metrics on the original spaces. We propose two algorithms, respectively based on an optimistic strategy and on Thompson sampling. For the optimistic strategy we prove an optimal performance under the measure of regret in the latent space. We illustrate the capability of our framework on several challenging toy problems.

Cite this paper

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

APA 7

Picheny, V., Vakili, S., & Artemev, A. (2019). Ordinal Bayesian Optimisation. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1912.02493

MLA 9

Picheny, Victor, et al. “Ordinal Bayesian Optimisation.” arXiv (Cornell University), 2019. https://doi.org/10.48550/arxiv.1912.02493.

Chicago

Picheny, Victor, Sattar Vakili, and Artem Artemev. 2019. “Ordinal Bayesian Optimisation.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1912.02493.

Harvard

Picheny, V., Vakili, S. and Artemev, A. (2019) ‘Ordinal Bayesian Optimisation’, arXiv (Cornell University). doi:10.48550/arxiv.1912.02493.

IEEE

V. Picheny, S. Vakili, and A. Artemev, “Ordinal Bayesian Optimisation,” arXiv (Cornell University), 2019, doi: 10.48550/arxiv.1912.02493.

BibTeX

@misc{picheny2019ordinal,
  title     = {{Ordinal Bayesian Optimisation}},
  author    = {Picheny, Victor and Vakili, Sattar and Artemev, Artem},
  howpublished = {arXiv (Cornell University)},
  year      = {2019},
  doi       = {10.48550/arxiv.1912.02493},
  url       = {https://doi.org/10.48550/arxiv.1912.02493}
}

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

Citations by year

YearCitationsShare of the best year
202022
202111
202222
202344
202411
202511
202633

Topic and keywords

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

  • black-box optimization
  • Gaussian processes
  • latent space
  • variable ordering
  • Thompson sampling
  • regret bounds
  • expensive objective functions

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?

Picheny, V., Vakili, S., & Artemev, A. (2019). Ordinal Bayesian Optimisation. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1912.02493

How many times has this paper been cited?

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

Victor Picheny, Sattar Vakili, Artem Artemev.

What is the DOI of this paper?

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