27 search results - page 2 / 6 » Nearly Tight Bounds for the Continuum-Armed Bandit Problem |
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
—We consider a multiarmed bandit problem where the expected reward of each arm is a linear function of an unknown scalar with a prior distribution. The objective is to choose a s...
COLT
2004
Springer
13 years 10 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...