ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2202.10997
  4. Cited By
Minimax Regret for Partial Monitoring: Infinite Outcomes and
  Rustichini's Regret

Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini's Regret

22 February 2022
Tor Lattimore
ArXivPDFHTML

Papers citing "Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini's Regret"

12 / 12 papers shown
Title
Learning from Snapshots of Discrete and Continuous Data Streams
Learning from Snapshots of Discrete and Continuous Data Streams
Pramith Devulapalli
Steve Hanneke
56
0
0
08 Dec 2024
Thompson Sampling in Partially Observable Contextual Bandits
Thompson Sampling in Partially Observable Contextual Bandits
Hongju Park
Mohamad Kazem Shirani Faradonbeh
31
2
0
15 Feb 2024
Stochastic contextual bandits with graph feedback: from independence
  number to MAS number
Stochastic contextual bandits with graph feedback: from independence number to MAS number
Yuxiao Wen
Yanjun Han
Zhengyuan Zhou
42
1
0
12 Feb 2024
Randomized Confidence Bounds for Stochastic Partial Monitoring
Randomized Confidence Bounds for Stochastic Partial Monitoring
M. Heuillet
Ola Ahmad
Audrey Durand
36
1
0
07 Feb 2024
On the Minimax Regret in Online Ranking with Top-k Feedback
On the Minimax Regret in Online Ranking with Top-k Feedback
Mingyuan Zhang
Ambuj Tewari
13
0
0
05 Sep 2023
The Role of Transparency in Repeated First-Price Auctions with Unknown
  Valuations
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
Nicolò Cesa-Bianchi
Tommaso Cesari
Roberto Colomboni
Federico Fusco
S. Leonardi
38
7
0
14 Jul 2023
Repeated Bilateral Trade Against a Smoothed Adversary
Repeated Bilateral Trade Against a Smoothed Adversary
Nicolò Cesa-Bianchi
Tommaso Cesari
Roberto Colomboni
Federico Fusco
S. Leonardi
36
16
0
21 Feb 2023
Statistical Complexity and Optimal Algorithms for Non-linear Ridge
  Bandits
Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
Nived Rajaraman
Yanjun Han
Jiantao Jiao
Kannan Ramchandran
27
1
0
12 Feb 2023
An Information-Theoretic Analysis of Nonstationary Bandit Learning
An Information-Theoretic Analysis of Nonstationary Bandit Learning
Seungki Min
Daniel Russo
31
6
0
09 Feb 2023
Tight Guarantees for Interactive Decision Making with the
  Decision-Estimation Coefficient
Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient
Dylan J. Foster
Noah Golowich
Yanjun Han
OffRL
28
29
0
19 Jan 2023
On the Complexity of Adversarial Decision Making
On the Complexity of Adversarial Decision Making
Dylan J. Foster
Alexander Rakhlin
Ayush Sekhari
Karthik Sridharan
AAML
31
28
0
27 Jun 2022
Worst-case Performance of Greedy Policies in Bandits with Imperfect
  Context Observations
Worst-case Performance of Greedy Policies in Bandits with Imperfect Context Observations
Hongju Park
Mohamad Kazem Shirani Faradonbeh
OffRL
29
2
0
10 Apr 2022
1