Sciweavers

3837 search results - page 154 / 768
» Learning Approximate Consistencies
Sort
View
EMNLP
2006
15 years 6 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
ICML
2010
IEEE
15 years 5 months ago
Accelerated dual decomposition for MAP inference
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
Vladimir Jojic, Stephen Gould, Daphne Koller
ICML
2010
IEEE
15 years 5 months ago
A Simple Algorithm for Nuclear Norm Regularized Problems
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
Martin Jaggi, Marek Sulovský
PERVASIVE
2011
Springer
14 years 7 months ago
Using Decision-Theoretic Experience Sampling to Build Personalized Mobile Phone Interruption Models
We contribute a method for approximating users’ interruptibility costs to use for experience sampling and validate the method in an application that learns when to automatically ...
Stephanie Rosenthal, Anind K. Dey, Manuela M. Velo...
FOCI
2007
IEEE
15 years 11 months ago
Random Hypergraph Models of Learning and Memory in Biomolecular Networks: Shorter-Term Adaptability vs. Longer-Term Persistency
Recent progress in genomics and proteomics makes it possible to understand the biological networks at the systems level. We aim to develop computational models of learning and memo...
Byoung-Tak Zhang