Sciweavers

335 search results - page 34 / 67
» Kernel Machines and Boolean Functions
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate
Restricted Boltzmann Machines (RBMs) are a type of probability model over the Boolean cube {-1, 1}n that have recently received much attention. We establish the intractability of ...
Philip M. Long, Rocco A. Servedio
ICML
2007
IEEE
14 years 8 months ago
Regression on manifolds using kernel dimension reduction
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
Jens Nilsson, Fei Sha, Michael I. Jordan
ICMLA
2009
13 years 5 months ago
Transformation Learning Via Kernel Alignment
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...
Andrew Howard, Tony Jebara
ICTAI
2010
IEEE
13 years 5 months ago
Support Vector Methods for Sentence Level Machine Translation Evaluation
Recent work in the field of machine translation (MT) evaluation suggests that sentence level evaluation based on machine learning (ML) can outperform the standard metrics such as B...
Antoine Veillard, Elvina Melissa, Cassandra Theodo...
CIDM
2007
IEEE
13 years 11 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...