Lev Reyzin

According to our database1, Lev Reyzin authored at least 50 papers between 2006 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Special issue on ALT 2017: Guest Editors' Introduction.
Theor. Comput. Sci., 2020

Statistical Queries and Statistical Algorithms: Foundations and Applications.
CoRR, 2020

On Biased Random Walks, Corrupted Intervals, and Learning Under Adversarial Design.
CoRR, 2020

On Learning a Hidden Directed Graph with Path Queries.
CoRR, 2020

Sampling Without Compromising Accuracy in Adaptive Data Analysis.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Crowdsourced PAC Learning under Classification Noise.
CoRR, 2019

2018
Sublinear-Time Adaptive Data Analysis.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2018

On the Resilience of Bipartite Networks.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Statistical Algorithms and a Lower Bound for Detecting Planted Cliques.
J. ACM, 2017

Foreword.
Ann. Math. Artif. Intell., 2017

On the Complexity of Learning from Label Proportions.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Network Construction with Ordered Constraints.
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.
Proceedings of the 30th Conference on Learning Theory, 2017

Improved algorithms for distributed boosting.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Network installation under convex costs.
J. Complex Networks, 2016

Recovering Social Networks by Observing Votes.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

2015
Network construction with subgraph connectivity constraints.
J. Comb. Optim., 2015

A Simple Spectral Algorithm for Recovering Planted Partitions.
CoRR, 2015

On the Computational Complexity of MapReduce.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Training-Time Optimization of a Budgeted Booster.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Open Problem: Learning Quantum Circuits with Queries.
Proceedings of The 28th Conference on Learning Theory, 2015

Interactive Clustering of Linear Classes and Cryptographic Lower Bounds.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

Shift-Pessimistic Active Learning Using Robust Bias-Aware Prediction.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Data stability in clustering: A closer look.
Theor. Comput. Sci., 2014

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

On Coloring Resilient Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On Boosting Sparse Parities.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
On the Resilience of Bipartite Networks.
CoRR, 2013

Anti-coordination Games and Stable Graph Colorings.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013

2012
Statistical Algorithms and a Lower Bound for Planted Clique.
Electronic Colloquium on Computational Complexity (ECCC), 2012

The Complexity of Statistical Algorithms
CoRR, 2012

Data Stability in Clustering: A Closer Look.
Proceedings of the Algorithmic Learning Theory - 23rd International Conference, 2012

2011
Review of famous puzzles of great mathematicians by Miodrag S. Petkoviç.
SIGACT News, 2011

Contextual Bandits with Linear Payoff Functions.
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

Contextual Bandit Algorithms with Supervised Learning Guarantees.
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Statistics, 2011

Efficient Optimal Learning for Contextual Bandits.
Proceedings of the UAI 2011, 2011

Boosting on a Budget: Sampling for Feature-Efficient Prediction.
Proceedings of the 28th International Conference on Machine Learning, 2011

On Noise-Tolerant Learning of Sparse Parities and Related Problems.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
Optimally learning social networks with activations and suppressions.
Theor. Comput. Sci., 2010

Questions answered. in theory.: http://cstheory.stackexchange.com/.
SIGACT News, 2010

An Optimal High Probability Algorithm for the Contextual Bandit Problem
CoRR, 2010

Non-Stochastic Bandit Slate Problems.
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.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

Inferring Social Networks from Outbreaks.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009
Learning Acyclic Probabilistic Circuits Using Test Paths.
J. Mach. Learn. Res., 2009

Learning Finite Automata Using Label Queries.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008
Learning large-alphabet and analog circuits with value injection queries.
Mach. Learn., 2008

2007
On the longest path algorithm for reconstructing trees from distance matrices.
Inf. Process. Lett., 2007

Learning and Verifying Graphs Using Queries with a Focus on Edge Counting.
Proceedings of the Algorithmic Learning Theory, 18th International Conference, 2007

2006
How boosting the margin can also boost classifier complexity.
Proceedings of the Machine Learning, 2006


  Loading...