Paper · 2013 · Open access

A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization

Ali Jalali, Javad Azimi, Xiaoli Z. Fern, Ruofei Zhang

Lecture notes in computer science, 210–224 · Published 1 January 2013 · DOI 10.1007/978-3-642-40988-2_14

Open PDFView at the publisherCite this paper

In brief

“A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization” is a 2013 paper by Ali Jalali and 3 co-authors, published in Lecture notes in computer science. OpenAlex counts 16 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
16
Most cited in
2019 (4)
Field-weighted impact
1.10
References
23
Authors
4

Cite this paper

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

APA 7

Jalali, A., Azimi, J., Fern, X. Z., & Zhang, R. (2013). A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization. Lecture notes in computer science, 210–224. https://doi.org/10.1007/978-3-642-40988-2_14

MLA 9

Jalali, Ali, et al. “A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization.” Lecture notes in computer science, 2013, pp. 210–224. https://doi.org/10.1007/978-3-642-40988-2_14.

Chicago

Jalali, Ali, Javad Azimi, Xiaoli Z. Fern, and Ruofei Zhang. 2013. “A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization.” Lecture notes in computer science: 210–224. https://doi.org/10.1007/978-3-642-40988-2_14.

Harvard

Jalali, A. et al. (2013) ‘A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization’, Lecture notes in computer science, pp. 210–224. doi:10.1007/978-3-642-40988-2_14.

IEEE

A. Jalali, J. Azimi, X. Z. Fern, and R. Zhang, “A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization,” Lecture notes in computer science, pp. 210–224, 2013, doi: 10.1007/978-3-642-40988-2_14.

BibTeX

@article{jalali2013lipschitz,
  title     = {{A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization}},
  author    = {Jalali, Ali and Azimi, Javad and Fern, Xiaoli Z. and Zhang, Ruofei},
  journal   = {Lecture notes in computer science},
  year      = {2013},
  pages     = {210--224},
  doi       = {10.1007/978-3-642-40988-2_14},
  url       = {https://doi.org/10.1007/978-3-642-40988-2_14}
}

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

Citations by year

YearCitationsShare of the best year
201522
201711
201944
202011
202111
202311
202433
202522
202611

Its field-weighted citation impact is 1.10: it has been cited 1.10 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
  • Lipschitz functions
  • exploration-exploitation balance
  • exploratory phase
  • expensive function evaluations
  • search space reduction
  • sample selection

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?

Jalali, A., Azimi, J., Fern, X. Z., & Zhang, R. (2013). A Lipschitz Exploration-Exploitation Scheme for Bayesian Optimization. Lecture notes in computer science, 210–224. https://doi.org/10.1007/978-3-642-40988-2_14

How many times has this paper been cited?

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

Ali Jalali, Javad Azimi, Xiaoli Z. Fern, Ruofei Zhang.

What is the DOI of this paper?

10.1007/978-3-642-40988-2_14, permanently at https://doi.org/10.1007/978-3-642-40988-2_14. 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.