Files in this item



application/pdfDraft 2, The Op ... t AI Fellows Program .pdf (89kB)
(no description provided)PDF


Title:Sketching: A Cognitively inspired Compositional Theorem Prover that Learns to Prove
Author(s):Brando Miranda
theorem proving
machine learning
artificial intelligence
Abstract:Current advances in Deep Learning have accelerated A.I. in an unprecedented way. Now we can solve tasks that seemed beyond our reach like language translation, beating top human Go players and generating images indistinguishable from real ones. The progress is impressive but it has been at the cost of transparency. As models become larger and more complex it has become increasingly difficult to understand what they do reliably at many levels of abstraction. One level that inspires me is the mathematical level. Do current Deep Learning models generalize because of implicit regularization? Is the role of over-parameterization the factor that leads to learnability via gradient descent in highly non-convex landscapes? Are classical statistical learning bounds useful in characterizing Deep Neural Networks? With the increased investment in A.I. and people fearlessly building, designing and hacking, the race to explain what all these models do becomes unmanageably complex with our current mathematical tools.
Issue Date:2018-12-11
Date Available in IDEALS:2021-11-15

This item appears in the following Collection(s)

Item Statistics