#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1971

2018

- This year (7)
- Last 5 years (24)
- Last 10 years (41)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Varsha Dani, Thomas P. Hayes, Sham M. Kakade
- COLT
- 2008

In the classical stochastic k-armed bandit problem, in each of a sequence of rounds, a decision maker chooses one of k arms and incurs a cost chosen from an unknown distribution associated with thatâ€¦ (More)

- Nikhil R. Devanur, Thomas P. Hayes
- EC
- 2009

We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize the revenueâ€¦ (More)

- Varsha Dani, Thomas P. Hayes, Sham M. Kakade
- NIPS
- 2007

In the online linear optimization problem, a learner must choose, in each round, a decision from a setD âŠ‚ R in order to minimize an (unknown and changing) linear cost function. We present sharp ratesâ€¦ (More)

- Varsha Dani, Thomas P. Hayes
- SODA
- 2006

We consider "online bandit geometric optimization," a problem of iterated decision making in a largely unknown and constantly changing environment. The goal is to minimize "regret," defined as theâ€¦ (More)

We introduce a reduction-based model for analyzing supervised learning tasks. We use this model to devise a new reduction from multi-class cost-sensitive classification to binary classification withâ€¦ (More)

- Thomas P. Hayes
- 2006 47th Annual IEEE Symposium on Foundations ofâ€¦
- 2006

Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In computer science,â€¦ (More)

- Thomas P. Hayes, Eric Vigoda
- FOCS
- 2003

We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree âˆ† and girth g. We prove the Glauberâ€¦ (More)

- Thomas P. Hayes, Eric Vigoda
- SODA
- 2005

We present an improved coupling technique for analyzing the mixing time of Markov chains. Using our technique, we simplify and extend previous results for sampling colorings and independent sets. Ourâ€¦ (More)

- Thomas P. Hayes, Eric Vigoda
- SODA
- 2004

We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path coupling theorem of Bubleyâ€¦ (More)

- Martin E. Dyer, Alan M. Frieze, Thomas P. Hayes, Eric Vigoda
- 45th Annual IEEE Symposium on Foundations ofâ€¦
- 2004

We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree /spl Delta/. We prove that the dynamics converges to a randomâ€¦ (More)