Independent Reading · 2023
PyXAB: A Python Library for X-Armed Bandit and Online Blackbox Optimization Algorithms
Wenjie Li, Haoze Li, Jean Honorio, and Qifan Song · arXiv preprint
X-Armed BanditsBlack-Box OptimizationResearch Software
Full text
Read the Paper
Use View PDF or Download PDF to read the full paper on this device.
Paper Information
- Authors
- Wenjie Li, Haoze Li, Jean Honorio, and Qifan Song
- Venue
- arXiv preprint · 2023
Summary
This paper presents PyXAB, an open-source Python library for X-armed bandit and online black-box optimization algorithms.
Core Idea
A common implementation and evaluation interface makes hierarchical bandit algorithms easier to compare, reproduce, and apply.
Method
The library implements more than ten algorithms, multiple hierarchical partitions, synthetic objectives, documentation, and experiment utilities.
Key Takeaways
- PyXAB unifies algorithms that previously appeared in separate languages and packages.
- Partition design is a central practical choice in X-armed optimization.
- The package supports both cumulative-regret and simple-regret methods.
Questions
- Which partition strategies work best for different objective geometries?
- How can the library support reproducible comparison on real applications?