Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
arXiv:2206.07528v3 Announce Type: replace Abstract: We study the problem of contextual search, a generalization of binary search in higher dimensions, in the adversarial noise model. Let $d$ be the dimension of the problem, $T$ be the time horizon and $C$…
