Sciweavers

2175 search results - page 166 / 435
» Model-free Learning from Demonstration
Sort
View
KDD
2005
ACM
158views Data Mining» more  KDD 2005»
16 years 5 months ago
Adversarial learning
Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on ad...
Daniel Lowd, Christopher Meek
SDM
2009
SIAM
112views Data Mining» more  SDM 2009»
16 years 2 months ago
A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
Frederik Janssen, Johannes Fürnkranz
141
Voted
ATAL
2007
Springer
15 years 11 months ago
Transfer via inter-task mappings in policy search reinforcement learning
The ambitious goal of transfer learning is to accelerate learning on a target task after training on a different, but related, source task. While many past transfer methods have f...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 11 months ago
Learning noise
In this paper we propose a genetic programming approach to learning stochastic models with unsymmetrical noise distributions. Most learning algorithms try to learn from noisy data...
Michael D. Schmidt, Hod Lipson
CORR
2006
Springer
130views Education» more  CORR 2006»
15 years 5 months ago
Genetic Programming for Kernel-based Learning with Co-evolving Subsets Selection
Abstract. Support Vector Machines (SVMs) are well-established Machine Learning (ML) algorithms. They rely on the fact that i) linear learning can be formalized as a well-posed opti...
Christian Gagné, Marc Schoenauer, Mich&egra...