Search the dblp DataBase

Publications of Author

1. Sanjoy Dasgupta, Adam Tauman Kalai, Claire Monteleoni
   Analysis of Perceptron-Based Active Learning. [Citation Graph (0, 0)][DBLP]
   COLT, 2005, pp:249-263 [Conf]
   
2. Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio
   Agnostically Learning Halfspaces. [Citation Graph (0, 0)][DBLP]
   FOCS, 2005, pp:11-20 [Conf]
   
3. Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan
   Online convex optimization in the bandit setting: gradient descent without a gradient. [Citation Graph (0, 0)][DBLP]
   SODA, 2005, pp:385-394 [Conf]
   
4. Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan
   Online convex optimization in the bandit setting: gradient descent without a gradient [Citation Graph (0, 0)][DBLP]
   CoRR, 2004, v:0, n:, pp:- [Journal]
   
5. Adam Tauman Kalai, Rocco A. Servedio
   Boosting in the presence of noise. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2005, v:71, n:3, pp:266-290 [Journal]
   
6. Adam Tauman Kalai, Santosh Vempala
   Efficient algorithms for online decision problems. [Citation Graph (0, 0)][DBLP]
   J. Comput. Syst. Sci., 2005, v:71, n:3, pp:291-307 [Journal]
   
7. Adam Tauman Kalai
   Learning Nested Halfspaces and Uphill Decision Trees. [Citation Graph (0, 0)][DBLP]
   COLT, 2007, pp:378-392 [Conf]
   
8. Eli Ben-Sasson, Adam Tauman Kalai, Ehud Kalai
   An Approach to Bounded Rationality. [Citation Graph (0, 0)][DBLP]
   NIPS, 2006, pp:145-152 [Conf]
   
9. Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
   Playing games with approximation algorithms. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:546-555 [Conf]
   
10. 
    Learning and Smoothed Analysis. [Citation Graph (, )][DBLP]
    
    
11. 
    Cooperation and competition in strategic games with private information. [Citation Graph (, )][DBLP]
    
    
12. 
    On agnostic boosting and parity learning. [Citation Graph (, )][DBLP]
    
    
13. 
    The myth of the folk theorem. [Citation Graph (, )][DBLP]
    
    
14. 
    Agnostically learning decision trees. [Citation Graph (, )][DBLP]
    
    
15. 
    Efficiently learning mixtures of two Gaussians. [Citation Graph (, )][DBLP]
    
    
16. 
    Decision trees are PAC-learnable from most product distributions: a smoothed analysis [Citation Graph (, )][DBLP]