activity
20112023
most citedLearn on Source, Refine on Target:A Model Transfer Learning Framework with Random Forests

146 citations · 254 across the 22 of their papers we have counts for

collaborators
Showing 2013Show all

5 papers · 1 filter

cs.LG2013★ 2 cited

Advice-Efficient Prediction with Expert Advice

Yevgeny Seldin, Peter Bartlett, Koby Crammer

Advice-efficient prediction with expert advice (in analogy to label-efficient prediction) is a variant of prediction with expert advice game, where on each round of the game we are…

cs.LG2013★ 8 cited

A Generalized Online Mirror Descent with Applications to Classification and Regression

Francesco Orabona, Koby Crammer, Nicolò Cesa-Bianchi

Online learning algorithms are fast, memory-efficient, easy to implement, and applicable to many prediction problems, including classification, regression, and ranking. Several onl…

cs.LG2013★ 7 cited

A Last-Step Regression Algorithm for Non-Stationary Online Learning

Edward Moroshko, Koby Crammer

The goal of a learner in standard online learning is to maintain an average loss close to the loss of the best-performing single function in some class. In many real-world problems…

cs.LG2013★ 21 cited

Second-Order Non-Stationary Online Learning for Regression

Nina Vaits, Edward Moroshko, Koby Crammer

The goal of a learner, in standard online learning, is to have the cumulative loss not much larger compared with the best-performing function from some fixed class. Numerous algori…

cs.LG2013

Weighted Last-Step Min-Max Algorithm with Improved Sub-Logarithmic Regret

Edward Moroshko, Koby Crammer

In online learning the performance of an algorithm is typically compared to the performance of a fixed function from some class, with a quantity called regret. Forster proposed a l…