Contextual Conservative Interleaving Bandits
Authors: Kei Takemura
ICML 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Our numerical experiments on a real-world dataset demonstrate that GCW with the standard bandit algorithms efficiently improves performance while satisfying the performance constraints. |
| Researcher Affiliation | Industry | 1NEC Corporation, Tokyo, Japan. |
| Pseudocode | Yes | Algorithm 1 Greedy on confidence widths |
| Open Source Code | No | The paper does not contain an explicit statement about the release of source code or a link to a code repository. |
| Open Datasets | Yes | We use the Book-Crossing dataset (Ziegler et al., 2005), which consists of ratings expressed on a scale from 0 to 10 for books. |
| Dataset Splits | No | The paper does not provide specific dataset split information (exact percentages, sample counts, citations to predefined splits, or detailed splitting methodology) needed to reproduce the data partitioning. |
| Hardware Specification | No | The paper does not provide specific hardware details (exact GPU/CPU models, processor types with speeds, memory amounts, or detailed computer specifications) used for running its experiments. |
| Software Dependencies | No | The paper mentions various algorithms and their parameters (Table 2), but does not provide specific ancillary software details (e.g., library or solver names with version numbers like Python 3.8, CPLEX 12.4) needed to replicate the experiment. |
| Experiment Setup | Yes | In each setting, we set d = 20, T = 1000, k = 30, and n = 10. |