Sciweavers

Share
ICML
2009
IEEE
10 years 8 months ago
Semi-supervised learning using label mean
Semi-Supervised Support Vector Machines (S3VMs) typically directly estimate the label assignments for the unlabeled instances. This is often inefficient even with recent advances ...
Yu-Feng Li, James T. Kwok, Zhi-Hua Zhou
ICML
2009
IEEE
10 years 8 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
ICML
2009
IEEE
10 years 8 months ago
Orbit-product representation and correction of Gaussian belief propagation
Jason K. Johnson, Vladimir Y. Chernyak, Michael Ch...
ICML
2009
IEEE
10 years 8 months ago
Model-free reinforcement learning as mixture learning
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
Nikos Vlassis, Marc Toussaint
ICML
2009
IEEE
10 years 8 months ago
Surrogate regret bounds for proper losses
We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the margin-based bounds due to Bartlett et al. (2006). The...
Mark D. Reid, Robert C. Williamson
ICML
2009
IEEE
10 years 8 months ago
Nonparametric factor analysis with beta process priors
We propose a nonparametric extension to the factor analysis problem using a beta process prior. This beta process factor analysis (BPFA) model allows for a dataset to be decompose...
John William Paisley, Lawrence Carin
ICML
2009
IEEE
10 years 8 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
ICML
2009
IEEE
10 years 8 months ago
Herding dynamical weights to learn
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
Max Welling
ICML
2009
IEEE
10 years 8 months ago
Learning complex motions by sequencing simpler motion templates
Gerhard Neumann, Wolfgang Maass, Jan Peters
ICML
2009
IEEE
10 years 8 months ago
Group lasso with overlap and graph lasso
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
Laurent Jacob, Guillaume Obozinski, Jean-Philippe ...
books