Sciweavers

1419 search results - page 104 / 284
» Approximation Methods for Supervised Learning
Sort
View
ICML
2010
IEEE
15 years 1 months ago
Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
ICML
2009
IEEE
16 years 1 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint
110
Voted
ICML
2003
IEEE
16 years 1 months ago
Weighted Low-Rank Approximations
We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving weighted low-rank approximat...
Nathan Srebro, Tommi Jaakkola
85
Voted
ICTAI
2009
IEEE
15 years 7 months ago
EBLearn: Open-Source Energy-Based Learning in C++
Energy-based learning (EBL) is a general framework to describe supervised and unsupervised training methods for probabilistic and non-probabilistic factor graphs. An energy-based ...
Pierre Sermanet, Koray Kavukcuoglu, Yann LeCun
87
Voted
ICDM
2008
IEEE
109views Data Mining» more  ICDM 2008»
15 years 7 months ago
Learning by Propagability
In this paper, we present a novel feature extraction framework, called learning by propagability. The whole learning process is driven by the philosophy that the data labels and o...
Bingbing Ni, Shuicheng Yan, Ashraf A. Kassim, Loon...