Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Satyen Kale
2010 – today
- 2013
[j13]Satyen Kale, Yuval Peres, C. Seshadhri: Noise Tolerance of Expanders and Sublinear Expansion Reconstruction. SIAM J. Comput. 42(1): 305-323 (2013)- [i8]Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley: Bargaining for Revenue Shares on Tree Trading Networks. CoRR abs/1304.5822 (2013)
- 2012
- [j12]Alekh Agarwal, Miroslav Dudík, Satyen Kale, John Langford, Robert E. Schapire: Contextual Bandit Learning with Predictable Rewards. Journal of Machine Learning Research - Proceedings Track 22: 19-26 (2012)
- [j11]Satyen Kale: Commentary on "Online Optimization with Gradual Variations". Journal of Machine Learning Research - Proceedings Track 23: 6.21-6.24 (2012)
- [j10]Elad Hazan, Satyen Kale, Shai Shalev-Shwartz: Near-Optimal Algorithms for Online Matrix Prediction. Journal of Machine Learning Research - Proceedings Track 23: 38.1-38.13 (2012)
- [j9]Sanjeev Arora, Elad Hazan, Satyen Kale: The Multiplicative Weights Update Method: a Meta-Algorithm and Applications. Theory of Computing 8(1): 121-164 (2012)
- [c27]Haim Avron, Satyen Kale, Shiva Prasad Kasiviswanathan, Vikas Sindhwani: Efficient and Practical Stochastic Subgradient Descent for Nuclear Norm Regularization. ICML 2012
- [c26]
- [i7]Alekh Agarwal, Miroslav Dudík, Satyen Kale, John Langford, Robert E. Schapire: Contextual Bandit Learning with Predictable Rewards. CoRR abs/1202.1334 (2012)
- [i6]Elad Hazan, Satyen Kale, Shai Shalev-Shwartz: Near-Optimal Algorithms for Online Matrix Prediction. CoRR abs/1204.0136 (2012)
- [i5]
- 2011
- [j8]Elad Hazan, Satyen Kale: Better Algorithms for Benign Bandits. Journal of Machine Learning Research 12: 1287-1311 (2011)
- [j7]Elad Hazan, Satyen Kale: Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization. Journal of Machine Learning Research - Proceedings Track 19: 421-436 (2011)
- [j6]Elad Hazan, Satyen Kale: A simple multi-armed bandit algorithm with optimal variation-bounded regret. Journal of Machine Learning Research - Proceedings Track 19: 817-820 (2011)
- [j5]Satyen Kale, C. Seshadhri: An Expansion Tester for Bounded Degree Graphs. SIAM J. Comput. 40(3): 709-720 (2011)
- [c25]Satyen Kale, C. Seshadhri: Combinatorial Approximation Algorithms for MaxCut using Random Walks. ICS 2011: 367-388
- [c24]Satyen Kale, Ravi Kumar, Sergei Vassilvitskii: Cross-Validation and Mean-Square Stability. ICS 2011: 487-495
- [c23]Elad Hazan, Satyen Kale: Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction. NIPS 2011: 891-899
- [c22]Arpita Ghosh, Satyen Kale, R. Preston McAfee: Who moderates the moderators?: crowdsourcing abuse detection in user-generated content. ACM Conference on Electronic Commerce 2011: 167-176
- [c21]Miroslav Dudík, Daniel Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, Tong Zhang: Efficient Optimal Learning for Contextual Bandits. UAI 2011: 169-178
- [i4]Miroslav Dudík, Daniel Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, Tong Zhang: Efficient Optimal Learning for Contextual Bandits. CoRR abs/1106.2369 (2011)
- 2010
- [j4]Elad Hazan, Satyen Kale: Extracting certainty from uncertainty: regret bounded by variation in costs. Machine Learning 80(2-3): 165-188 (2010)
- [j3]Sanjeev Arora, Elad Hazan, Satyen Kale: O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n2) Time. SIAM J. Comput. 39(5): 1748-1771 (2010)
- [c20]Elad Hazan, Satyen Kale, Manfred K. Warmuth: Learning Rotations with Little Regret. COLT 2010: 144-154
- [c19]Elad Hazan, Satyen Kale, Manfred K. Warmuth: On-line Variance Minimization in O(n2) per Trial? COLT 2010: 314-315
- [c18]Satyen Kale, Lev Reyzin, Robert E. Schapire: Non-Stochastic Bandit Slate Problems. NIPS 2010: 1054-1062
- [i3]Satyen Kale, C. Seshadhri: Combinatorial Approximation Algorithms for MaxCut using Random Walks. CoRR abs/1008.3938 (2010)
2000 – 2009
- 2009
- [c17]
- [c16]
- [c15]
- [c14]Boaz Barak, Moritz Hardt, Satyen Kale: The uniform hardcore lemma via approximate Bregman projections. SODA 2009: 1193-1200
- 2008
- [c13]Elad Hazan, Satyen Kale: Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. COLT 2008: 57-68
- [c12]Satyen Kale, Yuval Peres, C. Seshadhri: Noise Tolerance of Expanders and Sublinear Expander Reconstruction. FOCS 2008: 719-728
- [c11]
- 2007
- [j2]Abhiram G. Ranade, Srikanth S. Mahabalarao, Satyen Kale: A variation on SVD based image compression. Image Vision Comput. 25(6): 771-777 (2007)
- [j1]Elad Hazan, Amit Agarwal, Satyen Kale: Logarithmic regret algorithms for online convex optimization. Machine Learning 69(2-3): 169-192 (2007)
- [c10]Elad Hazan, Satyen Kale: Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria. NIPS 2007
- [c9]Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar: Privacy, accuracy, and consistency too: a holistic solution to contingency table release. PODS 2007: 273-282
- [c8]T. S. Jayram, Satyen Kale, Erik Vee: Efficient aggregation algorithms for probabilistic data. SODA 2007: 346-355
- [c7]Sanjeev Arora, Satyen Kale: A combinatorial, primal-dual approach to semidefinite programs. STOC 2007: 227-236
- [i2]Satyen Kale, C. Seshadhri: Testing Expansion in Bounded Degree Graphs. Electronic Colloquium on Computational Complexity (ECCC) 14(076) (2007)
- [i1]Satyen Kale: Boosting and hard-core set constructions: a simplified approach. Electronic Colloquium on Computational Complexity (ECCC) 14(131) (2007)
- 2006
- [c6]Sanjeev Arora, Elad Hazan, Satyen Kale: A Fast Random Sampling Algorithm for Sparsifying Matrices. APPROX-RANDOM 2006: 272-279
- [c5]Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal: Logarithmic Regret Algorithms for Online Convex Optimization. COLT 2006: 499-513
- [c4]Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire: Algorithms for portfolio management based on the Newton method. ICML 2006: 9-16
- 2005
- [c3]Sanjeev Arora, Elad Hazan, Satyen Kale: Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. FOCS 2005: 339-348
- [c2]Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh: Analysis and Algorithms for Content-Based Event Matching. ICDCS Workshops 2005: 363-369
- 2004
- [c1]Sanjeev Arora, Elad Hazan, Satyen Kale: 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time. FOCS 2004: 238-247
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-04 21:42 CEST by the dblp team