Sciweavers

3694 search results - page 330 / 739
» Stochastic complexity in learning
Sort
View
EUROCAST
2007
Springer
182views Hardware» more  EUROCAST 2007»
16 years 25 days ago
A k-NN Based Perception Scheme for Reinforcement Learning
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
José Antonio Martin H., Javier de Lope Asia...
AGENTS
1999
Springer
15 years 11 months ago
Team-Partitioned, Opaque-Transition Reinforcement Learning
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the concept of usin...
Peter Stone, Manuela M. Veloso
ALT
2003
Springer
15 years 10 months ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
200
Voted
JMLR
2008
151views more  JMLR 2008»
15 years 6 months ago
Learning to Combine Motor Primitives Via Greedy Additive Regression
The computational complexities arising in motor control can be ameliorated through the use of a library of motor synergies. We present a new model, referred to as the Greedy Addit...
Manu Chhabra, Robert A. Jacobs
ECCV
2010
Springer
15 years 12 months ago
Maximum Margin Distance Learning for Dynamic Texture Recognition
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...