Learning from Proofs
Antonina Kolokolova - Memorial University
Jan. 10, 2025, 2:30 p.m. - Jan. 10, 2025, 3:30 p.m.
MAASS 217
Hosted by: Robert Robere
A proof often gives us more than establishing a fact: it can give us algorithms. In this talk, I will cover several ways in which proofs of both upper and lower bounds in computational complexity lead to learning algorithms.
Antonina Kolokolova is a faculty member in the Computer Science Department at the Memorial University of Newfoundland (Canada). She obtained her PhD in 2005 from the University of Toronto, under the supervision of Stephen Cook. Before taking her current position, Antonina was a postdoctoral researcher at the Mathematical Institute of the Academy of Sciences in the Czech Republic, and at Simon Fraser University (Canada). Her main research interests are in theoretical computer science, in particular, computational complexity theory, mathematical logic and proof complexity.
