Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Different formal learning models address different aspects of learning. Below we compare learning via queries—interpreting learning as a one-shot process in which the learner i...
— The communication sub-system of complex IC systems is increasingly critical for achieving system performance. Given this, it is important that the on-chip communication archite...
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Over the last few years, social network systems have greatly increased users’ involvement in online content creation and annotation. Since such systems usually need to deal with...
Ivan Ivanov, Peter Vajda, Lutz Goldmann, Jong-Seok...