We stand with Ukraine

We stand with Ukraine

Lev Reyzin

Orcid: 0000-0001-7443-6024

Affiliations:

University of Illinois at Chicago, USA

According to our database¹, Lev Reyzin authored at least 62 papers between 2006 and 2024.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2024

Applications of Littlestone Dimension to Query Learning and to Compression.

[BibT_eX]

[DOI]

,

,

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

On Sample Reuse Methods for Answering k-wise Statistical Queries.

[BibT_eX]

[DOI]

,

Proceedings of the Artificial Intelligence and Image Analysis, 2024

A Model for Optimizing Recalculation Schedules to Minimize Regret.

[BibT_eX]

[DOI]

Bethany Austhof

,

Proceedings of the Artificial Intelligence and Image Analysis, 2024

Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs.

[BibT_eX]

[DOI]

,

,

Proceedings of the International Conference on Algorithmic Learning Theory, 2024

2023

A Unified Analysis of Dynamic Interactive Learning.

[BibT_eX]

[DOI]

,

Thomas Maranzatto

,

Proceedings of the 59th Annual Allerton Conference on Communication, 2023

2022

Slowly Changing Adversarial Bandit Algorithms are Provably Efficient for Discounted MDPs.

[BibT_eX]

[DOI]

,

,

CoRR, 2022

Foreword.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2022

On the Geometry of Stable Steiner Tree Instances.

[BibT_eX]

,

Neshat Mohammadi

,

Aditya Potukuchi

,

Proceedings of the 34th Canadian Conference on Computational Geometry, 2022

On Learning a Hidden Directed Graph with Path Queries.

[BibT_eX]

[DOI]

Mano Vikash Janardhanan

,

Proceedings of the 58th Annual Allerton Conference on Communication, 2022

An Interactive Search Game with Two Agents.

[BibT_eX]

[DOI]

,

Proceedings of the 58th Annual Allerton Conference on Communication, 2022

2021

Reconstructing Arbitrary Trees from Traces in the Tree Edit Distance Model.

[BibT_eX]

[DOI]

Thomas Maranzatto

,

CoRR, 2021

Communication-Aware Collaborative Learning.

[BibT_eX]

[DOI]

,

Shelby Heinecke

,

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Special issue on ALT 2017: Guest Editors' Introduction.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2020

On the Complexity of Learning a Class Ratio from Unlabeled Data.

[BibT_eX]

[DOI]

,

J. Artif. Intell. Res., 2020

Statistical Queries and Statistical Algorithms: Foundations and Applications.

[BibT_eX]

[DOI]

CoRR, 2020

On biased random walks, corrupted intervals, and learning under adversarial design.

[BibT_eX]

[DOI]

,

Aryeh Kontorovich

,

,

Thomas J. Robinson

Ann. Math. Artif. Intell., 2020

Sampling Without Compromising Accuracy in Adaptive Data Analysis.

[BibT_eX]

[DOI]

,

,

Benjamin I. P. Rubinstein

Proceedings of the Algorithmic Learning Theory, 2020

2019

Crowdsourced PAC Learning under Classification Noise.

[BibT_eX]

[DOI]

Shelby Heinecke

,

Proceedings of the Seventh AAAI Conference on Human Computation and Crowdsourcing, 2019

2018

Sublinear-Time Adaptive Data Analysis.

[BibT_eX]

[DOI]

,

,

Benjamin I. P. Rubinstein

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

On the Resilience of Bipartite Networks.

[BibT_eX]

[DOI]

Shelby Heinecke

,

,

Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017

Statistical Algorithms and a Lower Bound for Detecting Planted Cliques.

[BibT_eX]

[DOI]

,

Elena Grigorescu

,

,

Santosh S. Vempala

,

J. ACM, 2017

Foreword.

[BibT_eX]

[DOI]

Lisa Hellerstein

,

,

Ann. Math. Artif. Intell., 2017

On the Complexity of Learning from Label Proportions.

[BibT_eX]

[DOI]

,

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Network Construction with Ordered Constraints.

[BibT_eX]

[DOI]

,

Mano Vikash Janardhanan

,

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Open Problem: Meeting Times for Learning Random Automata.

[BibT_eX]

[DOI]

,

Proceedings of the 30th Conference on Learning Theory, 2017

Improved algorithms for distributed boosting.

[BibT_eX]

[DOI]

,

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

Network installation under convex costs.

[BibT_eX]

[DOI]

Alexander Gutfraind

,

,

Ádám Dániel Lelkes

,

J. Complex Networks, 2016

Recovering Social Networks by Observing Votes.

[BibT_eX]

[DOI]

,

,

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2015

Network construction with subgraph connectivity constraints.

[BibT_eX]

[DOI]

,

,

J. Comb. Optim., 2015

A Simple Spectral Algorithm for Recovering Planted Partitions.

[BibT_eX]

[DOI]

