Combinatorial Blocking Bandits with Stochastic Delays
Authors: Alexia Atsidakou, Orestis Papadigenopoulos, Soumya Basu, Constantine Caramanis, Sanjay Shakkottai
ICML 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We evaluate our results on synthetic experiments, where the feasible set is defined by knapsack and matching constraints. We compare the performance of our greedy heuristic for deterministic and stochastic delays of the same mean. In both experimental settings we used k = 50 arms, exact oracles for the underlying feasibility problem ( = β = 1) and averaged the results over 50 trials. The empirical ratio in both settings is computed against an LP relaxation (see appendix D for a detailed description of the experimental settings). In the case of stochastic delays, the empirical ratio is slightly worse but regret is smaller (Fig. 1). |
| Researcher Affiliation | Collaboration | 1Department of Electrical and Computer Engineering, The University of Texas at Austin, USA 2Department of Computer Science, The University of Texas at Austin, USA 3Google, Mountain View, USA. |
| Pseudocode | Yes | Algorithm 1 CBBSD-UCB |
| Open Source Code | No | The paper does not provide an explicit statement or link for open-source code availability. |
| Open Datasets | No | The paper states 'We evaluate our results on synthetic experiments' and refers to 'knapsack and matching constraints' but does not provide details or links to any publicly available dataset. |
| Dataset Splits | No | The paper does not explicitly provide details about training, validation, or test dataset splits. It mentions 'synthetic experiments' and parameters like 'k = 50 arms' and 'averaged the results over 50 trials' but no split percentages or counts. |
| Hardware Specification | No | The paper mentions 'synthetic experiments' but does not provide any specific hardware details such as GPU or CPU models, or computational resources used for running the experiments. |
| Software Dependencies | No | The paper does not provide specific software dependencies with version numbers. |
| Experiment Setup | Yes | We evaluate our results on synthetic experiments, where the feasible set is defined by knapsack and matching constraints. We compare the performance of our greedy heuristic for deterministic and stochastic delays of the same mean. In both experimental settings we used k = 50 arms, exact oracles for the underlying feasibility problem ( = β = 1) and averaged the results over 50 trials. The empirical ratio in both settings is computed against an LP relaxation (see appendix D for a detailed description of the experimental settings). |