Data locality for sparse matrices via advanced optimisations in large-scale scientific programs

点击翻译按钮获取中文摘要

The s-step CG topic progressed the least from the 3 topics and this direction remains mostly unexplored.: with an intern we merely made minor progress in implementing s-step CG and combining it with DMPK.We've started working on sparsity and explainability in NLP recently with another student. We have looked different approaches to sparsifycation, such as the STEN library, matrix decompositions, graph neural networks (GNNs) including graph convolutional networks (GCNs). We have gained a comprehensive understanding of the challenges of sparsity in ML training, such as sparsity crawling back quickly into our the weights (because the sum and product of matrices becomes dense easily) as well as the problem of dense gradients.Finally, the most promising direction is a collaboration with spin-chemists and the topic of radical pair simulations. We have developed a python package/library for simulating radical-pair called RadicalPy. The package includes various components which can be used to construct simulations of various experiments in the field, such as construction Hamiltonians modelling different forces in the reactions, kinetics and relaxation mechanisms, experiment schemes, data conversion and plotting tools and molecule database which enables easy and convenient loading of molecules and isotopes.