Sciweavers

559 search results - page 38 / 112
» Dependency Inference
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....
ICASSP
2011
IEEE
13 years 15 days ago
Sparse coding and dictionary learning based on the MDL principle
The power of sparse signal coding with learned overcomplete dictionaries has been demonstrated in a variety of applications and fields, from signal processing to statistical infe...
Ignacio Ramírez, Guillermo Sapiro
ICML
2005
IEEE
14 years 9 months ago
A graphical model for chord progressions embedded in a psychoacoustic space
Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in...
David Barber, Douglas Eck, Jean-François Pa...
COLT
1999
Springer
14 years 1 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
JACM
2007
48views more  JACM 2007»
13 years 8 months ago
The measurement calculus
We propose a calculus of local equations over one-way measurement patterns [1], which preserves interpretations, and allows the rewriting of any pattern to a standard form where e...
Vincent Danos, Elham Kashefi, Prakash Panangaden