Share This Author
Stochastic Linear Optimization under Bandit Feedback
- Varsha Dani, Thomas P. Hayes, S. Kakade
- Computer Science, MathematicsCOLT
- 2008
TLDR
Allocating indivisible goods
- Ivona Bezáková, Varsha Dani
- EconomicsSECO
- 1 April 2005
TLDR
The Price of Bandit Information for Online Optimization
- Varsha Dani, Thomas P. Hayes, S. Kakade
- Computer ScienceNIPS
- 3 December 2007
TLDR
High-Probability Regret Bounds for Bandit Online Linear Optimization
- P. Bartlett, Varsha Dani, Thomas P. Hayes, S. Kakade, A. Rakhlin, Ambuj Tewari
- Computer Science, MathematicsCOLT
- 1 July 2008
TLDR
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary
- Varsha Dani, Thomas P. Hayes
- Computer ScienceSODA '06
- 22 January 2006
TLDR
Error limiting reductions between classification tasks
- A. Beygelzimer, Varsha Dani, Thomas P. Hayes, J. Langford, B. Zadrozny
- Computer ScienceICML
- 7 August 2005
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…
An Empirical Comparison of Algorithms for Aggregating Expert Predictions
- Varsha Dani, Omid Madani, D. Pennock, Sumit K. Sanghai, B. Galebach
- Computer ScienceUAI
- 13 July 2006
TLDR
The Energy Complexity of Broadcast
- Yi-Jun Chang, Varsha Dani, Thomas P. Hayes, Qizheng He, Wenzheng Li, Seth Pettie
- Computer SciencePODC
- 4 October 2017
TLDR
Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary
- Varsha Dani, V. King, Mahnush Movahedi, J. Saia
- Computer SciencePODC '12
- 1 March 2012
TLDR
Independent Sets in Random Graphs from the Weighted Second Moment Method
- Varsha Dani, C. Moore
- MathematicsAPPROX-RANDOM
- 31 October 2010
We prove new lower bounds on the likely size of a maximum independent set in a random graph with a given average degree. Our method is a weighted version of the second moment method, where we give…
...
...