Sciweavers

1393 search results - page 99 / 279
» Machine Learning by Function Decomposition
Sort
View
ECML
2004
Springer
15 years 7 months ago
Experiments in Value Function Approximation with Sparse Support Vector Regression
Abstract. We present first experiments using Support Vector Regression as function approximator for an on-line, sarsa-like reinforcement learner. To overcome the batch nature of S...
Tobias Jung, Thomas Uthmann
AAAI
2008
15 years 4 months ago
Strategyproof Classification under Constant Hypotheses: A Tale of Two Functions
We consider the following setting: a decision maker must make a decision based on reported data points with binary labels. Subsets of data points are controlled by different selfi...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...
ICML
2008
IEEE
16 years 2 months ago
Gaussian process product models for nonparametric nonstationarity
Stationarity is often an unrealistic prior assumption for Gaussian process regression. One solution is to predefine an explicit nonstationary covariance function, but such covaria...
Ryan Prescott Adams, Oliver Stegle
ICML
2008
IEEE
16 years 2 months ago
Fast Gaussian process methods for point process intensity estimation
Point processes are difficult to analyze because they provide only a sparse and noisy observation of the intensity function driving the process. Gaussian Processes offer an attrac...
John P. Cunningham, Krishna V. Shenoy, Maneesh Sah...
ICDE
2008
IEEE
189views Database» more  ICDE 2008»
15 years 8 months ago
Adapting ranking functions to user preference
— Learning to rank has become a popular method for web search ranking. Traditionally, expert-judged examples are the major training resource for machine learned web ranking, whic...
Keke Chen, Ya Zhang, Zhaohui Zheng, Hongyuan Zha, ...