Gradient Oriented Active Learning for Candidate Drug Design |
Lower bounds and Space Efficient Algorithms for Composed functions via Communication Analogues
(In preparation.) with Jeff Edmonds |
Hardness of Function Composition for Semantic Read once Branching Programs
with Jeff Edmonds and Toniann Pitassi in CCC 2018, slides |
Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs
with Jeff Edmonds, Toniann Pitassi and Stephen Cook in ICALP 2016, slides Here's a compact Exposition of this result by Stasys Jukna |
On the Expressive Efficiency of Sum Product Networks (a.k.a SPNs)
with James Martens |