back to my homepage.

Papers

In my field, authors are ordered alphabetically by last name, and conferences generally constitute the main publication venue. I have grouped conference and journal versions of my papers together and ordered my papers in r.c.o. by year of most recent publication. Links point to the most recent versions of the papers.

Clicking on an ▸ will display relevant notes or errata for the corresponding paper.
  1. L. Reyzin. Statistical Queries and Statistical Algorithms: Foundations and Applications. Manuscript on arXiv, 2020
  2. M. V. Janardhanan, L. Reyzin. On Learning a Hidden Directed Graph with Path Queries. Manuscript on arXiv, 2020
  3. D. Berend, A. Kontorovich, L. Reyzin, T. Robinson. On Biased Random Walks, Corrupted Intervals, and Learning Under Adversarial Design. Ann. Math. Artif. Intell. 2020
  4. B. Fish, L. Reyzin, B. I. P. Rubinstein. Sampling Without Compromising Accuracy in Adaptive Data Analysis. ALT 2020
  5. S. Heinecke, L. Reyzin. Crowdsourced PAC Learning under Classification Noise. HCOMP 2019
  6. L. Reyzin. Unprovability comes to machine learning. Nature 2019
  7. S. Heinecke, W. Perkins, L. Reyzin. On the Resilience of Bipartite Networks. Allerton 2018
  8. Y. Huang, M. V. Janardhanan, L. Reyzin. Network Construction with Ordered Constraints. FSTTCS 2017
  9. B. Fish, L. Reyzin. On the Complexity of Learning from Label Proportions. IJCAI 2017
  10. S. Cole, S. Friedland, L. Reyzin. A Simple Spectral Algorithm for Recovering Planted Partitions. Spec. Matrices 2017
  11. J. Cooper, L. Reyzin. Improved Algorithms for Distributed Boosting. Allerton 2017
  12. B. Fish, L. Reyzin. Open Problem: Meeting Times for Learning Random Automata. COLT 2017
  13. V. Feldman, E. Grigorescu, L. Reyzin, S. S. Vempala, Y. Xiao. Statistical Algorithms and a Lower Bound for Detecting Planted Cliques. J. ACM 2017 and STOC 2013
  14. B. Fish, Y. Huang, L. Reyzin. Recovering Social Networks by Observing Votes. AAMAS 2016
  15. A. Gutfraind, J. Kun, Á. D. Lelkes, L. Reyzin. Network Installation under Convex Costs. J. Complex Netw. 2016
  16. B. Fish, J. Kun, Á. D. Lelkes, L. Reyzin, G. Turán. On the Computational Complexity of MapReduce. DISC 2015
  17. Á. D. Lelkes, L. Reyzin. Interactive Clustering of Linear Classes and Cryptographic Lower Bounds. ALT 2015
  18. Y. Huang, B. Powers, L. Reyzin. Training-Time Optimization of a Budgeted Booster. IJCAI 2015
  19. A. Liu, L. Reyzin, B. D. Ziebart. Shift-Pessimistic Active Learning using Robust Bias-Aware Prediction. AAAI 2015
  20. J. Kun, L. Reyzin. Open Problem: Learning Quantum Circuits with Queries. COLT 2015
  21. D. Angluin, J. Aspnes, L. Reyzin. Network Construction with Subgraph Connectivity Constraints. J. Comb. Optim. 2015 and ALT 2010
  22. J. Kun, L. Reyzin. On Coloring Resilient Graphs. MFCS 2014
  23. L. Reyzin. On Boosting Sparse Parities. AAAI 2014
  24. S. Ben-David, L. Reyzin. Data Stability in Clustering: A Closer Look. Theor. Comp. Sci. 2014 and ALT 2012
  25. J. Kun, B. Powers, L. Reyzin Anti-Coordination Games and Stable Graph Colorings. SAGT 2013
  26. M. Dudik, D. Hsu, S. Kale, N. Karampatziakis, J. Langford, L. Reyzin, T. Zhang. Efficient Optimal Learning for Contextual Bandits. UAI 2011
  27. L. Reyzin. Boosting on a Budget: Sampling for Feature-Efficient Prediction. ICML 2011
  28. E. Grigorescu, L. Reyzin, S. Vempala. On Noise-Tolerant Learning of Sparse Parities and Related Problems. ALT 2011
  29. A. Beygelzimer, J. Langford, L. Li, L. Reyzin, R. E. Schapire. Contextual Bandit Algorithms with Supervised Learning Guarantees. AISTATAS 2011 (notable paper)
  30. W. Chu, L. Li, L. Reyzin, R. E. Schapire. Contextual Bandits with Linear Payoff Functions. AISTATS 2011
  31. L. Reyzin. A Review of "Famous Puzzles of Great Mathematicians" by Miodrag S. Petkoviç. ACM SIGACT News 2011
  32. D. Angluin, J. Aspnes, L. Reyzin. Optimally Learning Social Networks with Activations and Suppressions. Theor. Comp. Sci. 2010 and ALT 2008
  33. S. Kale, L. Reyzin, R. E. Schapire. Non-Stochastic Bandit Slate Problems. NIPS 2010
  34. D. Angluin, D. Eisenstat, L. Kontorovich, L. Reyzin. Lower Bounds on Learning Random Structures with Statistical Queries. ALT 2010
  35. D. Clarke, D. Eppstein, K. Ghasemloo, L. Reyzin, A. Salamon, P. Shor, A. Sterling, S. Venkatasubramanian. Questions Answered. In Theory. ACM SIGACT News 2010
  36. L. Reyzin. Active Learning of Interaction Networks. Yale University Doctoral Dissertation 2009
  37. D. Angluin, J. Aspnes, J. Chen, D. Eisenstat, L. Reyzin. Learning Acyclic Probabilistic Circuits Using Test Paths. J. Mach. Learn. Res. 2009 and COLT 2008
  38. D. Angluin, L. Becerra-Bonache, A. H. Dediu, L. Reyzin Learning Finite Automata Using Label Queries. ALT 2009
  39. D. Angluin, J. Aspnes, J. Chen, L. Reyzin. Learning Large-Alphabet and Analog Circuits with Value Injection Queries. Mach. Learn. 2008 and COLT 2007 (best student paper)
  40. L. Reyzin, N. Srivastava. On the Longest Path Algorithm for Reconstructing Trees from Distance Matrices. Inform. Process. Lett. 2007
  41. L. Reyzin, N. Srivastava. Learning and Verifying Graphs Using Queries with a Focus on Edge Counting. ALT 2007
  42. L. Reyzin, R. E. Schapire. How Boosting the Margin Can Also Boost Classifier Complexity. ICML 2006 (best student paper and outstanding paper)