10 citations · 10 across the 4 of their papers we have counts for
4 papers
Bandit Convex Optimization: sqrt{T} Regret in One Dimension
Sébastien Bubeck, Ofer Dekel, Tomer Koren +1
We analyze the minimax regret of the adversarial bandit convex optimization problem. Focusing on the one-dimensional case, we prove that the minimax regret is $\widetildeΘ(\sqrt{T}…
Fluctuation of planar Brownian loop capturing large area
Alan Hammond, Yuval Peres
We consider a planar Brownian loop that is run for a time and conditioned on the event that its range encloses the unusually high area of , with being large. We s…
Shuffling by semi-random transpositions
Elchanan Mossel, Yuval Peres, Alistair Sinclair
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The problem o…
The Threshold for Random k-SAT is 2^k ln2 - O(k)
Dimitris Achlioptas, Yuval Peres
Let F be a random k-SAT formula on n variables, formed by selecting uniformly and independently m = rn out of all possible k-clauses. It is well-known that if r>2^k ln 2, then the…