Sciweavers

129 search results - page 1 / 26
» Learning as search optimization: approximate large margin me...
Sort
View
ICML
2005
IEEE
14 years 5 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
JMLR
2008
110views more  JMLR 2008»
13 years 4 months ago
Cross-Validation Optimization for Large Scale Structured Classification Kernel Methods
We propose a highly efficient framework for penalized likelihood kernel methods applied to multiclass models with a large, structured set of classes. As opposed to many previous a...
Matthias W. Seeger
ICML
2005
IEEE
14 years 5 months ago
Fast maximum margin matrix factorization for collaborative prediction
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
Jason D. M. Rennie, Nathan Srebro
ICML
2009
IEEE
14 years 5 months ago
Large margin training for hidden Markov models with partially observed states
Large margin learning of Continuous Density HMMs with a partially labeled dataset has been extensively studied in the speech and handwriting recognition fields. Yet due to the non...
Thierry Artières, Trinh Minh Tri Do
ICMLA
2009
13 years 2 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