658 search results - page 73 / 132 » Open problems in the security of learning |
ALT
2008
Springer
14 years 6 months ago
2008
Springer
This paper studies Dawid’s prequential framework from the point of view of the algorithmic theory of randomness. The main result is that two natural notions of randomness coincid...
COLT
2006
Springer
14 years 22 days ago
2006
Springer
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
UAI
1997
13 years 10 months ago
1997
There is an obvious need for improving the performance and accuracy of a Bayesian network as new data is observed. Because of errors in model construction and changes in the dynam...
CI
2010
13 years 9 months ago
2010
Some domains, such as real-time strategy (RTS) games, pose several challenges to traditional planning and machine learning techniques. In this paper, we present a novel on-line ca...
COLT
2006
Springer
14 years 22 days ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...