Exploration-Exploitation Tradeoff

Overview

The field studies how a learner can discover which actions, options, or regions are valuable while still making use of what it has learned, in settings such as bandits, reinforcement learning, recommendation, and robotics. Common approaches include upper confidence bounds and Thompson sampling, randomized perturbations, Bayesian acquisition rules, and structured strategies such as explore-then-commit or coverage-driven planning. Regret guarantees are well developed for many bandit settings, but real tasks often add contextual information, partial feedback, changing environments, or limited trials. A central tension is that strategies that maximize immediate reward may gather too little information, while exploration that improves coverage or final decisions can cost short-term reward and may need to account for uncertainty, safety, and user or task differences.

Latest papers

CardsList

62 papers2 papers in the last four weeks, down 82% on the four weeks before. 0.0% of all new papers.

  1. Self-Concordant Perturbations for Linear Bandits

    Oct 28, 2025Lucas Lévy, Jean-Lou Valeau, Arya Akhavan +1Multi-Armed BanditsFollow-the-Perturbed-Leader

  2. Linear Bandits on Ellipsoids: Minimax Optimal Algorithms

    Feb 24, 2025Raymond Zhang, Hedi Hadiji, Richard CombesMulti-Armed BanditsMinimax Regret