Sciweavers

509 search results - page 73 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
141
Voted
ATAL
2008
Springer
15 years 4 months ago
Reinforcement learning for DEC-MDPs with changing action sets and partially ordered dependencies
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...
Thomas Gabel, Martin A. Riedmiller
128
Voted
NIPS
1998
15 years 3 months ago
Risk Sensitive Reinforcement Learning
In this paper, we consider Markov Decision Processes (MDPs) with error states. Error states are those states entering which is undesirable or dangerous. We define the risk with re...
Ralph Neuneier, Oliver Mihatsch
JMLR
2011
148views more  JMLR 2011»
14 years 9 months ago
Bayesian Generalized Kernel Mixed Models
We propose a fully Bayesian methodology for generalized kernel mixed models (GKMMs), which are extensions of generalized linear mixed models in the feature space induced by a repr...
Zhihua Zhang, Guang Dai, Michael I. Jordan
ML
2008
ACM
248views Machine Learning» more  ML 2008»
15 years 2 months ago
Feature selection via sensitivity analysis of SVM probabilistic outputs
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection method for the Support Vector Machine (SVM) l...
Kai Quan Shen, Chong Jin Ong, Xiao Ping Li, Einar ...
ICML
2004
IEEE
16 years 3 months ago
Utile distinction hidden Markov models
This paper addresses the problem of constructing good action selection policies for agents acting in partially observable environments, a class of problems generally known as Part...
Daan Wierstra, Marco Wiering