![]() |
![]() |
Programs for Cheap!Add to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Neel Krishnaswami. Write down the definition of a recursion operator on a piece of paper. Tell me its type, but be careful not to let me see the operator’s definition. I will tell you an optimization theorem that the operator satisfies. As an added bonus, I will also give you a proof of correctness for the optimisation, along with a formal guarantee about its effect on performance. The purpose of this paper is to explain these tricks. This talk is part of the Theoretical computer science seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsBham Talks Analysis seminar computer sienceOther talks[Friday seminar]: Irradiated brown dwarfs in the desert The percolating cluster is invisible to image recognition with deep learning Many-body localization from Hilbert- and real-space points of view Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Signatures of structural criticality and universality in the cellular anatomy of the brain |