In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.
--------
Question: We envision a machine learning service provider facing a continuous stream of problems with the same input domain, but with output domains that may differ. Clients present the provider with problems implicitly, by labeling a few example inputs, and then ask the provider to train models which reasonably extend their labelings to novel inputs. The provider wants to avoid constraining its users to a set of common labels, so it does not assume any particular correspondence between labels for a new task and labels for previously encountered tasks. To perform well in this setting, the provider needs a representation of the input domain which, in expectation, permits effective models for new problems to be learned efficiently from a small number of examples. While this bears a resemblance to settings considered in previous work on multitask and lifelong learning, our non-assumption of inter-task label correspondence leads to a novel algorithm: Lifelong Learner of Discriminative Representations (LLDR), which explicitly minimizes a proxy for the intra-task small-sample generalization error. We examine the relative benefits of our approach on a diverse set of real-world datasets in three significant scenarios: representation learning, multitask learning and lifelong learning.

Answer: Lifelong Learning of Discriminative Representations


Question: Unsupervised classification algorithm based on clonal selection principle named Unsupervised Clonal Selection Classification (UCSC) is proposed in this paper. The new proposed algorithm is data driven and self-adaptive, it adjusts its parameters to the data to make the classification operation as fast as possible. The performance of UCSC is evaluated by comparing it with the well known K-means algorithm using several artificial and real-life data sets. The experiments show that the proposed UCSC algorithm is more reliable and has high classification precision comparing to traditional classification methods such as K-means. General Terms Pattern Recognition, Algorithms.

Answer: Unsupervised Classification Using Immune Algorithm


Question: In this work, we study an important problem: learning programs from input-output<lb>examples. We propose a novel method to learn a neural program operating a<lb>domain-specific non-differentiable machine, and demonstrate that this method<lb>can be applied to learn programs that are significantly more complex than the<lb>ones synthesized before: programming language parsers from input-output pairs<lb>without knowing the underlying grammar. The main challenge is to train the neural<lb>program without supervision on execution traces. To tackle it, we propose: (1)<lb>LL machines and neural programs operating them to effectively regularize the<lb>space of the learned programs; and (2) a two-phase reinforcement learning-based<lb>search technique to train the model. Our evaluation demonstrates that our approach<lb>can successfully learn to parse programs in both an imperative language and a<lb>functional language, and achieve 100% test accuracy, while existing approaches’<lb>accuracies are almost 0%. This is the first successful demonstration of applying<lb>reinforcement learning to train a neural program operating a non-differentiable<lb>machine that can fully generalize to test sets on a non-trivial task.

Answer:
Learning Neural Programs To Parse Programs