Sciweavers

1351 search results - page 96 / 271
» Learning from compressed observations
Sort
View
COLT
1995
Springer
15 years 1 months ago
Exactly Learning Automata with Small Cover Time
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
Dana Ron, Ronitt Rubinfeld
IJCAI
2007
14 years 11 months ago
Utile Distinctions for Relational Reinforcement Learning
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
William Dabney, Amy McGovern
IJCAI
1993
14 years 11 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
ICITA
2005
IEEE
15 years 3 months ago
Combining Diversity-Based Active Learning with Discriminant Analysis in Image Retrieval
Small-sample learning in image retrieval is a pertinent and interesting problem. Relevance feedback is an active area of research that seeks to find algorithms that are robust wi...
Charlie K. Dagli, ShyamSundar Rajaram, Thomas S. H...
PG
2003
IEEE
15 years 3 months ago
Neural Meshes: Statistical Learning Based on Normals
We present a method for the adaptive reconstruction of a surface directly from an unorganized point cloud. The algorithm is based on an incrementally expanding Neural Network and ...
Won-Ki Jeong, Ioannis P. Ivrissimtzis, Hans-Peter ...