461
Voted
ALT
2015
Springer
9 years 11 months ago
2015
Springer
Abstract. We compose a toolbox for the design of Minimum Disagreement algorithms. This box contains general procedures which transform (without much loss of efficiency) algorithms ...
405
Voted
ALT
2015
Springer
9 years 11 months ago
2015
Springer
Deterministic finite automata (DFA) have long served as a fundamental computational model in the study of theoretical computer science, and the problem of learning a DFA from give...
408
Voted
ALT
2015
Springer
9 years 11 months ago
2015
Springer
We consider a problem of learning kernels for use in SVM classification in the multi-task and lifelong scenarios and provide generalization bounds on the error of a large margin c...
119
Voted
ALT
2015
Springer
9 years 11 months ago
2015
Springer
Abstract. We study an interactive model of supervised clustering introduced by Balcan and Blum [6], where the clustering algorithm has query access to a teacher. We give an efficie...
125
click to vote
ALT
2015
Springer
9 years 11 months ago
2015
Springer
We design algorithms for online linear optimization that have optimal regret and at the same time do not need to know any upper or lower bounds on the norm of the loss vectors. We ...