3556 search results - page 231 / 712 » Can machine learning be secure |
170
click to vote
ICML
2000
IEEE
16 years 5 months ago
2000
IEEE
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
128
Voted
ALT
2007
Springer
16 years 1 months ago
2007
Springer
In this paper we consider learnability in some special numberings, such as Friedberg numberings, which contain all the recursively enumerable languages, but have simpler grammar e...
165
click to vote
ALT
2005
Springer
16 years 1 months ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
160
Voted
COLT
1993
Springer
15 years 9 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
135
click to vote
IJCAI
2003
15 years 6 months ago
2003
In this paper, we describe the lessons we learned in developing AgentBuilder, a commercial system for rapidly creating agents that extract information from web sites. AgentBuilder...