COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Network Features in AI Applications
Network Features in AI ApplicationsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact nobody. HTA - Hypergraphs: Theory and Applications This talk shows how Network Science can be applied to miniaturize Artificial Neural Networks (ANNs). More specifically, an efficient sparsification strategy using ErdÅ‘s-Rényi random networks to streamline the training of ANNs is described. Initial results are promising, with Sparse ANNs significantly reduced in size (more than a 75% of sparsity) while experiencing minimal accuracy loss. Future research will explore using Network Science techniques to gain insights into how ANNs operate. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMaking Visible project events actual exams Cambridge AssessmentOther talksSPDE for stochastic epidemic models with infection-age dependent infectivity Physical Networks Become What They Learn Operator Algebras Embezzlement of entanglement and the classification of von Neumann algebras Everything Keeps Changing! Lessons from COVID-19 about Surveillance and Diagnostics (Virtual Talk) Wrap-up |