309 citations · 1.1k across the 60 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.LG2022★ 1 cited
Online Convex Optimization with Unbounded Memory
Raunak Kumar, Sarah Dean, Robert Kleinberg
Online convex optimization (OCO) is a widely used framework in online learning. In each round, the learner chooses a decision in a convex set and an adversary chooses a convex loss…
cs.LG2022★ 2 cited
Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem
Raunak Kumar, Robert Kleinberg
Bandits with knapsacks (BwK) is an influential model of sequential decision-making under uncertainty that incorporates resource consumption constraints. In each round, the decision…
cs.DS2022
Individual Fairness in Prophet Inequalities
Makis Arsenis, Robert Kleinberg
Prophet inequalities are performance guarantees for online algorithms (a.k.a. stopping rules) solving the following "hiring problem": a decision maker sequentially inspects candida…