2 papers
cs.LG2026
Hierarchical Adversarial Bandits for Online Configuration Optimization
Gil Shabat, Chen Avin, Shie Mannor +3
Motivated by Online Configuration Optimization in large, dynamic parameter spaces, this work studies the nonstochastic multi-armed bandit (MAB) problem in metric action spaces with…
cs.DS2024
Sorting in One and Two Rounds using -Comparators
Ran Gelles, Zvi Lotker, Frederik Mallmann-Trenn
We examine sorting algorithms for elements whose basic operation is comparing elements simultaneously (a -comparator). We focus on algorithms that use only a single roun…