Sciweavers

2914 search results - page 384 / 583
» Learning and Inference with Constraints
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Dirichlet component analysis: feature extraction for compositional data
We consider feature extraction (dimensionality reduction) for compositional data, where the data vectors are constrained to be positive and constant-sum. In real-world problems, t...
Hua-Yan Wang, Qiang Yang, Hong Qin, Hongbin Zha
COLT
2005
Springer
16 years 2 days ago
Leaving the Span
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
Manfred K. Warmuth, S. V. N. Vishwanathan
EMNLP
2006
15 years 8 months ago
Better Informed Training of Latent Syntactic Features
We study unsupervised methods for learning refinements of the nonterminals in a treebank. Following Matsuzaki et al. (2005) and Prescher (2005), we may for example split NP withou...
Markus Dreyer, Jason Eisner
JMLR
2010
119views more  JMLR 2010»
15 years 1 months ago
Factorized Orthogonal Latent Spaces
Existing approaches to multi-view learning are particularly effective when the views are either independent (i.e, multi-kernel approaches) or fully dependent (i.e., shared latent ...
Mathieu Salzmann, Carl Henrik Ek, Raquel Urtasun, ...
ML
2002
ACM
127views Machine Learning» more  ML 2002»
15 years 6 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...