Sciweavers

3007 search results - page 69 / 602
» Linear Functional Fixed-points
Sort
View
ICML
2010
IEEE
15 years 4 months ago
Toward Off-Policy Learning Control with Function Approximation
We present the first temporal-difference learning algorithm for off-policy control with unrestricted linear function approximation whose per-time-step complexity is linear in the ...
Hamid Reza Maei, Csaba Szepesvári, Shalabh ...
IDA
2002
Springer
15 years 2 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
JMLR
2012
13 years 5 months ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
INFOCOM
2012
IEEE
13 years 5 months ago
Delay optimal multichannel opportunistic access
Abstract—The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing a...
Shiyao Chen, Lang Tong, Qing Zhao
EUROCAST
1997
Springer
85views Hardware» more  EUROCAST 1997»
15 years 7 months ago
Turing Universality of Neural Nets (Revisited)
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...
João Pedro Guerreiro Neto, Hava T. Siegelma...