| 2011 |
|---|
| 35 | Who moderates the moderators?: crowdsourcing abuse detection in user-generated content. Arpita Ghosh, Satyen Kale, R. Preston McAfee. ACM Conference on Electronic Commerce 2011, 167-176. Web SearchBibTeXDownload |
| 34 | Efficient Optimal Learning for Contextual Bandits. Miroslav Dudík, Daniel Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, Tong Zhang. CoRR (abs/1106.2369) (2011). Web SearchBibTeXDownload |
| 33 | Combinatorial Approximation Algorithms for MaxCut using Random Walks. Satyen Kale, C. Seshadhri. ICS 2011, 367-388. Web SearchBibTeXDownload |
| 32 | Cross-Validation and Mean-Square Stability. Satyen Kale, Ravi Kumar, Sergei Vassilvitskii. ICS 2011, 487-495. Web SearchBibTeXDownload |
| 31 | Better Algorithms for Benign Bandits. Elad Hazan, Satyen Kale. Journal of Machine Learning Research (12): 1287-1311 (2011). Web SearchBibTeXDownload |
| 30 | A simple multi-armed bandit algorithm with optimal variation-bounded regret. Elad Hazan, Satyen Kale. Journal of Machine Learning Research - Proceedings Track (19): 817-820 (2011). Web SearchBibTeXDownload |
| 29 | Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization. Elad Hazan, Satyen Kale. Journal of Machine Learning Research - Proceedings Track (19): 421-436 (2011). Web SearchBibTeXDownload |
| 28 | An Expansion Tester for Bounded Degree Graphs. Satyen Kale, C. Seshadhri. SIAM J. Comput. (40): 709-720 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 27 | On-line Variance Minimization in O(n2) per Trial?. Elad Hazan, Satyen Kale, Manfred K. Warmuth. COLT 2010, 314-315. Web SearchBibTeX |
| 26 | Learning Rotations with Little Regret. Elad Hazan, Satyen Kale, Manfred K. Warmuth. COLT 2010, 144-154. Web SearchBibTeXDownload |
| 25 | Combinatorial Approximation Algorithms for MaxCut using Random Walks. Satyen Kale, C. Seshadhri. CoRR (abs/1008.3938) (2010). Web SearchBibTeXDownload |
| 24 | Extracting certainty from uncertainty: regret bounded by variation in costs. Elad Hazan, Satyen Kale. Machine Learning (80): 165-188 (2010). Web SearchBibTeXDownload |
| 23 | Non-Stochastic Bandit Slate Problems. Satyen Kale, Lev Reyzin, Robert E. Schapire. NIPS 2010, 1054-1062. Web SearchBibTeXDownload |
| 22 | O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n2) Time. Sanjeev Arora, Elad Hazan, Satyen Kale. SIAM J. Comput. (39): 1748-1771 (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 21 | Beyond Convexity: Online Submodular Minimization. Elad Hazan, Satyen Kale. NIPS 2009, 700-708. Web SearchBibTeXDownload |
| 20 | On Stochastic and Worst-case Models for Investing. Elad Hazan, Satyen Kale. NIPS 2009, 709-717. Web SearchBibTeXDownload |
| 19 | Better algorithms for benign bandits. Elad Hazan, Satyen Kale. SODA 2009, 38-47. Web SearchBibTeXDownload |
| 18 | The uniform hardcore lemma via approximate Bregman projections. Boaz Barak, Moritz Hardt, Satyen Kale. SODA 2009, 1193-1200. Web SearchBibTeXDownload |
| 2008 |
|---|
| 17 | Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. Elad Hazan, Satyen Kale. COLT 2008, 57-68. Web SearchBibTeXDownload |
| 16 | Noise Tolerance of Expanders and Sublinear Expander Reconstruction. Satyen Kale, Yuval Peres, C. Seshadhri. FOCS 2008, 719-728. Web SearchBibTeXDownload |
| 15 | An Expansion Tester for Bounded Degree Graphs. Satyen Kale, C. Seshadhri. ICALP (1) 2008, 527-538. Web SearchBibTeXDownload |
| 2007 |
|---|
| 14 | Testing Expansion in Bounded Degree Graphs. Satyen Kale, C. Seshadhri. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload |
| 13 | Boosting and hard-core set constructions: a simplified approach. Satyen Kale. Electronic Colloquium on Computational Complexity (ECCC) (14) (2007). Web SearchBibTeXDownload |
| 12 | A variation on SVD based image compression. Abhiram G. Ranade, Srikanth S. Mahabalarao, Satyen Kale. Image Vision Comput. (25): 771-777 (2007). Web SearchBibTeXDownload |
| 11 | Logarithmic regret algorithms for online convex optimization. Elad Hazan, Amit Agarwal, Satyen Kale. Machine Learning (69): 169-192 (2007). Web SearchBibTeXDownload |
| 10 | Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria. Elad Hazan, Satyen Kale. NIPS 2007. Web SearchBibTeXDownload |
| 9 | Privacy, accuracy, and consistency too: a holistic solution to contingency table release. Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar. PODS 2007, 273-282. Web SearchBibTeXDownload |
| 8 | Efficient aggregation algorithms for probabilistic data. T. S. Jayram, Satyen Kale, Erik Vee. SODA 2007, 346-355. Web SearchBibTeXDownload |
| 7 | A combinatorial, primal-dual approach to semidefinite programs. Sanjeev Arora, Satyen Kale. STOC 2007, 227-236. Web SearchBibTeXDownload |
| 2006 |
|---|
| 6 | A Fast Random Sampling Algorithm for Sparsifying Matrices. Sanjeev Arora, Elad Hazan, Satyen Kale. APPROX-RANDOM 2006, 272-279. Web SearchBibTeXDownload |
| 5 | Logarithmic Regret Algorithms for Online Convex Optimization. Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal. COLT 2006, 499-513. Web SearchBibTeXDownload |
| 4 | Algorithms for portfolio management based on the Newton method. Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire. ICML 2006, 9-16. Web SearchBibTeXDownload |
| 2005 |
|---|
| 3 | Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. Sanjeev Arora, Elad Hazan, Satyen Kale. FOCS 2005, 339-348. Web SearchBibTeXDownload |
| 2 | Analysis and Algorithms for Content-Based Event Matching. Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh. ICDCS Workshops 2005, 363-369. Web SearchBibTeXDownload |
| 2004 |
|---|
| 1 | 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time. Sanjeev Arora, Elad Hazan, Satyen Kale. FOCS 2004, 238-247. Web SearchBibTeXDownload |
