Neural Information Processing Systems http://nips.cc/

We thank the reviewers for their insightful feedback. We address reviewer comments below and begin by situating the paper's intended contribution: Why is this our goal? POMDP planners incur the complexity of full, closed-loop planning only when necessary. V oI is "contrary to the core concept of POMDPs", V oI macro-actions expand the set of problems that can be efficiently What is not our goal? The primary critique of reviewers is the limited scope of our experimental results.

We thank the reviewers for acknowledging our contributions and for providing valuable feedback. The NVIDIA Titan X (Pascal) is rated at 11.0 TFLOPS, so the latency of The critic architecture also follows the WGAN-GP paper. We clarified the concatenation process in our paper and have added the missing hidden-layer citation. Thank you for pointing this out. The GWIN continues to have a positive impact.

The field of machine programming (MP), the automation of the development of software, is making notable research advances.

Neural Information Processing Systems http://nips.cc/

This paper presents an approach to multilabel classification (MLC) with a large number of labels. Our approach is a reduction to binary classification in which label sets are represented by low dimensional binary vectors. This representation follows the principle of Bloom filters, a space-efficient data structure originally designed for approximate membership testing. We show that a naive application of Bloom filters in MLC is not robust to individual binary classifiers' errors. We then present an approach that exploits a specific feature of real-world datasets when the number of labels is large: many labels (almost) never appear together. Our approach is provably robust, has sublinear training and inference complexity with respect to the number of labels, and compares favorably to state-of-the-art algorithms on two large scale multilabel datasets.

Neural Information Processing Systems http://nips.cc/

"NIPS Neural Information Processing Systems 8-11th December 2014, Montreal, Canada",,, "Paper ID:","1807" "Title:","Zero-shot recognition with unreliable attributes" Current Reviews First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The paper strives to bridge the gap between the theory and practice of attribute-based zero-shot learning. The theory is that novel classes can be recognized automatically using pre-trained attribute predictors; in practice, however, learning these attribute classifiers can be as difficult or even more so than learning the object classes themselves. Random forests are trained to predict unseen classes from attribute vectors, and the training procedure takes into account the reliability of the attribute detectors by propagating a validation set through each decision tree at training time. The authors show how the method can be extended to handle training with a few training examples of test categories.