Summary
The primary objective of the paper is to address the challenge of identifying a set of arms, consisting of at most $k$ arms, where each arm is either Pareto optimal or close to Pareto optimal. The paper explains the concept of Pareto optimality within the context of bandit problems. To tackle this problem, the paper presents the $\epsilon_1$-APE-$k$ (Adaptive Pareto Exploration) algorithm and establishes an upper bound on the sample complexity. Furthermore, empirical evidence is provided to demonstrate the effectiveness of the proposed algorithm.
Strengths
One strength of the paper is its focus on addressing the problem of Pareto optimality in bandit literature, which is an underexplored area. The paper introduces a novel problem setup and clearly defines the goals for different scenarios related to Pareto optimal identification, including the identification of Pareto optimal sets, near Pareto optimal sets, and at-most $k$ near Pareto optimal sets.
The paper excels in providing a comprehensive discussion on sample complexity upper bounds, highlighting the theoretical aspects of the problem. It also establishes connections to the existing literature on Pareto optimality in bandits, demonstrating a solid understanding of the research landscape.
Furthermore, the paper offers ample experimental evidence to support its claims, including experiments conducted on real-world datasets. This empirical validation strengthens the credibility of the proposed approaches and enhances the practical relevance of the research.
Weaknesses
One weakness of the paper is the absence of references to real-world applications that could benefit from the proposed framework. For instance, discussing potential applications such as A/B testing in clinical trials would enhance the practical relevance and broader impact of the research.
Another weakness is the lack of discussion of lower bounds in the main paper. Given that the problem setup for Pareto set identification is relatively new, it would be valuable to explore more properties of the lower bounds to gain insights into the tightness of the derived upper bounds. This would provide a more comprehensive understanding of the problem and its inherent complexities.
The paper lacks a thorough discussion on the computational complexity of the $\epsilon_1$-APE-$k$ algorithm. Considering the importance of computational efficiency in practical applications, it would be beneficial to address
Questions
One potential weakness is the lack of information regarding scalability issues encountered when running large-scale experiments using the $\epsilon_1$-APE-$k$ algorithm. It would be valuable to understand whether the algorithm faces any challenges in handling larger datasets or more complex scenarios. Additionally, providing references on the scale of parameters used in A/B testing for applications beyond COVID datasets would further strengthen the practicality of the proposed approach.
Another point to consider is the limited discussion on the broader scope of utilizing Pareto sets in various applications apart from clinical trials. Exploring and discussing other potential domains where Pareto sets could be beneficial would enhance the paper's impact and shed light on additional practical applications.
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.
Limitations
No limitations or potential impact of their work discussed