ALT
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
ALT
2008
Springer
14 years 1 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
ALT
2008
Springer
14 years 1 months ago
2008
Springer
Abstract For many centuries scientists have wondered how the human brain represents thoughts in terms of the underlying biology of neural activity. Philosophers, linguists, cogniti...
ALT
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L1, log-...
ALT
2008
Springer
14 years 1 months ago
2008
Springer
In this paper we consider the problem of actively learning the mean values of distributions associated with a finite number of options (arms). The algorithms can select which opti...
ALT
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
ALT
2008
Springer
14 years 1 months ago
2008
Springer
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
ALT
2008
Springer
14 years 1 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...