The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Satyen Kale" ( http://dblp.L3S.de/Authors/Satyen_Kale )

  Author page on DBLP  Author page in RDF  Community of Satyen Kale in ASPL-2

Publication years (Num. hits)
2004-2008 (17) 2009-2011 (20) 2012-2013 (16) 2014-2016 (19) 2017-2019 (21)
Publication types (Num. hits)
article(34) inproceedings(56) proceedings(3)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 9 occurrences of 9 keywords

Results
Found 94 publication records. Showing 93 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Sashank J. Reddi, Satyen Kale, Sanjiv Kumar On the Convergence of Adam and Beyond. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Matthew Staib, Sashank J. Reddi, Satyen Kale, Sanjiv Kumar, Suvrit Sra Escaping Saddle Points with Adaptive Gradient Methods. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Dylan J. Foster, Spencer Greenberg, Satyen Kale, Haipeng Luo, Mehryar Mohri, Karthik Sridharan Hypothesis Set Stability and Generalization. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Sashank J. Reddi, Satyen Kale, Felix X. Yu, Daniel Niels Holtmann-Rice, Jiecao Chen, Sanjiv Kumar Stochastic Negative Mining for Learning with Large Output Spaces. Search on Bibsonomy AISTATS The full citation details ... 2019 DBLP  BibTeX  RDF
1Matthew Staib, Sashank J. Reddi, Satyen Kale, Sanjiv Kumar, Suvrit Sra Escaping Saddle Points with Adaptive Gradient Methods. Search on Bibsonomy ICML The full citation details ... 2019 DBLP  BibTeX  RDF
1Aurélien Garivier, Satyen Kale (eds.) Algorithmic Learning Theory, ALT 2019, 22-24 March 2019, Chicago, Illinois, USA. Search on Bibsonomy ALT The full citation details ... 2019 DBLP  BibTeX  RDF
1Aurélien Garivier, Satyen Kale Algorithmic Learning Theory 2019: Preface. Search on Bibsonomy ALT The full citation details ... 2019 DBLP  BibTeX  RDF
1Sashank J. Reddi, Satyen Kale, Felix X. Yu, Daniel N. Holtmann-Rice, Jiecao Chen, Sanjiv Kumar Stochastic Negative Mining for Learning with Large Output Spaces. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dylan J. Foster, Satyen Kale, Haipeng Luo, Mehryar Mohri, Karthik Sridharan Logistic Regression: The Importance of Being Improper. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Dylan J. Foster, Satyen Kale, Mehryar Mohri, Karthik Sridharan Parameter-free online learning via model selection. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Sashank J. Reddi, Satyen Kale, Sanjiv Kumar On the Convergence of Adam and Beyond. Search on Bibsonomy ICLR The full citation details ... 2018 DBLP  BibTeX  RDF
1Scott Aaronson, Xinyi Chen, Elad Hazan, Satyen Kale, Ashwin Nayak Online Learning of Quantum States. Search on Bibsonomy NeurIPS The full citation details ... 2018 DBLP  BibTeX  RDF
1Manzil Zaheer, Sashank J. Reddi, Devendra Singh Sachan, Satyen Kale, Sanjiv Kumar Adaptive Methods for Nonconvex Optimization. Search on Bibsonomy NeurIPS The full citation details ... 2018 DBLP  BibTeX  RDF
1Ian En-Hsu Yen, Satyen Kale, Felix X. Yu, Daniel Niels Holtmann-Rice, Sanjiv Kumar, Pradeep Ravikumar Loss Decomposition for Fast Learning in Large Output Spaces. Search on Bibsonomy ICML The full citation details ... 2018 DBLP  BibTeX  RDF
1Dylan J. Foster, Satyen Kale, Haipeng Luo, Mehryar Mohri, Karthik Sridharan Logistic Regression: The Importance of Being Improper. Search on Bibsonomy COLT The full citation details ... 2018 DBLP  BibTeX  RDF
1Satyen Kale, Zohar S. Karnin, Tengyuan Liang, Dávid Pál Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale, Shai Shalev-Shwartz Near-Optimal Algorithms for Online Matrix Prediction. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Dylan J. Foster, Satyen Kale, Mehryar Mohri, Karthik Sridharan Parameter-Free Online Learning via Model Selection. Search on Bibsonomy NIPS The full citation details ... 2017 DBLP  BibTeX  RDF
1Satyen Kale, Zohar S. Karnin, Tengyuan Liang, Dávid Pál Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP. Search on Bibsonomy ICML The full citation details ... 2017 DBLP  BibTeX  RDF
1Satyen Kale, Ohad Shamir Preface: Conference on Learning Theory (COLT), 2017. Search on Bibsonomy COLT The full citation details ... 2017 DBLP  BibTeX  RDF
1Satyen Kale, Ohad Shamir (eds.) Proceedings of the 30th Conference on Learning Theory, COLT 2017, Amsterdam, The Netherlands, 7-10 July 2017 Search on Bibsonomy COLT The full citation details ... 2017 DBLP  BibTeX  RDF
1Sanjeev Arora, Satyen Kale A Combinatorial, Primal-Dual Approach to Semidefinite Programs. Search on Bibsonomy J. ACM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Dean P. Foster, Satyen Kale, Howard J. Karloff Online Sparse Linear Regression. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale, Manfred K. Warmuth Learning rotations with little regret. Search on Bibsonomy Machine Learning The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Noa Elad, Satyen Kale, Joseph (Seffi) Naor Online Semidefinite Programming. Search on Bibsonomy ICALP The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Satyen Kale, Chansoo Lee, Dávid Pál Hardness of Online Sleeping Combinatorial Optimization Problems. Search on Bibsonomy NIPS The full citation details ... 2016 DBLP  BibTeX  RDF
1Dean P. Foster, Satyen Kale, Howard J. Karloff Online Sparse Linear Regression. Search on Bibsonomy COLT The full citation details ... 2016 DBLP  BibTeX  RDF
1Alina Beygelzimer, Satyen Kale, Haipeng Luo Optimal and Adaptive Algorithms for Online Boosting. Search on Bibsonomy IJCAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Alina Beygelzimer, Elad Hazan, Satyen Kale, Haipeng Luo Online Gradient Boosting. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Satyen Kale, Chansoo Lee, Dávid Pál Hardness of Online Sleeping Combinatorial Optimization Problems. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Alina Beygelzimer, Satyen Kale, Haipeng Luo Optimal and Adaptive Algorithms for Online Boosting. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
1Kareem Amin, Satyen Kale, Gerald Tesauro, Deepak S. Turaga Budgeted Prediction with Expert Advice. Search on Bibsonomy AAAI The full citation details ... 2015 DBLP  BibTeX  RDF
1Alina Beygelzimer, Elad Hazan, Satyen Kale, Haipeng Luo Online Gradient Boosting. Search on Bibsonomy NIPS The full citation details ... 2015 DBLP  BibTeX  RDF
1Alina Beygelzimer, Satyen Kale, Haipeng Luo Optimal and Adaptive Algorithms for Online Boosting. Search on Bibsonomy ICML The full citation details ... 2015 DBLP  BibTeX  RDF
1Peter Grünwald, Elad Hazan, Satyen Kale (eds.) Proceedings of The 28th Conference on Learning Theory, COLT 2015, Paris, France, July 3-6, 2015 Search on Bibsonomy COLT The full citation details ... 2015 DBLP  BibTeX  RDF
1Alekh Agarwal, Daniel J. Hsu, Satyen Kale, John Langford 0001, Lihong Li 0001, Robert E. Schapire Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization. Search on Bibsonomy J. Mach. Learn. Res. The full citation details ... 2014 DBLP  BibTeX  RDF
1Alekh Agarwal, Daniel J. Hsu, Satyen Kale, John Langford 0001, Lihong Li 0001, Robert E. Schapire Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits. Search on Bibsonomy ICML The full citation details ... 2014 DBLP  BibTeX  RDF
1Satyen Kale Open Problem: Efficient Online Sparse Regression. Search on Bibsonomy COLT The full citation details ... 2014 DBLP  BibTeX  RDF
1Satyen Kale Multiarmed Bandits With Limited Expert Advice. Search on Bibsonomy COLT The full citation details ... 2014 DBLP  BibTeX  RDF
1Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley Bargaining for Revenue Shares on Tree Trading Networks Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Satyen Kale Multiarmed Bandits With Limited Expert Advice. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Satyen Kale, Yuval Peres, C. Seshadhri Noise Tolerance of Expanders and Sublinear Expansion Reconstruction. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jacob D. Abernethy, Satyen Kale Adaptive Market Making via Online Learning. Search on Bibsonomy NIPS The full citation details ... 2013 DBLP  BibTeX  RDF
1Anupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber The Approximability of the Binary Paintshop Problem. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Arpita Ghosh, Satyen Kale, Kevin J. Lang, Benjamin Moseley Bargaining for Revenue Shares on Tree Trading Networks. Search on Bibsonomy IJCAI The full citation details ... 2013 DBLP  BibTeX  RDF
1Sanjeev Arora, Elad Hazan, Satyen Kale The Multiplicative Weights Update Method: a Meta-Algorithm and Applications. Search on Bibsonomy Theory of Computing The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Elad Hazan, Satyen Kale Projection-free Online Learning Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Alekh Agarwal, Miroslav Dudík, Satyen Kale, John Langford 0001, Robert E. Schapire Contextual Bandit Learning with Predictable Rewards Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale, Shai Shalev-Shwartz Near-Optimal Algorithms for Online Matrix Prediction Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale, Shai Shalev-Shwartz Near-Optimal Algorithms for Online Matrix Prediction. Search on Bibsonomy COLT The full citation details ... 2012 DBLP  BibTeX  RDF
1Satyen Kale Commentary on "Online Optimization with Gradual Variations". Search on Bibsonomy COLT The full citation details ... 2012 DBLP  BibTeX  RDF
1Alekh Agarwal, Miroslav Dudík, Satyen Kale, John Langford 0001, Robert E. Schapire Contextual Bandit Learning with Predictable Rewards. Search on Bibsonomy AISTATS The full citation details ... 2012 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Online submodular minimization. Search on Bibsonomy J. Mach. Learn. Res. The full citation details ... 2012 DBLP  BibTeX  RDF
1Haim Avron, Satyen Kale, Shiva Prasad Kasiviswanathan, Vikas Sindhwani Efficient and Practical Stochastic Subgradient Descent for Nuclear Norm Regularization. Search on Bibsonomy ICML The full citation details ... 2012 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Projection-free Online Learning. Search on Bibsonomy ICML The full citation details ... 2012 DBLP  BibTeX  RDF
1Miroslav Dudík, Daniel J. Hsu, Satyen Kale, Nikos Karampatziakis, John Langford 0001, Lev Reyzin, Tong Zhang 0001 Efficient Optimal Learning for Contextual Bandits Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale A simple multi-armed bandit algorithm with optimal variation-bounded regret. Search on Bibsonomy COLT The full citation details ... 2011 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Better Algorithms for Benign Bandits. Search on Bibsonomy J. Mach. Learn. Res. The full citation details ... 2011 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization. Search on Bibsonomy COLT The full citation details ... 2011 DBLP  BibTeX  RDF
1Satyen Kale, C. Seshadhri An Expansion Tester for Bounded Degree Graphs. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Satyen Kale, C. Seshadhri Combinatorial Approximation Algorithms for MaxCut using Random Walks. Search on Bibsonomy ICS The full citation details ... 2011 DBLP  BibTeX  RDF
1Satyen Kale, Ravi Kumar 0001, Sergei Vassilvitskii Cross-Validation and Mean-Square Stability. Search on Bibsonomy ICS The full citation details ... 2011 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction. Search on Bibsonomy NIPS The full citation details ... 2011 DBLP  BibTeX  RDF
1Miroslav Dudík, Daniel J. Hsu, Satyen Kale, Nikos Karampatziakis, John Langford 0001, Lev Reyzin, Tong Zhang 0001 Efficient Optimal Learning for Contextual Bandits. Search on Bibsonomy UAI The full citation details ... 2011 DBLP  BibTeX  RDF
1Arpita Ghosh, Satyen Kale, R. Preston McAfee Who moderates the moderators?: crowdsourcing abuse detection in user-generated content. Search on Bibsonomy EC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Satyen Kale, C. Seshadhri Combinatorial Approximation Algorithms for MaxCut using Random Walks Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Extracting certainty from uncertainty: regret bounded by variation in costs. Search on Bibsonomy Machine Learning The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sanjeev Arora, Elad Hazan, Satyen Kale O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n2) Time. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Satyen Kale, Lev Reyzin, Robert E. Schapire Non-Stochastic Bandit Slate Problems. Search on Bibsonomy NIPS The full citation details ... 2010 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale, Manfred K. Warmuth On-line Variance Minimization in O(n2) per Trial? Search on Bibsonomy COLT The full citation details ... 2010 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale, Manfred K. Warmuth Learning Rotations with Little Regret. Search on Bibsonomy COLT The full citation details ... 2010 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Better algorithms for benign bandits. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
1Boaz Barak, Moritz Hardt, Satyen Kale The uniform hardcore lemma via approximate Bregman projections. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Beyond Convexity: Online Submodular Minimization. Search on Bibsonomy NIPS The full citation details ... 2009 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale On Stochastic and Worst-case Models for Investing. Search on Bibsonomy NIPS The full citation details ... 2009 DBLP  BibTeX  RDF
1Satyen Kale, C. Seshadhri An Expansion Tester for Bounded Degree Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Satyen Kale, Yuval Peres, C. Seshadhri Noise Tolerance of Expanders and Sublinear Expander Reconstruction. Search on Bibsonomy FOCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Elad Hazan, Satyen Kale Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. Search on Bibsonomy COLT The full citation details ... 2008 DBLP  BibTeX  RDF
1Satyen Kale Boosting and hard-core set constructions: a simplified approach. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Satyen Kale, C. Seshadhri Testing Expansion in Bounded Degree Graphs. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Abhiram G. Ranade, Srikanth S. Mahabalarao, Satyen Kale A variation on SVD based image compression. Search on Bibsonomy Image Vision Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Elad Hazan, Amit Agarwal 0008, Satyen Kale Logarithmic regret algorithms for online convex optimization. Search on Bibsonomy Machine Learning The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Online learning, Portfolio management, Online optimization, Regret minimization
1Boaz Barak, Kamalika Chaudhuri, Cynthia Dwork, Satyen Kale, Frank McSherry, Kunal Talwar Privacy, accuracy, and consistency too: a holistic solution to contingency table release. Search on Bibsonomy PODS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF privacy, OLAP, contingency table
1Sanjeev Arora, Satyen Kale A combinatorial, primal-dual approach to semidefinite programs. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF balanced separator, matrix multiplicative weights, min UnCut, semidefinite programming, sparsest cut
1T. S. Jayram, Satyen Kale, Erik Vee Efficient aggregation algorithms for probabilistic data. Search on Bibsonomy SODA The full citation details ... 2007 DBLP  BibTeX  RDF
1Elad Hazan, Satyen Kale Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria. Search on Bibsonomy NIPS The full citation details ... 2007 DBLP  BibTeX  RDF
1Amit Agarwal 0008, Elad Hazan, Satyen Kale, Robert E. Schapire Algorithms for portfolio management based on the Newton method. Search on Bibsonomy ICML The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal 0008 Logarithmic Regret Algorithms for Online Convex Optimization. Search on Bibsonomy COLT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Sanjeev Arora, Elad Hazan, Satyen Kale A Fast Random Sampling Algorithm for Sparsifying Matrices. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh Analysis and Algorithms for Content-Based Event Matching. Search on Bibsonomy ICDCS Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Sanjeev Arora, Elad Hazan, Satyen Kale Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Sanjeev Arora, Elad Hazan, Satyen Kale 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #93 of 93 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license