text
stringlengths 0
1.96k
|
---|
"These discussions are critical to understand the merit of the proposed algorithms." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"In addition, more experimental analysis should also be presented to support why such a combination is the key contribution to the performance gain" "['non', 'non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"Many design choices for the algorithms are not clearly explained" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"The complexity bound in Theorem 1 is hard to understand" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"It does not give the explicit relations of the sample complexity with respect to different quantities in the algorithms" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"In particular, the probability in the second term of Theorem 1 is hard to parse" "['non', 'non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"The authors need to give more discussion and explanation about it" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"This is also the case for Theorems 2-4." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"The authors give some concrete examples in Section 6.2 for these bounds" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"However, it would be better to have some discussion earlier right after these theorems are presented" "['non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"The experimental results are carried out under the very simplified settings for both the proposed algorithm and the baseline MCTS" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"In fact, it is performed under the exact assumption where the theoretical analysis is done for the A*MCTS." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"This may bring some advantage for the proposed algorithm." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"Other comments: It is assumed that the noise of value and policy network is zero at the leaf node." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"How would this affect the results?" "['non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"In the first paragraph of Section 6.2, there is a typo : V*=V_{l*}=\eta should be V*-V_{l*}=\eta ?" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"This paper aims at solving geometric bin packing (2D or 3D) problems using a deep reinforcement learning framework." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"Namely, the framework is based on the actor-critic paradigm, and uses a conditional query learning model for performing composite actions (selections, rotations) in geometric bin packing." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"Experiments are performed on several instances of 2D-BPP and 3D-BPP, Overall, bin packing problems are challenging tasks for DRL, and I would encourage the authors to pursue this research topic." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"Unfortunately, I believe that the current manuscript is at a too early stage for being accepted at ICLR , due to the following reasons: (a) The paper is littered with spelling/grammar mistakes (just take the second sentence: With the developing -> development)." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"For the next versions of the manuscript, I would recommend using a spell/grammar checker." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"Again, a brief discussion about those results would be relevant" "['non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"Notably, several classes of geometric bin packing problems admit polynomial-time approximation algorithms (for extended surveys about this topic, see e.g. Arindam Khans Ph.D." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"thesis 2015; Christensen et. al. Computer Science Review 2017)." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"c) According to the problem formulation and the experiments, it seems that the authors are studying a restricted subclass of 2D/3D bin packing problems: there is only one bin, so (it seems that) the authors are dealing with geometric knapsack problems (with rotations)." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"d) The problem formulation is very unclear" "['non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"Namely, the state representation is ambiguous: pseudo-formula is obviously not a boolean variable, but a boolean vector (where each component is associated with an item)" "['non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"Nothing is said about actions and transitions and rewards (we have to read the AC framework in order to get a clue of these components)." "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"Also, it seems that the MDP is specified for a single instance of 3D-BPP." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"But this looks wrong since it should include the distribution of all instances of 3D-BPP." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"In the algorithm what is n_{gae}" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"Also in the algorithm, what are l_i, w_i and h_i" "['non', 'non', 'non', 'non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"The paper presents expected gradients which is a method which looks at a difference from a baseline defined by the training data." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"The paper should have a single focus" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"Attribution priors as you formalize it in section 2 (which seems like the core contribution of the paper) was introduced in 2017 pseudo-url where they use a mask on a saliency map to regularize the representation learned." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"Some of these should serve as baselines" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"It is also not clear from the literature if these models are really working so I think these results should be presented in a more detail" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"As I understand it, real improvements in predicting clinical variables has not been shown to be reproducible so this would be a significant claim of this paper" "['non', 'non', 'non', 'non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"It is not clear if the paper is presenting ""expected gradients"" or existing attribution priors" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"Most of the experiments revolve around existing attribution prior methods" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"So with that the paper positions itself not as a survey but as a method paper but lacks evidence that the method expected gradients performs better" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"I am also not clear on where the image attribution prior comes from for the image task" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"Where is this extra information" "['arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"The leader is modeled as a semi-MDP with event-based policy gradients and modules to model/predict followers' actions." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"The leader sends messages to followers, an ""event"" is a pair (timestep, message of leader to a follower)." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"With this modeling step, the authors formulate an event-based policy gradient, which considers models for which goal to send to followers and when." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"The authors compare this approach on 4 environments with M3RL, which also solves (extensions of) principal-agent problems." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"Decision (accept or reject) with one or two key reasons for this choice." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"Supporting arguments The approach seems sound and conceptually related to a multi-agent generalization of STRAW pseudo-url, where a planner predicts / commits to an action-plan for a single agent" "['non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality"
|
"Additional feedback with the aim to improve the paper." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.