65 search results - page 9 / 13 » Gradient Descent for General Reinforcement Learning |
SIGMOD
2012
ACM
13 years 6 days ago
2012
ACM
The success of data-driven solutions to difficult problems, along with the dropping costs of storing and processing massive amounts of data, has led to growing interest in largesc...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
108
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
108
click to vote
SDM
2011
SIAM
14 years 17 days ago
2011
SIAM
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We consider the problem of how to improve the efficiency of Multiple Kernel Learning (MKL). In literature, MKL is often solved by an alternating approach: (1) the minimization of ...