text
stringlengths 0
1.96k
|
---|
"However, it does not clearly explain the key insights of why it could perform better" "['non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"How could it improve over the traditional tree policy (e.g., UCT) for the selection step in MCTS" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"For example, in line 8 of Algorithm 2, why only the top 3 child nodes are added to the queue" "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"The complexity bound in Theorem 1 is hard to understand" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"It does not give the explicit relations of the sample complexity with respect to different quantities in the algorithms" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"In particular, the probability in the second term of Theorem 1 is hard to parse" "['non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"The authors give some concrete examples in Section 6.2 for these bounds" "['pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro']" "paper quality"
|
"However, it would be better to have some discussion earlier right after these theorems are presented" "['non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"The experimental results are carried out under the very simplified settings for both the proposed algorithm and the baseline MCTS" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"It is not clear whether such assumptions hold for practical problems" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"In practice, this is not true because even at the leaf node the value could still be estimated by an inaccurate value network (e.g., AlphaGo or AlphaZero)." "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'non', '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 ?" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"b) In the related work section, very little is said about Bin Packing Problems" "['non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"Again, a brief discussion about those results would be relevant" "['non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"d) The problem formulation is very unclear" "['non', 'non', 'con', 'con', 'con', 'con', 'con', 'con']" "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', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "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)." "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality"
|
"e) The Actor-Critic framework, coupled with a conditional query learning algorithm, is unfortunately unintelligible due to the fact that many notations are left unspecified" "['non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"For example, in Eq (1) what are the dimensions K and V" "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"In Eq (2) what is d_i" "['non', 'non', 'non', 'non', 'non', 'con', 'con', 'con']" "paper quality"
|
"In the algorithm what is n_{gae}" "['con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"Also in the algorithm, what are l_i, w_i and h_i" "['non', 'non', 'non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"The structure of the paper is strange because it discusses attribution priors but then they are not used for the method" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"The paper should have a single focus" "['con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"It is not clear which model is used in Figure 2" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "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" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "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', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"It is not clear if the paper is presenting ""expected gradients"" or existing attribution priors" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"Is it just smoothing ?" "['con', 'con', 'con', 'con', 'non']" "paper quality"
|
"For the negative phase, the authors use two separate variational approximations, one of which involves the modeling of the latent variable prior under the approximating distribution, The approach is novel , as far as I know, though not particularly so, and I view this as one of the weak point of the paper" "['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', 'pro', 'pro', 'pro', 'pro', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"That said, it does seems like a fairly creative combination of existing approaches" "['non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"The result is fairly obvious , but the conditions for validity have interesting consequences for the training algorithm, as it relates the approximation error to the norm of the gradient of the ELBO loss" "['con', 'con', 'con', 'con', 'con', 'non', 'non', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro']" "paper quality"
|
"I have a minor issue with the discussion (in the last paragraph of sec. 3.2) stating that the theoretical statement of the proposed objective relies on a much weaker assumption than the nonparametric assumption made in the theoretical justification of GANs" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"Clarity: I found the paper to be very well written with a clear exposition of the material and sound development of the technical details" "['non', 'non', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro']" "paper quality"
|
"What is unique about the MRF formalism that -- for practical applications -- could not be effectively captured in a directed graphical model" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"I note that I am aware of the theoretical representation differences between directed and undirected models, I am wondering how these differences actually matter in practical applications at scale" "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"Experiments: The authors show the empirical advantages offered by the proposed method over the existing literature" "['non', 'non', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro']" "paper quality"
|
"Its absence seems like a serious omission" "['con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"I am somewhat alarmed at the use of 100 updates of the joint model q(v,h) (K1 = 100) for every update of the other parameters" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"The comparison to PCD-1 in Fig. 3 seems a bit unfair in that the learning curve ends at 8000 iterations, while PCD-1 continues to improve NLL" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"I would like to see this curve extended until we start to see signs of overfitting" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"I would also like to see a comparison to CD-k, which often outperforms PCD-k" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"While I understand the stance taken by the authors that these methods leverage the tractability of the conditional distributions, these strategies are sufficiently general to be considered widely applicable and a true competitor for AdVIL" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"With respect to Deep Boltzmann Machine (DBM), I would prefer to see quantitative comparisons against published results" "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"Here again, MNIST would be a useful dataset" "['non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"It seems as though, in the application of AdVIL to the DBM, the authors are exploiting the structure of the model in how they define their sampling procedure" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"More detail for this application of AdVIL would be nice" "['con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"Also, I would like to see the test estimated NLL (via AIS) learning curves for VCD and AdVIL" "['non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
"Given the comparison to PCD in the RBM setting, I am somewhat surprised that AdVIL is so competitive with VCD in the case of the DBM ." "['pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'non']" "paper quality"
|
"Strenghts: + the paper proposes a reasonable way to try to improve accuracy by identifying hard-negative examples + the paper is well written , but it would benefit from another round of proofreading for grammar and clarity Weaknesses: - performance of the proposed method highly depends on labels of hard-negative examples" "['non', 'non', 'non', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'pro', 'non', 'pro', 'pro', 'pro', 'pro', 'pro', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'non', 'non', 'non', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con', 'con']" "paper quality"
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.