- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper studies a setting between a defender and an attacker. The defender seeks to maximize their total reward but does not apriori know the underlying (zero-sum) game, while the attacker knows the true game and best-responds to the defender's strategies. In this paper, the objective of the defender is to learn a maximin policy without necessarily having to identify the true underlying game. The main results give a characterization of when this is possible, and an adaptive algorotihm for learning such a maximin policy.
Critical strengths
At a high-level, I believe the setting and motivation for learning a maximin strategy even without necessarily identifying the underlying game is interesting.
Critical weaknesses
Ultimately, I found this paper incredibly difficult to read and parse. In particular, I believe the manuscript falls short in explaining the setting, the main results, their interpretation, and their signifcance.
For example, the first two paragraphs of section 3 ("Game family and objective", and "Diagnostic queries and strategic feedback") are difficult to follow and, in my reading, don't adequately introduce the problem setting in a clear, understandable way. Many terms are stated without any explanation or intuition, e.g., "robust radius", "A_\theta", "Tier I" and "Tier II", and even a precise definition of "transcript law".
The organization of Sections 4 and 5 were also hard to follow and make the main contributions very difficult to understand and also verify.
Questions for authors
My primary suggestion in a future revision is to substantially rewrite sections 3 and 4 in order to make the problem setting and contributions more clear and understandable.
2 comments
Thanks to the authors for their responses. I will maintain my score and encourage the authors to continue to revise the exposition in a future version.
Thank you again for your detailed comments on the presentation, which guided our revision. As you suggested, we substantially rewrote Sections 3 and 4 and revised Section 5 accordingly. Section 3 now introduces the diagnostic protocol and a two-game running example before the general notation, and defines the robust radius, Aθ and the transcript law explicitly. Section 4 opens with a roadmap, gives each theorem an informal statement and a proof sketch, and restates Theorem 4.4 in three parts (validity, characterization and an algorithm), while Section 5 now explains Tier I and Tier II where they are used. The experiments in Section 6 show why certifying a policy without identifying the model matters: on the same runs, identification requires up to 19.2 times as many episodes as certification. We would appreciate your view on whether the revised Sections 3 and 4 now present the setting and contributions clearly.