Sciweavers

234 search results - page 5 / 47
» Rademacher Margin Complexity
Sort
View
ICMLA
2009
14 years 7 months ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
85
Voted
ACL
2012
12 years 12 months ago
Discriminative Pronunciation Modeling: A Large-Margin, Feature-Rich Approach
We address the problem of learning the mapping between words and their possible pronunciations in terms of sub-word units. Most previous approaches have involved generative modeli...
Hao Tang, Joseph Keshet, Karen Livescu
ICML
2007
IEEE
15 years 10 months ago
Sample compression bounds for decision trees
We propose a formulation of the Decision Tree learning algorithm in the Compression settings and derive tight generalization error bounds. In particular, we propose Sample Compres...
Mohak Shah
DAM
2008
85views more  DAM 2008»
14 years 9 months ago
On the complexity of constrained VC-classes
Sauer's Lemma is extended to classes HN of binary-valued functions h on [n] = {1, . . . , n} which have a margin less than or equal to N on all x [n] with h(x) = 1, where th...
Joel Ratsaby
ICML
2008
IEEE
15 years 10 months ago
An RKHS for multi-view learning and manifold co-regularization
Inspired by co-training, many multi-view semi-supervised kernel methods implement the following idea: find a function in each of multiple Reproducing Kernel Hilbert Spaces (RKHSs)...
Vikas Sindhwani, David S. Rosenberg