Sciweavers

4 search results - page 1 / 1
» Gaussian Process Optimization in the Bandit Setting: No Regr...
Sort
View
ICML
2010
IEEE
13 years 5 months ago
Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
Niranjan Srinivas, Andreas Krause, Sham Kakade, Ma...
IPSN
2010
Springer
13 years 11 months ago
Bayesian optimization for sensor set selection
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 4 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
EOR
2007
165views more  EOR 2007»
13 years 4 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang