Varsha Dani's Publications

Papers

• Peter Bartlett, Varsha Dani, Thomas Hayes, Sham Kakade, Alexander Rakhlin and Ambuj Tewari
  High Probability Regret Bounds for Online Linear Optimization
  Working title. Manuscript 2007
  
  
• Varsha Dani, Thomas Hayes and Sham Kakade
  Stochastic Linear Optimization under Bandit Feedback
  In submission.
  
  
• Varsha Dani, Thomas Hayes and Sham Kakade.
  The Price of Bandit Information for Online Linear Optimization
  To appear: 21st Annual Conference on Neural Information Processing Systems (NIPS 2007)}
  
  
• Varsha Dani, Omid Madani, David Pennock, Sumit Sanghai and Brian Galebach.
  An empirical comparison of algorithms for aggregating expert predictions.
  In: Proc. 22nd Conference on Uncertainty in Artificial Intelligence, (UAI 2006).(paper currently unavailable)
  
  
• Varsha Dani and Thomas Hayes
  Robbing the bandit: Less regret in online geometric optimization against an adaptive adversary.
  In: Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), 937-943.
  
  
• Alina Beygelzimer, Varsha Dani, Thomas Hayes, John Langford and Bianca Zadrozny
  Error Limiting Reductions Between Classification Tasks.
  In: Proc. 22nd International Conference on Machine Learning (ICML 2005)
  
  
• Ivona Bezakova and Varsha Dani
  Allocating Indivisible Goods.
  University of Chicago Dept. of Comp. Sci. Technical Report TR-2004-10, December 2004.
  Survey of results invited for publication in ACM SIGecom Exchanges, Vol. 5.3, 2005.
  
  

Ph.D. Thesis

Reviews