Sciweavers

1055 search results - page 141 / 211
» Convex Factorization Machines
Sort
View
96
Voted
ICML
1995
IEEE
15 years 4 months ago
Learning with Rare Cases and Small Disjuncts
Systems that learn from examples often create a disjunctive concept definition. Small disjuncts are those disjuncts which cover only a few training examples. The problem with sma...
Gary M. Weiss
102
Voted
UIST
1995
ACM
15 years 4 months ago
Migratory Applications
We introduce a new genre of user interface applications that can migrate from one machine to another, taking their user interface and application contexts with them, and continue ...
Krishna Bharat, Luca Cardelli
COLT
2008
Springer
15 years 2 months ago
An Efficient Reduction of Ranking to Classification
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
Nir Ailon, Mehryar Mohri
COLT
2008
Springer
15 years 2 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
COLT
2008
Springer
15 years 2 months ago
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning
We study the potential benefits to classification prediction that arise from having access to unlabeled samples. We compare learning in the semi-supervised model to the standard, ...
Shai Ben-David, Tyler Lu, Dávid Pál