4 papers
Surviving Eratosthenes sieve I: quadratic density and Legendre's conjecture
Fred B. Holt
We have been studying Eratosthenes sieve as a discrete dynamic system, obtaining exact models for the relative populations for small gaps (currently gaps ) in the cycle o…
Self-Directed Learning of Convex Labelings on Graphs
Georgy Sokolov, Maximilian Thiessen, Margarita Akhmejanova +2
We study the problem of classifying the nodes of a given graph in the self-directed learning setup. This learning setting is a variant of online learning, where rather than an adve…
Bandits with Abstention under Expert Advice
Stephen Pasteris, Alberto Rumi, Maximilian Thiessen +4
We study the classic problem of prediction with expert advice under bandit feedback. Our model assumes that one action, corresponding to the learner's abstention from play, has no…
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
Yuko Kuroki, Alberto Rumi, Taira Tsuchiya +2
We study best-of-both-worlds algorithms for -armed linear contextual bandits. Our algorithms deliver near-optimal regret bounds in both the adversarial and stochastic regimes, w…