We explore a general Bayesian active learning setting, in which the learner can ask arbitrary yes/no questions. We derive upper and lower bounds on the expected number of queries r...
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
— It is difficult to map many existing learning algorithms onto biological networks because the former require a separate learning network. The computational basis of biological...
Multi-task learning aims at combining information across tasks to boost prediction performance, especially when the number of training samples is small and the number of predictor...
We propose a new loss function for discriminative learning of Markov random fields, which is an intermediate loss function between the sequential loss and the pointwise loss. We s...