Sciweavers

129 search results - page 3 / 26
» Learning DFA from Simple Examples
Sort
View
MLG
2007
Springer
14 years 1 months ago
A Universal Kernel for Learning Regular Languages
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Leonid Kontorovich
JMLR
2010
136views more  JMLR 2010»
13 years 2 months ago
Reducing Label Complexity by Learning From Bags
We consider a supervised learning setting in which the main cost of learning is the number of training labels and one can obtain a single label for a bag of examples, indicating o...
Sivan Sabato, Nathan Srebro, Naftali Tishby
ICML
2010
IEEE
13 years 5 months ago
Approximate Predictive Representations of Partially Observable Systems
We provide a novel view of learning an approximate model of a partially observable environment from data and present a simple implemenf the idea. The learned model abstracts away ...
Monica Dinculescu, Doina Precup
AAAI
1994
13 years 8 months ago
Inductive Learning For Abductive Diagnosis
A new inductive learning system, Lab Learning for ABduction, is presented which acquires abductive rules from a set of training examples. The goal is to nd a small knowledge base ...
Cynthia A. Thompson, Raymond J. Mooney
ECCV
2008
Springer
14 years 9 months ago
Training Hierarchical Feed-Forward Visual Recognition Models Using Transfer Learning from Pseudo-Tasks
Abstract. Building visual recognition models that adapt across different domains is a challenging task for computer vision. While feature-learning machines in the form of hierarchi...
Amr Ahmed, Kai Yu, Wei Xu, Yihong Gong, Eric P. Xi...