Learning Monotone Term Decision Lists
نویسندگان
چکیده
We study the learnability of monotone term decision lists in the exact model of equivalence and membership queries. We show that, for any constant k 0, k-term monotone decision lists are exactly and properly learnable with n O(k) membership queries in O(n k 3) time. We also show n (k) membership queries are necessary for exact learning. In contrast, both k-term monotone decision lists (k 2) and general monotone decision lists are not learnable with equivalence queries alone.
منابع مشابه
Monotone term decision lists
We introduce a new representation class of Boolean functions|monotone term decision lists|which combines compact representation size with tractability of essential operations. We present many properties of the class which make it an attractive alternative to traditional universal representation classes such as DNF formulas or decision trees. We study the learnability of monotone term decision l...
متن کاملLearning from Partial Observations
We present a general machine learning framework for modelling the phenomenon of missing information in data. We propose a masking process model to capture the stochastic nature of information loss. Learning in this context is employed as a means to recover as much of the missing information as is recoverable. We extend the Probably Approximately Correct semantics to the case of learning from pa...
متن کاملLearnability of Some Eecient Representations of Boolean Functions
This thesis studies the learnability of several representation classes of Boolean functions: a restriction on k-term DNF, ordered binary decision diagrams and monotone term decision lists. We also show that some operations on these representation classes can be done in polynomial time. This fact is one of the motivations of the study (and use) of those classes.
متن کاملLearning Policies for Contextual Submodular Prediction - Supplementary Material
Lemma 2. Let S be a set, and f a monotone submodular function defined on lists of items in S. Let A,B be any lists of items from S. Denote Aj the list of the first j items in A, U(B) the uniform distribution on items in B and define j = Es∼U(B)[f(Aj−1 ⊕ s)] − f(Aj), the additive error term in competing with the average marginal benefits of the items in B when picking the j item in A (which coul...
متن کاملWord Type Effects on L2 Word Retrieval and Learning: Homonym versus Synonym Vocabulary Instruction
The purpose of this study was twofold: (a) to assess the retention of two word types (synonyms and homonyms) in the short term memory, and (b) to investigate the effect of these word types on word learning by asking learners to learn their Persian meanings. A total of 73 Iranian language learners studying English translation participated in the study. For the first purpose, 36 freshmen from an ...
متن کامل