default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLev Reyzin
Person information
- affiliation: University of Illinois at Chicago, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c44]Ian A. Kash, Lev Reyzin, Zishun Yu:
Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs. ALT 2024: 683-718- [c43]Bethany Austhof, Lev Reyzin:
A Model for Optimizing Recalculation Schedules to Minimize Regret. ISAIM 2024: 1-9 - [c42]Lev Reyzin, Duan Tu:
On Sample Reuse Methods for Answering k-wise Statistical Queries. ISAIM 2024: 136-149 - [c41]Hunter Chase, James Freitag, Lev Reyzin:
Applications of Littlestone Dimension to Query Learning and to Compression. MFCS 2024: 42:1-42:10 - 2023
- [c40]Xing Gao, Thomas Maranzatto, Lev Reyzin:
A Unified Analysis of Dynamic Interactive Learning. Allerton 2023: 1-8 - [i24]Hunter Chase, James Freitag, Lev Reyzin:
Applications of Littlestone dimension to query learning and to compression. CoRR abs/2310.04812 (2023) - 2022
- [j15]Lev Reyzin
:
Foreword. Ann. Math. Artif. Intell. 90(1): 1-2 (2022) - [c39]Xing Gao, Lev Reyzin:
An Interactive Search Game with Two Agents. Allerton 2022: 1-8 - [c38]Mano Vikash Janardhanan, Lev Reyzin:
On Learning a Hidden Directed Graph with Path Queries. Allerton 2022: 1-5 - [c37]James Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin:
On the Geometry of Stable Steiner Tree Instances. CCCG 2022: 156-161 - [i23]Xing Gao, Thomas Maranzatto, Lev Reyzin:
A Unified Analysis of Dynamic Interactive Learning. CoRR abs/2204.07071 (2022) - [i22]Ian A. Kash, Lev Reyzin, Zishun Yu:
Slowly Changing Adversarial Bandit Algorithms are Provably Efficient for Discounted MDPs. CoRR abs/2205.09056 (2022) - 2021
- [c36]Avrim Blum, Shelby Heinecke, Lev Reyzin:
Communication-Aware Collaborative Learning. AAAI 2021: 6786-6793 - [i21]Thomas Maranzatto, Lev Reyzin:
Reconstructing Arbitrary Trees from Traces in the Tree Edit Distance Model. CoRR abs/2102.03173 (2021) - [i20]James Freitag, Neshat Mohammadi, Aditya Potukuchi, Lev Reyzin:
On the Geometry of Stable Steiner Tree Instances. CoRR abs/2109.13457 (2021) - 2020
- [j14]Daniel Berend, Aryeh Kontorovich, Lev Reyzin, Thomas J. Robinson:
On biased random walks, corrupted intervals, and learning under adversarial design. Ann. Math. Artif. Intell. 88(8): 887-905 (2020) - [j13]Benjamin Fish, Lev Reyzin:
On the Complexity of Learning a Class Ratio from Unlabeled Data. J. Artif. Intell. Res. 69: 1333-1349 (2020) - [j12]Steve Hanneke, Lev Reyzin:
Special issue on ALT 2017: Guest Editors' Introduction. Theor. Comput. Sci. 808: 1 (2020) - [c35]Benjamin Fish, Lev Reyzin, Benjamin I. P. Rubinstein:
Sampling Without Compromising Accuracy in Adaptive Data Analysis. ALT 2020: 297-318 - [i19]Mano Vikash Janardhanan, Lev Reyzin:
On Learning a Hidden Directed Graph with Path Queries. CoRR abs/2002.11541 (2020) - [i18]Daniel Berend, Aryeh Kontorovich, Lev Reyzin, Thomas J. Robinson:
On Biased Random Walks, Corrupted Intervals, and Learning Under Adversarial Design. CoRR abs/2003.13561 (2020) - [i17]Lev Reyzin:
Statistical Queries and Statistical Algorithms: Foundations and Applications. CoRR abs/2004.00557 (2020) - [i16]Benjamin Fish, Lev Reyzin:
On the Complexity of Learning from Label Proportions. CoRR abs/2004.03515 (2020) - [i15]Avrim Blum, Shelby Heinecke, Lev Reyzin:
Communication-Aware Collaborative Learning. CoRR abs/2012.10569 (2020)
2010 – 2019
- 2019
- [c34]Shelby Heinecke, Lev Reyzin:
Crowdsourced PAC Learning under Classification Noise. HCOMP 2019: 41-49 - [i14]Shelby Heinecke, Lev Reyzin:
Crowdsourced PAC Learning under Classification Noise. CoRR abs/1902.04629 (2019) - 2018
- [c33]Shelby Heinecke, Will Perkins, Lev Reyzin:
On the Resilience of Bipartite Networks. Allerton 2018: 72-77 - [c32]Benjamin Fish, Lev Reyzin, Benjamin I. P. Rubinstein:
Sublinear-Time Adaptive Data Analysis. ISAIM 2018 - 2017
- [j11]Lisa Hellerstein, Lev Reyzin, György Turán:
Foreword. Ann. Math. Artif. Intell. 79(1-3): 1-3 (2017) - [j10]Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao:
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques. J. ACM 64(2): 8:1-8:37 (2017) - [c31]Jeff Cooper, Lev Reyzin:
Improved algorithms for distributed boosting. Allerton 2017: 806-813 - [c30]Benjamin Fish, Lev Reyzin:
Open Problem: Meeting Times for Learning Random Automata. COLT 2017: 8-11 - [c29]Yi Huang, Mano Vikash Janardhanan, Lev Reyzin:
Network Construction with Ordered Constraints. FSTTCS 2017: 34:34-34:13 - [c28]Benjamin Fish, Lev Reyzin:
On the Complexity of Learning from Label Proportions. IJCAI 2017: 1675-1681 - [e1]Steve Hanneke, Lev Reyzin:
International Conference on Algorithmic Learning Theory, ALT 2017, 15-17 October 2017, Kyoto University, Kyoto, Japan. Proceedings of Machine Learning Research 76, PMLR 2017 [contents] - [i13]Yi Huang, Mano Vikash Janardhanan, Lev Reyzin:
Network Construction with Ordered Constraints. CoRR abs/1702.07292 (2017) - [i12]Benjamin Fish, Lev Reyzin, Benjamin I. P. Rubinstein:
Sublinear-Time Adaptive Data Analysis. CoRR abs/1709.09778 (2017) - 2016
- [j9]Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin:
Network installation under convex costs. J. Complex Networks 4(2): 177-186 (2016) - [c27]Benjamin Fish, Yi Huang, Lev Reyzin:
Recovering Social Networks by Observing Votes. AAMAS 2016: 376-384 - [c26]Benjamin Fish, Yi Huang, Lev Reyzin:
Recovering Social Networks by Observing Votes. ISAIM 2016 - 2015
- [j8]Dana Angluin, James Aspnes, Lev Reyzin:
Network construction with subgraph connectivity constraints. J. Comb. Optim. 29(2): 418-432 (2015) - [c25]Anqi Liu, Lev Reyzin, Brian D. Ziebart:
Shift-Pessimistic Active Learning Using Robust Bias-Aware Prediction. AAAI 2015: 2764-2770 - [c24]Ádám Dániel Lelkes, Lev Reyzin:
Interactive Clustering of Linear Classes and Cryptographic Lower Bounds. ALT 2015: 165-176 - [c23]Jeremy Kun, Lev Reyzin:
Open Problem: Learning Quantum Circuits with Queries. COLT 2015: 1767-1769 - [c22]Yi Huang, Brian Powers, Lev Reyzin:
Training-Time Optimization of a Budgeted Booster. IJCAI 2015: 3583-3589 - [c21]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán:
On the Computational Complexity of MapReduce. DISC 2015: 1-15 - [i11]Sam Cole, Shmuel Friedland, Lev Reyzin:
A Simple Spectral Algorithm for Recovering Planted Partitions. CoRR abs/1503.00423 (2015) - 2014
- [j7]Shalev Ben-David, Lev Reyzin:
Data stability in clustering: A closer look. Theor. Comput. Sci. 558: 51-61 (2014) - [c20]Lev Reyzin:
On Boosting Sparse Parities. AAAI 2014: 2055-2061 - [c19]Lev Reyzin:
On Boosting Sparse Parities. ISAIM 2014 - [c18]Jeremy Kun, Lev Reyzin:
On Coloring Resilient Graphs. MFCS (2) 2014: 517-528 - [i10]Jeremy Kun, Lev Reyzin:
On Coloring Resilient Graphs. CoRR abs/1402.4376 (2014) - [i9]Benjamin Fish, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin, György Turán:
On the Computational Complexity of MapReduce. CoRR abs/1410.0245 (2014) - [i8]Alexander Gutfraind, Jeremy Kun, Ádám Dániel Lelkes, Lev Reyzin:
Network installation and recovery: approximation lower bounds and faster exact formulations. CoRR abs/1411.3640 (2014) - 2013
- [c17]Jeremy Kun, Brian Powers, Lev Reyzin:
Anti-coordination Games and Stable Graph Colorings. SAGT 2013: 122-133 - [c16]Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao:
Statistical algorithms and a lower bound for detecting planted cliques. STOC 2013: 655-664 - [i7]Will Perkins, Lev Reyzin:
On the Resilience of Bipartite Networks. CoRR abs/1306.5720 (2013) - [i6]Jeremy Kun, Brian Powers, Lev Reyzin:
Anti-Coordination Games and Stable Graph Colorings. CoRR abs/1308.3258 (2013) - 2012
- [c15]Lev Reyzin:
Data Stability in Clustering: A Closer Look. ALT 2012: 184-198 - [i5]Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala:
The Complexity of Statistical Algorithms. CoRR abs/1201.1214 (2012) - [i4]Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh S. Vempala, Ying Xiao:
Statistical Algorithms and a Lower Bound for Planted Clique. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j6]Lev Reyzin:
Review of famous puzzles of great mathematicians by Miodrag S. Petkoviç. SIGACT News 42(3): 36-39 (2011) - [c14]Elena Grigorescu, Lev Reyzin, Santosh S. Vempala:
On Noise-Tolerant Learning of Sparse Parities and Related Problems. ALT 2011: 413-424 - [c13]Lev Reyzin:
Boosting on a Budget: Sampling for Feature-Efficient Prediction. ICML 2011: 529-536 - [c12]Miroslav Dudík, Daniel J. Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, Tong Zhang:
Efficient Optimal Learning for Contextual Bandits. UAI 2011: 169-178 - [c11]Alina Beygelzimer, John Langford, Lihong Li, Lev Reyzin, Robert E. Schapire:
Contextual Bandit Algorithms with Supervised Learning Guarantees. AISTATS 2011: 19-26 - [c10]Wei Chu, Lihong Li, Lev Reyzin, Robert E. Schapire:
Contextual Bandits with Linear Payoff Functions. AISTATS 2011: 208-214 - [i3]Miroslav Dudík, Daniel J. Hsu, Satyen Kale, Nikos Karampatziakis, John Langford, Lev Reyzin, Tong Zhang:
Efficient Optimal Learning for Contextual Bandits. CoRR abs/1106.2369 (2011) - [i2]Lev Reyzin:
Data Stability in Clustering: A Closer Look. CoRR abs/1107.2379 (2011) - 2010
- [j5]Dave Clarke, David Eppstein, Kaveh Ghasemloo, Lev Reyzin, András Z. Salamon, Peter W. Shor, Aaron D. 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]Dana Angluin, James Aspnes, Lev Reyzin:
Inferring Social Networks from Outbreaks. ALT 2010: 104-118 - [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)
2000 – 2009
- 2009
- [j3]Dana Angluin, James Aspnes, Jiang Chen, David Eisenstat, Lev Reyzin:
Learning Acyclic Probabilistic Circuits Using Test Paths. J. Mach. Learn. Res. 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. Mach. Learn. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 21:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
