Sciweavers

78 search results - page 2 / 16
» Structured Prediction Models via the Matrix-Tree Theorem
Sort
View
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 5 months ago
Knowledge transfer via multiple model local structure mapping
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
Jing Gao, Wei Fan, Jing Jiang, Jiawei Han
JMLR
2012
11 years 7 months ago
Randomized Optimum Models for Structured Prediction
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
Daniel Tarlow, Ryan Prescott Adams, Richard S. Zem...
CORR
2011
Springer
202views Education» more  CORR 2011»
12 years 11 months ago
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
ICML
2008
IEEE
14 years 5 months ago
Structure compilation: trading structure for features
Structured models often achieve excellent performance but can be slow at test time. We investigate structure compilation, where we replace structure with features, which are often...
Dan Klein, Hal Daumé III, Percy Liang
ICML
2010
IEEE
13 years 6 months ago
Learning Efficiently with Approximate Inference via Dual Losses
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...
Ofer Meshi, David Sontag, Tommi Jaakkola, Amir Glo...