Adam Kalai
List of publications from the DBLP Bibliography Server - FAQ
2008 | ||
---|---|---|
42 | EE | Parikshit Gopalan, Adam Kalai, Adam R. Klivans: A Query Algorithm for Agnostically Learning DNF?. COLT 2008: 515-516 |
41 | EE | Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Tauman Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou: The myth of the folk theorem. STOC 2008: 365-372 |
40 | EE | Parikshit Gopalan, Adam Tauman Kalai, Adam R. Klivans: Agnostically learning decision trees. STOC 2008: 527-536 |
39 | EE | Adam Tauman Kalai, Yishay Mansour, Elad Verbin: On agnostic boosting and parity learning. STOC 2008: 629-638 |
38 | EE | Reid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz: Trust-based recommendation systems: an axiomatic approach. WWW 2008: 199-208 |
37 | EE | Adam Tauman Kalai, Shang-Hua Teng: Decision trees are PAC-learnable from most product distributions: a smoothed analysis CoRR abs/0812.0933: (2008) |
36 | EE | Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. SIAM J. Comput. 37(6): 1777-1805 (2008) |
2007 | ||
35 | EE | Adam Tauman Kalai: Learning Nested Halfspaces and Uphill Decision Trees. COLT 2007: 378-392 |
34 | EE | Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett: Playing games with approximation algorithms. STOC 2007: 546-555 |
33 | EE | Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Adam Kalai, Vahab S. Mirrokni, Christos H. Papadimitriou: The Myth of the Folk Theorem. Electronic Colloquium on Computational Complexity (ECCC) 14(082): (2007) |
2006 | ||
32 | EE | Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal: Logarithmic Regret Algorithms for Online Convex Optimization. COLT 2006: 499-513 |
31 | EE | Ivona Bezáková, Adam Kalai, Rahul Santhanam: Graph model selection using maximum likelihood. ICML 2006: 105-112 |
30 | EE | Eli Ben-Sasson, Adam Tauman Kalai, Ehud Kalai: An Approach to Bounded Rationality. NIPS 2006: 145-152 |
2005 | ||
29 | EE | Sanjoy Dasgupta, Adam Tauman Kalai, Claire Monteleoni: Analysis of Perceptron-Based Active Learning. COLT 2005: 249-263 |
28 | EE | Adam Tauman Kalai, Adam R. Klivans, Yishay Mansour, Rocco A. Servedio: Agnostically Learning Halfspaces. FOCS 2005: 11-20 |
27 | EE | Sham M. Kakade, Adam Kalai: From Batch to Transductive Online Learning. NIPS 2005 |
26 | EE | Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan: Online convex optimization in the bandit setting: gradient descent without a gradient. SODA 2005: 385-394 |
25 | EE | Adam Tauman Kalai, Rocco A. Servedio: Boosting in the presence of noise. J. Comput. Syst. Sci. 71(3): 266-290 (2005) |
24 | EE | Adam Tauman Kalai, Santosh Vempala: Efficient algorithms for online decision problems. J. Comput. Syst. Sci. 71(3): 291-307 (2005) |
2004 | ||
23 | EE | Adam Kalai: Learning Monotonic Linear Functions. COLT 2004: 487-501 |
22 | EE | Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan: Online convex optimization in the bandit setting: gradient descent without a gradient CoRR cs.LG/0408007: (2004) |
2003 | ||
21 | EE | Adam Kalai, Santosh Vempala: Efficient Algorithms for Online Decision Problems. COLT 2003: 26-40 |
20 | EE | Adam Kalai, Rocco A. Servedio: Boosting in the presence of noise. STOC 2003: 195-205 |
19 | EE | Avrim Blum, Shuchi Chawla, Adam Kalai: Static Optimality and Dynamic Search-Optimality in Lists and Trees. Algorithmica 36(3): 249-260 (2003) |
18 | Avrim Blum, Adam Tauman Kalai, Jon M. Kleinberg: Admission Control to Minimize Rejections. Internet Mathematics 1(2): (2003) | |
17 | EE | Avrim Blum, Adam Kalai, Hal Wasserman: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM 50(4): 506-519 (2003) |
16 | EE | Adam Kalai: Generating Random Factored Numbers, Easily. J. Cryptology 16(4): 287-289 (2003) |
2002 | ||
15 | EE | Avrim Blum, Shuchi Chawla, Adam Kalai: Static optimality and dynamic search-optimality in lists and trees. SODA 2002: 1-8 |
14 | EE | Adam Kalai: Generating random factored numbers, easily. SODA 2002: 412-412 |
13 | EE | Adam Kalai: Efficient pattern-matching with don't cares. SODA 2002: 655-656 |
12 | Steven M. Seitz, Adam Kalai, Heung-Yeung Shum: Omnivergent Stereo. International Journal of Computer Vision 48(3): 159-172 (2002) | |
11 | EE | Adam Kalai, Santosh Vempala: Efficient Algorithms for Universal Portfolios. Journal of Machine Learning Research 3: 423-440 (2002) |
2001 | ||
10 | EE | Avrim Blum, Adam Kalai, Jon M. Kleinberg: Admission Control to Minimize Rejections. WADS 2001: 155-164 |
2000 | ||
9 | Adam Kalai, Santosh Vempala: Efficient Algorithms for Universal Portfolios. FOCS 2000: 486-491 | |
8 | EE | Avrim Blum, Adam Kalai, Hal Wasserman: Noise-tolerant learning, the parity problem, and the statistical query model. STOC 2000: 435-440 |
7 | EE | Avrim Blum, Adam Kalai, Hal Wasserman: Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model CoRR cs.LG/0010022: (2000) |
1999 | ||
6 | EE | Avrim Blum, Adam Kalai, John Langford: Beating the Hold-Out: Bounds for K-fold and Progressive Cross-Validation. COLT 1999: 203-208 |
5 | EE | Avrim Blum, Carl Burch, Adam Kalai: Finely-Competitive Paging. FOCS 1999: 450-458 |
4 | EE | Heung-Yeung Shum, Adam Kalai, Steven M. Seitz: Omnivergent Stereo. ICCV 1999: 22-29 |
3 | Avrim Blum, Adam Kalai: Universal Portfolios With and Without Transaction Costs. Machine Learning 35(3): 193-205 (1999) | |
1998 | ||
2 | Avrim Blum, Adam Kalai: A Note on Learning from Multiple-Instance Examples. Machine Learning 30(1): 23-29 (1998) | |
1997 | ||
1 | EE | Avrim Blum, Adam Kalai: Universal Portfolios With and Without Transaction Costs. COLT 1997: 309-313 |