Conference paper · 2025 · Open access
Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks
neural information processing systems, 56097–56124 · Published 1 January 2025 · DOI 10.52202/085713-1680
In brief
“Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks” is a 2025 conference paper by Artun Saday and 2 co-authors, published in neural information processing systems. OpenAlex counts 4 citations as of 19 November 2026, which puts it in the top 8% of works published in 2025 by citations. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 4
- Most cited in
- 2025 (2)
- Field-weighted impact
- 3.75
- References
- 36
- Authors
- 3
Abstract
We address the problem of Gaussian Process (GP) optimization in the presence of unknown and potentially varying adversarial perturbations. Unlike traditional robust optimization approaches that focus on maximizing performance under worst-case scenarios, we consider a robust satisficing objective, where the goal is to consistently achieve a predefined performance threshold $τ$, even under adversarial conditions. We propose two novel algorithms based on distinct formulations of robust satisficing, and show that they are instances of a general robust satisficing framework. Further, each algorithm offers different guarantees depending on the nature of the adversary. Specifically, we derive two regret bounds: one that is sublinear over time, assuming certain conditions on the adversary and the satisficing threshold $τ$, and another that scales with the perturbation magnitude but requires no assumptions on the adversary. Through extensive experiments, we demonstrate that our approach outperforms the established robust optimization methods in achieving the satisficing objective, particularly when the ambiguity set of the robust optimization framework is inaccurately specified.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Saday, A., Yıldırım, Y. C., & Tekin, C. (2025). Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks. neural information processing systems, 56097–56124. https://doi.org/10.52202/085713-1680
MLA 9
Saday, Artun, et al. “Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks.” neural information processing systems, 2025, pp. 56097–56124. https://doi.org/10.52202/085713-1680.
Chicago
Saday, Artun, Yaşar Cahit Yıldırım, and Cem Tekin. 2025. “Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks.” neural information processing systems: 56097–56124. https://doi.org/10.52202/085713-1680.
Harvard
Saday, A., Yıldırım, Y. C. and Tekin, C. (2025) ‘Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks’, neural information processing systems, pp. 56097–56124. doi:10.52202/085713-1680.
IEEE
A. Saday, Y. C. Yıldırım, and C. Tekin, “Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks,” neural information processing systems, pp. 56097–56124, 2025, doi: 10.52202/085713-1680.
BibTeX
@inproceedings{saday2025robust,
title = {{Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks}},
author = {Saday, Artun and Yıldırım, Yaşar Cahit and Tekin, Cem},
booktitle = {neural information processing systems},
year = {2025},
pages = {56097--56124},
doi = {10.52202/085713-1680},
url = {https://doi.org/10.52202/085713-1680}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Gaussian process bandits
- adversarial attacks
- robust optimization
- regret bounds
- ambiguity set
- sublinear regret
- perturbation magnitude
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Saday, A., Yıldırım, Y. C., & Tekin, C. (2025). Robust Satisficing Gaussian Process Bandits Under Adversarial Attacks. neural information processing systems, 56097–56124. https://doi.org/10.52202/085713-1680
How many times has this paper been cited?
4 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?
Artun Saday, Yaşar Cahit Yıldırım, Cem Tekin.
What is the DOI of this paper?
10.52202/085713-1680, permanently at https://doi.org/10.52202/085713-1680. 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.