530 search results - page 35 / 106 » Learning Bounds for Domain Adaptation |
136
click to vote
CRYPTO
2009
Springer
15 years 7 months ago
2009
Springer
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object...
98
Voted
ECML
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. For large state-space Markovian Decision Problems MonteCarlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new...
131
click to vote
AGI
2011
14 years 4 months ago
2011
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...
145
Voted
EWCBR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...