| 2012 | ||
|---|---|---|
| c13 | ||
| i5 | Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala: The Complexity of Statistical Algorithms. CoRR abs/1201.1214 (2012) | |
| i4 | Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Vempala, Ying Xiao: Statistical Algorithms and a Lower Bound for Planted Clique. Electronic Colloquium on Computational Complexity (ECCC) 19: 64 (2012) | |
| 2011 | ||
| j8 | Alina Beygelzimer, John Langford, Lihong Li, Lev Reyzin, Robert E. Schapire: Contextual Bandit Algorithms with Supervised Learning Guarantees. Journal of Machine Learning Research - Proceedings Track 15: 19-26 (2011) | |
| j7 | Wei Chu, Lihong Li, Lev Reyzin, Robert E. Schapire: Contextual Bandits with Linear Payoff Functions. Journal of Machine Learning Research - Proceedings Track 15: 208-214 (2011) | |
| j6 | Lev Reyzin: Review of famous puzzles of great mathematicians by Miodrag S. Petkoviç. SIGACT News 42(3): 36-39 (2011) | |
| c12 | Elena Grigorescu, Lev Reyzin, Santosh Vempala: On Noise-Tolerant Learning of Sparse Parities and Related Problems. ALT 2011: 413-424 | |
| c11 | ||
| c10 | 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 | |
| i3 | 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) | |
| i2 | ||
| 2010 | ||
| j5 | Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron Sterling, Suresh Venkatasubramanian: Questions answered. in theory.: http: //cstheory.stackexchange.com/. SIGACT News 41(4): 58-60 (2010) | |
| j4 | Dana Angluin, James Aspnes, Lev Reyzin: Optimally learning social networks with activations and suppressions. Theor. Comput. Sci. 411(29-30): 2729-2740 (2010) | |
| c9 | ||
| c8 | Dana Angluin, David Eisenstat, Leonid Kontorovich, Lev Reyzin: Lower Bounds on Learning Random Structures with Statistical Queries. ALT 2010: 194-208 | |
| c7 | Satyen Kale, Lev Reyzin, Robert E. Schapire: Non-Stochastic Bandit Slate Problems. NIPS 2010: 1054-1062 | |
| i1 | Alina Beygelzimer, John Langford, Lihong Li, Lev Reyzin, Robert E. Schapire: An Optimal High Probability Algorithm for the Contextual Bandit Problem. CoRR abs/1002.4058 (2010) | |
| 2009 | ||
| j3 | Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. Journal of Machine Learning Research 10: 1881-1911 (2009) | |
| c6 | Dana Angluin, Leonor Becerra-Bonache, Adrian Horia Dediu, Lev Reyzin: Learning Finite Automata Using Label Queries. ALT 2009: 171-185 | |
| 2008 | ||
| j2 | Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin: Learning large-alphabet and analog circuits with value injection queries. Machine Learning 72(1-2): 113-138 (2008) | |
| c5 | Dana Angluin, James Aspnes, Lev Reyzin: Optimally Learning Social Networks with Activations and Suppressions. ALT 2008: 272-286 | |
| c4 | Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin: Learning Acyclic Probabilistic Circuits Using Test Paths. COLT 2008: 169-180 | |
| 2007 | ||
| j1 | Lev Reyzin, Nikhil Srivastava: On the longest path algorithm for reconstructing trees from distance matrices. Inf. Process. Lett. 101(3): 98-100 (2007) | |
| c3 | Lev Reyzin, Nikhil Srivastava: Learning and Verifying Graphs Using Queries with a Focus on Edge Counting. ALT 2007: 285-297 | |
| c2 | Dana Angluin, James Aspnes, Jiang Chen, Lev Reyzin: Learning Large-Alphabet and Analog Circuits with Value Injection Queries. COLT 2007: 51-65 | |
| 2006 | ||
| c1 | Lev Reyzin, Robert E. Schapire: How boosting the margin can also boost classifier complexity. ICML 2006: 753-760 | |
Colors in the list of coauthors
Last update Tue May 21 17:34:20 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page