Showing cs.LGShow all
3 papers · 1 filter
cs.LG2025
Algorithm Design and Stronger Guarantees for the Improving Multi-Armed Bandits Problem
Avrim Blum, Marten Garicano, Kavya Ravichandran +1
The improving multi-armed bandits problem is a formal model for allocating effort under uncertainty, motivated by scenarios such as investing research effort into new technologies,…
cs.LG2024
A Model for Combinatorial Dictionary Learning and Inference
Avrim Blum, Kavya Ravichandran
We are often interested in decomposing complex, structured data into simple components that explain the data. The linear version of this problem is well-studied as dictionary learn…
cs.LG2024
Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
Avrim Blum, Kavya Ravichandran
We give nearly-tight upper and lower bounds for the improving multi-armed bandits problem. An instance of this problem has arms, each of whose reward function is a concave and…