,

Shmuel Friedland

,

CoRR, 2015

On the Computational Complexity of MapReduce.

[BibT_eX]

[DOI]

,

,

Ádám Dániel Lelkes

,

,

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Training-Time Optimization of a Budgeted Booster.

[BibT_eX]

[DOI]

,

,

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Open Problem: Learning Quantum Circuits with Queries.

[BibT_eX]

[DOI]

,

Proceedings of The 28th Conference on Learning Theory, 2015

Interactive Clustering of Linear Classes and Cryptographic Lower Bounds.

[BibT_eX]

[DOI]

Ádám Dániel Lelkes

,

Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

Shift-Pessimistic Active Learning Using Robust Bias-Aware Prediction.

[BibT_eX]

[DOI]

,

,

Brian D. Ziebart

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Data stability in clustering: A closer look.

[BibT_eX]

[DOI]

Shalev Ben-David

,

Theor. Comput. Sci., 2014

Network installation and recovery: approximation lower bounds and faster exact formulations.

[BibT_eX]

[DOI]

Alexander Gutfraind

,

,

Ádám Dániel Lelkes

,

CoRR, 2014

On Coloring Resilient Graphs.

[BibT_eX]

[DOI]

,

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On Boosting Sparse Parities.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

On the Resilience of Bipartite Networks.

[BibT_eX]

[DOI]

,

CoRR, 2013

Anti-coordination Games and Stable Graph Colorings.

[BibT_eX]

[DOI]

,

,

Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

2012

Statistical Algorithms and a Lower Bound for Planted Clique.

[BibT_eX]

[DOI]

,

Elena Grigorescu

,

,

Santosh S. Vempala

,

Electron. Colloquium Comput. Complex., 2012

The Complexity of Statistical Algorithms

[BibT_eX]

[DOI]

,

Elena Grigorescu

,

,

Santosh S. Vempala

CoRR, 2012

Data Stability in Clustering: A Closer Look.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011

Review of famous puzzles of great mathematicians by Miodrag S. Petkoviç.

[BibT_eX]

[DOI]

SIGACT News, 2011

Contextual Bandits with Linear Payoff Functions.

[BibT_eX]

[DOI]

,

,

,

Robert E. Schapire

Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

Contextual Bandit Algorithms with Supervised Learning Guarantees.

[BibT_eX]

[DOI]

Alina Beygelzimer

,

,

,

,

Robert E. Schapire

Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

Efficient Optimal Learning for Contextual Bandits.

[BibT_eX]

[DOI]

Miroslav Dudík

,

,

,

Nikos Karampatziakis

,

,

,

Proceedings of the UAI 2011, 2011

Boosting on a Budget: Sampling for Feature-Efficient Prediction.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Machine Learning, 2011

On Noise-Tolerant Learning of Sparse Parities and Related Problems.

[BibT_eX]

[DOI]

Elena Grigorescu

,

,

Santosh S. Vempala

Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010

Optimally learning social networks with activations and suppressions.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2010

Questions answered. in theory.: http://cstheory.stackexchange.com/.

[BibT_eX]

[DOI]

,

,

Kaveh Ghasemloo

,

,

András Z. Salamon

,

,

Aaron D. Sterling

,

Suresh Venkatasubramanian

SIGACT News, 2010

An Optimal High Probability Algorithm for the Contextual Bandit Problem

[BibT_eX]

[DOI]

Alina Beygelzimer

,

,

,

,

Robert E. Schapire

CoRR, 2010

Non-Stochastic Bandit Slate Problems.

[BibT_eX]

[DOI]

,

,

Robert E. Schapire

Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

Lower Bounds on Learning Random Structures with Statistical Queries.

[BibT_eX]

[DOI]

,

David Eisenstat

,

Leonid Kontorovich

,

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

Inferring Social Networks from Outbreaks.

[BibT_eX]

[DOI]

,

,

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Learning Acyclic Probabilistic Circuits Using Test Paths.

[BibT_eX]

[DOI]

,

,

,

David Eisenstat

,

J. Mach. Learn. Res., 2009

Learning Finite Automata Using Label Queries.

[BibT_eX]

[DOI]

,

Leonor Becerra-Bonache

,

Adrian-Horia Dediu

,

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008

Learning large-alphabet and analog circuits with value injection queries.

[BibT_eX]

[DOI]

,

,

,

Mach. Learn., 2008

2007

On the longest path algorithm for reconstructing trees from distance matrices.

[BibT_eX]

[DOI]

,

Nikhil Srivastava

Inf. Process. Lett., 2007

Learning and Verifying Graphs Using Queries with a Focus on Edge Counting.

[BibT_eX]

[DOI]

,

Nikhil Srivastava

Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006

How boosting the margin can also boost classifier complexity.

[BibT_eX]

[DOI]

,

Robert E. Schapire

Proceedings of the Machine Learning, 2006

Loading...