Parents
Sign in to add mentor| Dana Angluin | grad student | 2009 | Yale | |
| (Active learning of interaction networks.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Reyzin L. (2019) Unprovability comes to machine learning. Nature. 565: 166-167 |
| Gutfraind A, Kun J, Lelkes ÁD, et al. (2016) Network installation under convex costs Journal of Complex Networks. 4: 177-186 |
| Liu A, Reyzin L, Ziebart BD. (2015) Shift-pessimistic active learning using robust bias-aware prediction Proceedings of the National Conference On Artificial Intelligence. 4: 2764-2770 |
| Ben-David S, Reyzin L. (2014) Data stability in clustering: A closer look Theoretical Computer Science. 558: 51-61 |
| Reyzin L. (2014) On boosting sparse parities Proceedings of the National Conference On Artificial Intelligence. 3: 2055-2061 |
| Feldman V, Grigorescu E, Reyzin L, et al. (2013) Statistical algorithms and a lower bound for detecting planted cliques Proceedings of the Annual Acm Symposium On Theory of Computing. 655-664 |
| Angluin D, Aspnes J, Reyzin L. (2013) Network construction with subgraph connectivity constraints Journal of Combinatorial Optimization. 29: 418-432 |
| Grigorescu E, Reyzin L, Vempala S. (2011) On noise-tolerant learning of sparse parities and related problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6925: 413-424 |
| Beygelzimer A, Langford J, Li L, et al. (2011) Contextual bandit algorithms with supervised learning guarantees Journal of Machine Learning Research. 15: 19-26 |
| Dudik M, Hsu D, Kale S, et al. (2011) Efficient optimal learning for contextual bandits Proceedings of the 27th Conference On Uncertainty in Artificial Intelligence, Uai 2011. 169-178 |