text stringlengths 0 1.96k |
|---|
"The domains considered for experimental evaluation are particularly simple" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
"It would be better to evaluate on one of the few common benchmarks for robot language understanding, e.g., the SAIL corpus, which considers trajectory-oriented instructions" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'ar... |
"The paper initially states that this distance function is computed from learned embeddings of human demonstrations, however these are presumably instructions rather than demonstrations" "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'arg'... |
"Relevant to the discussion of learning from demonstration for language understanding is the following paper by Duvallet et al. Duvalet, Kollar, and Stentz, ""Imitation learning for natural language direction following through unknown environments,"" ICRA 2014 - The paper is overly verbose and redundant in places" "['n... |
"Summary Authors present a decentralized policy, centralized value function approach (MAAC) to multi-agent learning." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality" |
"Authors compare their approach with COMA (discrete actions and counterfactual (semi-centralized) baseline) and MADDPG (also uses centralized value function and continuous actions) MAAC is evaluated on two 2d cooperative environments, Treasure Collection and Rover Tower." "['non', 'non', 'non', 'non', 'non', 'non', 'no... |
"Pro - MAAC is a simple combination of attention and a centralized value function approach" "['non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
"The proposed method is evaluated on object classification and object alignment tasks." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality" |
"It would be better to provide discussions of recent neural architecture search methods solving the single-objective problem ." "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'non']" "paper quality" |
"In this way, there's no need to store all past data and even the first learned batch keeps being refreshed and should not be forgotten." "['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'... |
"This is not true in a beta-VAE" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
"A Weibull distribution is used to model the same data, again, in a different way." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality" |
"3) Experiments Finally, the experimental results do not look very compelling , it seems to be overall worse than the baselines in the two image datasets and slightly better in the audio dataset, so it's unclear that this approach is superior" "['non', 'non', 'non', 'non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg... |
"They construct a pair of synthetic but somewhat realistic datasetsin one case, the Bayes-optimal classifier is *not* robust, demonstrating that the Bayes-optimal classifier may not be robust for real-world datasets." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'n... |
"In the other case, the Bayes-optimal classifier is robust, but neural networks fail to learn the robust decision boundary." "['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 contribution of the two datasets (the symmetric and asymetric CelebA) is, in my opinion, an extremely important contribution in studying adversarial robustness and on their own these datasets warrant further study" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', ... |
"A Discussion of Adversarial Examples are not Bugs they are Features (pseudo-url): Nakkiran (2019) actually constructs a dataset (called adversarial squares) where the Bayes-optimal classifier is robust but neural networks learn a non-robust classifier due to label noise and overfitting." "['non', 'non', 'non', 'non', ... |
"Adversarially robust generalization requires more data (pseudo-url): Schmidt et al show a setup where many more samples are required for adversarial robustness than for standard classification error." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non... |
"Discussion/interpretation of the results: - Sufficient vs necessary: While the experimental design and results are both of very high quality , I am slightly confused about the interpretation of the results" "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'arg', 'arg', 'arg'... |
"CNN vs Linear SVM: I am confused about why we would expect a CNN to be able to learn the Bayes-optimal decision boundary but not the Linear SVM" "['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... |
"This concern does not make the contribution of the symmetric dataset less valuable , but a discussion of such caveats would help further elucidate the similarities and differences of this setup from real datasets" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'non', 'arg'... |
"In particular, with such low-variance directions, at standard dataset sizes the distributions generated here are most likely statistically indistinguishable from their robust/non-robust counterparts (you can see hints of this in the fact that the CNN gets ." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'n... |
"Overall, this paper is a very promising step in studying adversarial robustness , but concerns about discussion of prior work, discussion of experimental setup, and conclusions drawn, currently bar me from recommending acceptance" "['non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'a... |
"The paper introduces CATER: a synthetically generated dataset for video understanding tasks." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality" |
"The compositional action classification task is harder and shows that incorporating LSTMs for temporal reasoning leads to non-trivial performance improvements over frame averaging." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'n... |
"It is a well-argued, thoughtful dataset contribution that sets up a reasonable video understanding dataset" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
"And it combines A* search with MCTS to improve the performance over the traditional MCTS approaches based on UCT or PUCT tree policies" "['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 quali... |
"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', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
"It is not clear whether such assumptions hold for practical problems" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
"More convincing experimental comparison should be done under real environment such as Atari games (by using the simulator as the environment model as shown in [Guo et al 2014] Deep learning for real-time atari game play using offline monte-carlo tree search planning)." "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg'... |
"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)." "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg',... |
"b) In the related work section, very little is said about Bin Packing Problems" "['non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
"Moreover, BPPs have been extensively studied in theoretical computer science, with various approximation results." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality" |
"Note that the 2D Knapsack problem with rotations admits a 3/2 + \epsilon - approximation algorithm (Galvez et. al., FOCS 2017)." "['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']... |
"A. Khan has also found approximation algorithms for the 3D Knapsack problem with rotations." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality" |
"So, even if those results do not preclude the use of sophisticated DRL techniques for solving geometric knapsack problems, it would be legitimate to empirically compare these techniques with the polytime asymptotic approximation algorithms already found in the literature." "['non', 'non', 'non', 'non', 'non', 'non', '... |
"We dont know if it is an episodic MDP (which is usually the case in DRL approaches to combinatorial optimization tasks)." "['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" |
"For example, in Eq (1) what are the dimensions K and V" "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
"Etc. (f) Even if the aforementioned issues are fixed, it seems that the framework is using many hyper-parameters (\gamma, \beta, \alpha_t, etc.) which are left unspecified" "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg... |
"Under such circumstances, it is quite impossible to reproduce experiments ." "['non', 'non', 'non', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'non']" "paper quality" |
"The structure of the paper is strange because it discusses attribution priors but then they are not used for the method" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
"I think a few papers to have a look at are a survey article about graph based biasing pseudo-url as well as methods for using graph convolutions with biases based on graphs: pseudo-url and pseudo-url ." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'n... |
"Is it just smoothing ?" "['arg', 'arg', 'arg', 'arg', 'non']" "paper quality" |
"A `termination' menas that an agent should stop executing the previous selected action; the leader signals as such to the agent." "['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 qual... |
"This paper presents a black-box style learning algorithm for Markov Random Fields (MRF)." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non']" "paper quality" |
"The approach doubles down on the variational approach with variational approximations for both the positive phase and negative phase of the log likelihood objective function." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', '... |
"As others have found in the past, a variational approximation to the partition function contribution to the loss function (i.e. the negative phase) results in the loss of the variational lower bound on log likelihood and the connection between the resulting approximation and the log likelihood becomes unclear." "['non... |
"To deal with this issue, the authors argue (in Lemma 1) that the gradient of their approximate objective is at least in the same direction as the ELBO (lower bound) objective." "['non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', 'non', ... |
"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" "['arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'ar... |
"While I agree with the statement as such , the GAN development makes a stronger statement about the nature of the learning trajectory" "['non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'non', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg', 'arg']" "paper quality" |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.