This session is particularly aimed at fourth-year and OMMS students who are completing a dissertation this year. For many of you this will be the first time you have written such an extended piece on mathematics. The talk will include advice on planning a timetable, managing the workload, presenting mathematics, structuring the dissertation and creating a narrative, and avoiding plagiarism.

This week's Fridays@2 will be a panel discussion focusing on what it is like to pursue a research degree. The panel will share their thoughts and experiences in a question-and-answer session, discussing some of the practicalities of being a postgraduate student, and where a research degree might lead afterwards.

This week's Fridays@2 will feature a panel discussion on how to manage your time during your degree. The panel will share their thoughts and experiences in a Q&A session, discussing some of the practicalities of juggling lectures, the many ways to study independently and non-maths activities. 

In this interactive workshop, we'll discuss what mathematicians are looking for in written solutions. How can you set out your ideas clearly, and what are the standard mathematical conventions? Please bring a pen or pencil!

This session is likely to be most relevant for first-year undergraduates, but all are welcome.

What should you expect in intercollegiate classes?  What can you do to get the most out of them?  In this session, experienced class tutors will share their thoughts, and a current student will offer tips and advice based on their experience.

All undergraduate and masters students welcome, especially Part B and MSc students attending intercollegiate classes. (Students who attended the Part C/OMMS induction event will find significant overlap between the advice offered there and this session!)

I will present the basic idea of the flow equation approach developed by Paweł Duch to study singular stochastic partial differential equations. In particular, I will show how it can be used to prove the existence of a solution of the stochastic Burgers equation on the one-dimensional torus.

In recent years, a new class of deep neural networks has emerged, which finds its roots at model-based iterative algorithms solving inverse problems. We call these model-based neural networks deep unfolding networks (DUNs). The term is coined due to their formulation: the iterations of optimization algorithms are “unfolded” as layers of neural networks, which solve the inverse problem at hand. Ever since their advent, DUNs have been employed for tackling assorted problems, e.g., compressed sensing (CS), denoising, super-resolution, pansharpening. 

In this talk, we will revisit the application of DUNs on the CS problem, which pertains to reconstructing data from incomplete observations. We will present recent trends regarding the broader family of DUNs for CS and dive into their theory, which mainly revolves around their generalization performance; the latter is important, because it informs us about the behaviour of a neural network on examples it has never been trained on before. 
Particularly, we will focus our interest on overparameterized DUNs, which exhibit remarkable performance in terms of reconstruction and generalization error. As supported by our theoretical and empirical findings, the generalization performance of overparameterized DUNs depends on their structural properties. Our analysis sets a solid mathematical ground for developing more stable, robust, and efficient DUNs, boosting their real-world performance.