Sciweavers

3643 search results - page 405 / 729
» Learning Submodular Functions
Sort
View
EWRL
2008
15 years 8 months ago
Markov Decision Processes with Arbitrary Reward Processes
Abstract. We consider a control problem where the decision maker interacts with a standard Markov decision process with the exception that the reward functions vary arbitrarily ove...
Jia Yuan Yu, Shie Mannor, Nahum Shimkin
ICONIP
2007
15 years 8 months ago
Natural Conjugate Gradient in Variational Inference
Variational methods for approximate inference in machine learning often adapt a parametric probability distribution to optimize a given objective function. This view is especially ...
Antti Honkela, Matti Tornio, Tapani Raiko, Juha Ka...
ICML
2010
IEEE
15 years 7 months ago
Internal Rewards Mitigate Agent Boundedness
Abstract--Reinforcement learning (RL) research typically develops algorithms for helping an RL agent best achieve its goals-however they came to be defined--while ignoring the rela...
Jonathan Sorg, Satinder P. Singh, Richard Lewis
ICML
2010
IEEE
15 years 7 months ago
The Elastic Embedding Algorithm for Dimensionality Reduction
We propose a new dimensionality reduction method, the elastic embedding (EE), that optimises an intuitive, nonlinear objective function of the low-dimensional coordinates of the d...
Miguel Á. Carreira-Perpiñán
ICML
2010
IEEE
15 years 7 months ago
Label Ranking Methods based on the Plackett-Luce Model
This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the ...
Weiwei Cheng, Krzysztof Dembczynski, Eyke Hül...