More Like this

1. New Lower Bounds and Upper Bounds for Listing Avoidable Vertices

   Deng, Mingyang and (January 2022, 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022))
2. Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds

   Efremenko, Klim; Kol, Gillat; Paramonov, Dmitry; Saxena, Raghuvansh R. (January 2023, Innovations in Theoretical Computer Science (ITCS))
3. Bounds in query learning

   Chase, Hunter; Freitag, James (July 2020, Conference on Learning Theory)

   Abernethy, Jacob; Agarwal, Shivani (Ed.)

   We introduce new combinatorial quantities for concept classes, and prove lower and upper bounds for learning complexity in several models of learning in terms of various combinatorial quantities. In the setting of equivalence plus membership queries, we give an algorithm which learns a class in polynomially many queries whenever any such algorithm exists. Our approach is flexible and powerful enough to give new and very short proofs of the efficient learnability of several prominent examples (e.g. regular languages and regular ω-languages), in some cases also producing new bounds on the number of queries. 

   more » « less
4. Bounds in query learning

   Chase, Hunter; Freitag, James (July 2020, Proceedings of Machine Learning Research)

   Abernethy, Jacob; Agarwal, Shivani (Ed.)

   We introduce new combinatorial quantities for concept classes, and prove lower and upper bounds for learning complexity in several models of learning in terms of various combinatorial quantities. In the setting of equivalence plus membership queries, we give an algorithm which learns a class in polynomially many queries whenever any such algorithm exists. Our approach is flexible and powerful enough to give new and very short proofs of the efficient learnability of several prominent examples (e.g. regular languages and regular ω-languages), in some cases also producing new bounds on the number of queries. 

   more » « less
5. Bounds in query learning

   Hunter Chase; James Freitag (August 2020, Proceedings of Thirty Third Conference on Learning Theory)

   We introduce new combinatorial quantities for concept classes, and prove lower and upper bounds for learning complexity in several models of learning in terms of various combinatorial quantities. In the setting of equivalence plus membership queries, we give an algorithm which learns a class in polynomially many queries whenever any such algorithm exists. Our approach is flexible and powerful enough to give new and very short proofs of the efficient learnability of several prominent examples (e.g. regular languages and regular \omega -languages), in some cases also producing new bounds on the number of queries. 

   more » « less