Sciweavers

428 search results - page 72 / 86
» Preference learning with Gaussian processes
Sort
View
SODA
2012
ACM
209views Algorithms» more  SODA 2012»
11 years 9 months ago
Simple and practical algorithm for sparse Fourier transform
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
CVPR
2008
IEEE
14 years 9 months ago
Sparse probabilistic regression for activity-independent human pose inference
Discriminative approaches to human pose inference involve mapping visual observations to articulated body configurations. Current probabilistic approaches to learn this mapping ha...
Raquel Urtasun, Trevor Darrell
ICML
2006
IEEE
14 years 8 months ago
Local distance preservation in the GP-LVM through back constraints
The Gaussian process latent variable model (GP-LVM) is a generative approach to nonlinear low dimensional embedding, that provides a smooth probabilistic mapping from latent to da...
Joaquin Quiñonero Candela, Neil D. Lawrence
ACML
2009
Springer
14 years 2 months ago
Conditional Density Estimation with Class Probability Estimators
Many regression schemes deliver a point estimate only, but often it is useful or even essential to quantify the uncertainty inherent in a prediction. If a conditional density estim...
Eibe Frank, Remco R. Bouckaert
PKDD
2009
Springer
152views Data Mining» more  PKDD 2009»
14 years 1 months ago
Feature Selection for Value Function Approximation Using Bayesian Model Selection
Abstract. Feature selection in reinforcement learning (RL), i.e. choosing basis functions such that useful approximations of the unkown value function can be obtained, is one of th...
Tobias Jung, Peter Stone