Sciweavers

NIPS
2007
13 years 11 months ago
A Risk Minimization Principle for a Class of Parzen Estimators
This paper1 explores the use of a Maximal Average Margin (MAM) optimality principle for the design of learning algorithms. It is shown that the application of this risk minimizati...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
NIPS
2007
13 years 11 months ago
Heterogeneous Component Analysis
Shigeyuki Oba, Motoaki Kawanabe, Klaus-Robert M&uu...
NIPS
2007
13 years 11 months ago
Sparse Feature Learning for Deep Belief Networks
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
Marc'Aurelio Ranzato, Y-Lan Boureau, Yann LeCun
NIPS
2007
13 years 11 months ago
Receding Horizon Differential Dynamic Programming
The control of high-dimensional, continuous, non-linear dynamical systems is a key problem in reinforcement learning and control. Local, trajectory-based methods, using techniques...
Yuval Tassa, Tom Erez, William D. Smart
NIPS
2007
13 years 11 months ago
Fast and Scalable Training of Semi-Supervised CRFs with Application to Activity Recognition
We present a new and efficient semi-supervised training method for parameter estimation and feature selection in conditional random fields (CRFs). In real-world applications suc...
Maryam Mahdaviani, Tanzeem Choudhury
NIPS
2007
13 years 11 months ago
CPR for CSPs: A Probabilistic Relaxation of Constraint Propagation
This paper proposes constraint propagation relaxation (CPR), a probabilistic approach to classical constraint propagation that provides another view on the whole parametric family...
Luis E. Ortiz
NIPS
2007
13 years 11 months ago
Fast Variational Inference for Large-scale Internet Diagnosis
Web servers on the Internet need to maintain high reliability, but the cause of intermittent failures of web transactions is non-obvious. We use approximate Bayesian inference to ...
John C. Platt, Emre Kiciman, David A. Maltz
NIPS
2007
13 years 11 months ago
Learning Horizontal Connections in a Sparse Coding Model of Natural Images
It has been shown that adapting a dictionary of basis functions to the statistics of natural images so as to maximize sparsity in the coefficients results in a set of dictionary ...
Pierre Garrigues, Bruno Olshausen
NIPS
2007
13 years 11 months ago
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
M. M. Mahmud, Sylvian R. Ray
NIPS
2007
13 years 11 months ago
Computing Robust Counter-Strategies
Adaptation to other initially unknown agents often requires computing an effective counter-strategy. In the Bayesian paradigm, one must find a good counterstrategy to the inferre...
Michael Johanson, Martin Zinkevich, Michael H. Bow...