Sciweavers

10054 search results - page 118 / 2011
» On the Complexity of Function Learning
Sort
View
CDES
2008
87views Hardware» more  CDES 2008»
15 years 2 months ago
Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
131
Voted
AAAI
2006
15 years 1 months ago
Sample-Efficient Evolutionary Function Approximation for Reinforcement Learning
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
Shimon Whiteson, Peter Stone
COLT
1999
Springer
15 years 4 months ago
Learning Threshold Functions with Small Weights Using Membership Queries
We study the learnability of Threshold functions with bounded weights using membership queries only. We show that the class Ct of Threshold functions with positive integer weights...
Elias Abboud, Nader Agha, Nader H. Bshouty, Nizar ...
94
Voted
NIPS
2001
15 years 1 months ago
Rates of Convergence of Performance Gradient Estimates Using Function Approximation and Bias in Reinforcement Learning
We address two open theoretical questions in Policy Gradient Reinforcement Learning. The first concerns the efficacy of using function approximation to represent the state action ...
Gregory Z. Grudic, Lyle H. Ungar
137
Voted
ICML
2006
IEEE
15 years 6 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup