1176 search results - page 11 / 236 » Sparse reward processes |
102
click to vote
ICIP
2009
IEEE
16 years 23 days ago
2009
IEEE
We explore sparse regression for effective feature selection and classification in face identity and expression recognition. We argue that sparse regression in pixel space is inap...
108
click to vote
ICASSP
2007
IEEE
15 years 6 months ago
2007
IEEE
Sparse coding is a new field in signal processing with possible applications to source coding. In this paper we present a new method that combines the problems of sparse signal a...
ECML
2005
Springer
15 years 5 months ago
2005
Springer
This paper examines the problem of finding an optimal policy for a Partially Observable Markov Decision Process (POMDP) when the model is not known or is only poorly specified. W...
101
click to vote
JMLR
2010
14 years 6 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— We consider decision-making problems in Markov decision processes where both the rewards and the transition probabilities vary in an arbitrary (e.g., nonstationary) fashion. We...