We study distribution-dependent, data-dependent, learning in the limit with adversarial disturbance. We consider an optimization-based approach to learning binary classifiers from...
Most learning to rank research has assumed that the utility of different documents is independent, which results in learned ranking functions that return redundant results. The fe...
Aleksandrs Slivkins, Filip Radlinski, Sreenivas Go...
We address the problem of learning classifiers using several kernel functions. On the contrary to many contributions in the field of learning from different sources of information...
Matthieu Kowalski, Marie Szafranski, Liva Ralaivol...
Incorporating invariances into a learning algorithm is a common problem in machine learning. We provide a convex formulation which can deal with arbitrary loss functions and arbit...
Choon Hui Teo, Amir Globerson, Sam T. Roweis, Alex...
In the information regularization framework by Corduneanu and Jaakkola (2005), the distributions of labels are propagated on a hypergraph for semi-supervised learning. The learnin...