Conference paper · 2023

Bayesian Optimization with Cost-varying Variable Subsets

Sebastian Shenghong Tay, Chuan-Sheng Foo, Daisuke Urano, Richalynn Leong, Bryan Kian Hsiang Low

neural information processing systems, 3008–3031 · Published 1 January 2023 · DOI 10.52202/075280-0134

View at the publisherCite this paper

In brief

“Bayesian Optimization with Cost-varying Variable Subsets” is a 2023 conference paper by Sebastian Shenghong Tay and 4 co-authors, published in neural information processing systems. OpenAlex counts 7 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
7
Most cited in
2026 (3)
Field-weighted impact
2.28
Authors
5

Cite this paper

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

APA 7

Tay, S. S., Foo, C.-S., Urano, D., Leong, R., & Low, B. K. H. (2023). Bayesian Optimization with Cost-varying Variable Subsets. neural information processing systems, 3008–3031. https://doi.org/10.52202/075280-0134

MLA 9

Tay, Sebastian Shenghong, et al. “Bayesian Optimization with Cost-varying Variable Subsets.” neural information processing systems, 2023, pp. 3008–3031. https://doi.org/10.52202/075280-0134.

Chicago

Tay, Sebastian Shenghong, Chuan-Sheng Foo, Daisuke Urano, Richalynn Leong, and Bryan Kian Hsiang Low. 2023. “Bayesian Optimization with Cost-varying Variable Subsets.” neural information processing systems: 3008–3031. https://doi.org/10.52202/075280-0134.

Harvard

Tay, S. S. et al. (2023) ‘Bayesian Optimization with Cost-varying Variable Subsets’, neural information processing systems, pp. 3008–3031. doi:10.52202/075280-0134.

IEEE

S. S. Tay, C.-S. Foo, D. Urano, R. Leong, and B. K. H. Low, “Bayesian Optimization with Cost-varying Variable Subsets,” neural information processing systems, pp. 3008–3031, 2023, doi: 10.52202/075280-0134.

BibTeX

@inproceedings{tay2023bayesian,
  title     = {{Bayesian Optimization with Cost-varying Variable Subsets}},
  author    = {Tay, Sebastian Shenghong and Foo, Chuan-Sheng and Urano, Daisuke and Leong, Richalynn and Low, Bryan Kian Hsiang},
  booktitle = {neural information processing systems},
  year      = {2023},
  pages     = {3008--3031},
  doi       = {10.52202/075280-0134},
  url       = {https://doi.org/10.52202/075280-0134}
}

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

Citations by year

YearCitationsShare of the best year
202311
202411
202522
202633

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

Topic and keywords

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

  • Bayesian optimization
  • feature selection
  • cost-aware optimization
  • surrogate models

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?

Tay, S. S., Foo, C.-S., Urano, D., Leong, R., & Low, B. K. H. (2023). Bayesian Optimization with Cost-varying Variable Subsets. neural information processing systems, 3008–3031. https://doi.org/10.52202/075280-0134

How many times has this paper been cited?

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

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Sebastian Shenghong Tay, Chuan-Sheng Foo, Daisuke Urano, Richalynn Leong, Bryan Kian Hsiang Low.

What is the DOI of this paper?

10.52202/075280-0134, permanently at https://doi.org/10.52202/075280-0134. 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.