← Back to papers

2025 ALT ALT 2025

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem

Authors

Avrim Blum , Kavya Ravichandran

Related papers

A Characterization of List Regression 2025

Sample Compression Scheme Reductions 2025

Non-stochastic Bandits With Evolving Observations 2025

Efficient Optimal PAC Learning 2025

Do PAC-Learners Learn the Marginal Distribution? 2025