Conference paper · 2022

Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces

Leonard Papenmeier, Luigi Nardi, Matthias Poloczek

neural information processing systems, 11586–11601 · Published 1 January 2022 · DOI 10.52202/068431-0842

View at the publisherCite this paper

In brief

“Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces” is a 2022 conference paper by Leonard Papenmeier and 2 co-authors, published in neural information processing systems. OpenAlex counts 73 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
73
Most cited in
2026 (29)
Field-weighted impact
12.32
Authors
3

Cite this paper

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

APA 7

Papenmeier, L., Nardi, L., & Poloczek, M. (2022). Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces. neural information processing systems, 11586–11601. https://doi.org/10.52202/068431-0842

MLA 9

Papenmeier, Leonard, et al. “Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces.” neural information processing systems, 2022, pp. 11586–11601. https://doi.org/10.52202/068431-0842.

Chicago

Papenmeier, Leonard, Luigi Nardi, and Matthias Poloczek. 2022. “Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces.” neural information processing systems: 11586–11601. https://doi.org/10.52202/068431-0842.

Harvard

Papenmeier, L., Nardi, L. and Poloczek, M. (2022) ‘Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces’, neural information processing systems, pp. 11586–11601. doi:10.52202/068431-0842.

IEEE

L. Papenmeier, L. Nardi, and M. Poloczek, “Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces,” neural information processing systems, pp. 11586–11601, 2022, doi: 10.52202/068431-0842.

BibTeX

@inproceedings{papenmeier2022increasing,
  title     = {{Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces}},
  author    = {Papenmeier, Leonard and Nardi, Luigi and Poloczek, Matthias},
  booktitle = {neural information processing systems},
  year      = {2022},
  pages     = {11586--11601},
  doi       = {10.52202/068431-0842},
  url       = {https://doi.org/10.52202/068431-0842}
}

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

Citations by year

YearCitationsShare of the best year
201911
202399
20241414
20252020
20262929

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

  • nested subspaces
  • subspace search
  • hyperparameter optimization

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?

Papenmeier, L., Nardi, L., & Poloczek, M. (2022). Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces. neural information processing systems, 11586–11601. https://doi.org/10.52202/068431-0842

How many times has this paper been cited?

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

Leonard Papenmeier, Luigi Nardi, Matthias Poloczek.

What is the DOI of this paper?

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