3250 search results - page 156 / 650 » Parameterized Learning Complexity |
182
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
153
click to vote
NIPS
1992
15 years 7 months ago
1992
This paper describes the adaption and application of an algorithm called Feudal Reinforcement Learning to a complex gridworld navigation problem. The algorithm proved to be not ea...
184
click to vote
PAMI
2010
15 years 4 months ago
2010
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
215
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
173
click to vote
KCAP
2009
ACM
16 years 29 days ago
2009
ACM
As computational learning agents move into domains that incur real costs (e.g., autonomous driving or financial investment), it will be necessary to learn good policies without n...