Sciweavers

74 search results - page 9 / 15
» Regret Bounds for Gaussian Process Bandit Problems
Sort
View
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 11 days ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
SIAMNUM
2010
87views more  SIAMNUM 2010»
13 years 2 months ago
A Finite Element Method for Density Estimation with Gaussian Process Priors
Abstract. A variational problem characterizing the density estimator defined by the maximum a posteriori method with Gaussian process priors is derived. It is shown that this probl...
Michael Griebel, Markus Hegland
JMLR
2008
159views more  JMLR 2008»
13 years 7 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
ICASSP
2010
IEEE
13 years 7 months ago
On unbiased estimation of sparse vectors corrupted by Gaussian noise
We consider the estimation of a sparse parameter vector from measurements corrupted by white Gaussian noise. Our focus is on unbiased estimation as a setting under which the difï¬...
Alexander Jung, Zvika Ben-Haim, Franz Hlawatsch, Y...
TIT
2008
100views more  TIT 2008»
13 years 7 months ago
Communication Via Decentralized Processing
Abstract-- The common problem of a nomadic terminal sending information to a remote destination via agents with lossless connections is investigated. Such a setting suits, e.g. acc...
Amichai Sanderovich, Shlomo Shamai, Yossef Steinbe...