mlsanityData to 7 Oct 2026

Exploration by Optimisation in Partial Monitoring

arXiv 1907.05772 ↗First posted 12 Jul 2019cs.LG math.OC stat.MLcited by 20

Not on the map. Why?

Abstract (arXiv)

We provide a simple and efficient algorithm for adversarial k-action d-outcome non-degenerate locally observable partial monitoring game for which the n-round minimax regret is bounded by 6(d+1) k3/2 √n log(k), matching the best known information-theoretic upper bound. The same algorithm also achieves near-optimal regret for full information, bandit and globally observable games.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Jul 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 4; 2023: 3; 2024: 5; 2025: 3; 2026: 1.

20 papers.

Sort:

  1. 2022On the Complexity of Adversarial Decision Makingcited by 32
  2. 2022Best-of-Both-Worlds Algorithms for Partial Monitoringcited by 19
  3. 2023Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worldscited by 15
  4. 2022Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini's Regretcited by 13
  5. 2021Scale Free Adversarial Multi Armed Banditscited by 12
  6. 2023Linear Partial Monitoring for Sequential Decision-Making: Algorithms, Regret Bounds and Applicationscited by 11
  7. 2024Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnabilitycited by 11
  8. 2021A Bit Better? Quantifying Information for Bandit Learningcited by 5
  9. 2022Gaussian Imagination in Bandit Learningcited by 5
  10. 2021Isotuning With Applications To Scale-Free Online Learningcited by 4
  11. 2024Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoringcited by 3
  12. 2024A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of Theta(T2/3) and its Application to Best-of-Both-Worldscited by 3
8 more
  1. 2025Decision Making in Hybrid Environments: A Model Aggregation Approachcited by 3
  2. 2024Randomized Confidence Bounds for Stochastic Partial Monitoringcited by 2
  3. 2024Regret Minimization via Saddle Point Optimizationcited by 2
  4. 2021Scale-Free Adversarial Multi-Armed Bandit with Arbitrary Feedback Delayscited by 1
  5. 2025Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoringcited by 1
  6. 2026The Sample Complexity of Multiclass and Sparse Contextual Banditscited by 1
  7. 2023On the Minimax Regret in Online Ranking with Top-k Feedbackcited by 0
  8. 2025Bayesian Optimization for General Reaction Conditionscited by 0