Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
Renato Paes Leme, Chara Podimata, Jon Schneider
We study the problem of contextual search, a generalization of binary search in higher dimensions, in the adversarial noise model. Let be the dimension of the problem, be t…
cs.LG2024
Online Learning with Bounded Recall
Jon Schneider, Kiran Vodrahalli
We study the problem of full-information online learning in the "bounded recall" setting popular in the study of repeated games. An online learning algorithm is -$…