We consider a sparse multi-task regression framework for fitting a collection of related sparse models. Representing models as nodes in a graph with edges between related models, a framework that fuses lasso regressions with the total variation penalty is investigated. Under a form of generalised restricted eigenvalue assumption, bounds on prediction and squared error are given that depend upon the sparsity of each model and the differences between related models. This assumption relates to the smallest eigenvalue restricted to the intersection of two cone sets of the covariance matrix constructed from each of the agents' covariances. In the case of a grid topology high-probability bounds are given that match, up to log factors, the no-communication setting of fitting a lasso on each model, divided by the number of agents.  A decentralised dual method that exploits a convex-concave formulation of the penalised problem is proposed to fit the models and its effectiveness demonstrated on simulations. (Joint work with Sahand Negahban and Patrick Rebeschini)

A stationary Navier-Stokes-Brinkman model coupled to a system of advection-diffusion equations serves as a model for so-called double-diffusive viscous flow in porous mediain which both heat and a solute within the fluid phase are subject to transport and diffusion. The solvability analysis of these governing equations results as a combination of compactness arguments and fixed-point theory. In addition an H(div)-conforming discretisation is formulated by a modification of existing methods for Brinkman flows. The well-posedness ofthe discrete Galerkin formulation is also discussed, and convergence properties are derived rigorously. Computational tests confirm the predicted rates of error decay and illustrate the applicability of the methods for the simulation of bacterial bioconvection and thermohaline circulation problems.

Numerical simulations indicate that deep artificial neural networks (DNNs) seem to be able to overcome the curse of dimensionality in many computational  problems in the sense that the number of real parameters used to describe the DNN grows at most polynomially in both the reciprocal of the prescribed approximation accuracy and the dimension of the function which the DNN aims to approximate. However, there are only a few special situations where results in the literature can rigorously explain the success of DNNs when approximating high-dimensional functions.

In this talk it is revealed that DNNs do indeed overcome the curse of dimensionality in the numerical approximation of Kolmogorov PDEs with constant diffusion and nonlinear drift coefficients. A crucial ingredient in our proof of this result is the fact that the artificial neural network used to approximate the PDE solution really is a deep artificial neural network with a large number of hidden layers.

Graph sampling with noise is a fundamental problem in graph signal processing (GSP). A popular biased scheme using graph Laplacian regularization (GLR) solves a system of linear equations for its reconstruction. Assuming this GLR-based reconstruction scheme, we propose a fast sampling strategy to maximize the numerical stability of the linear system--i.e., minimize the condition number of the coefficient matrix. Specifically, we maximize the eigenvalue lower bounds of the matrix that are left-ends of Gershgorin discs of the coefficient matrix, without eigen-decomposition. We propose an iterative algorithm to traverse the graph nodes via Breadth First Search (BFS) and align the left-ends of all corresponding Gershgorin discs at lower-bound threshold T using two basic operations: disc shifting and scaling. We then perform binary search to maximize T given a sample budget K. Experiments on real graph data show that the proposed algorithm can effectively promote large eigenvalue lower bounds, and the reconstruction MSE is the same or smaller than existing sampling methods for different budget K at much lower complexity.

A defect-based a posteriori error estimate for Krylov subspace approximations to the matrix exponential is introduced. This error estimate constitutes an upper norm bound on the error and can be computed during the construction of the Krylov subspace with nearly no computational effort. The matrix exponential function itself can be understood as a time propagation with restarts. In practice, we are interested in finding time steps for which the error of the Krylov subspace approximation is smaller than a given tolerance. Finding correct time steps is a simple task with our error estimate. Apart from step size control, the upper error bound can be used on the fly to test if the dimension of the Krylov subspace is already sufficiently large to solve the problem in a single time step with the required accuracy.

During this seminar, we will present a new mathematical model describing the transport of nitric oxide (NO) in a realistic geometrical representation of the lungs. Nitric oxide (NO) is naturally produced in the bronchial region of the lungs. It is a physiological molecule that has antimicrobial properties and allows the relaxation of muscles. It is well known that the measurement of the molar fraction of NO in the exhaled air, the so-called FeNO, allows a monitoring of asthmatic patients, since the production of this molecule in the lungs is increased in case of inflammation. However, recent clinical studies have shown that the amount of NO in the exhaled air can also be affected by « non-inflammatory » processes, such as the action of a bronchodilator or a respiratory physiotherapy session for a patient with cystic fibrosis. Using our new model, we will highlight the complex interplay between different transport phenomena in the lungs. More specifically, we will show why changes taking place in the deepest part of the lungs are expected to impact the FeNO. This gives a new light on the clinical studies mentioned below, allowing to confer a new role to the NO for the management of various pulmonary pathologies.

The last Fridays@2 of the year will be the Prelims Preparation Lecture aimed at first-year undergraduates. Richard Earl and Vicky Neale will highlight some key points to be aware of as you prepare for exams, thinking both about exam technique and revision strategy, and a student will offer some tips from their personal experience.  This will complement the Friday@2 event in Week 2, on Managing exam anxiety.  As part of the Prelims Preparation session, we'll look through two past exam questions, giving tips on how to structure a good answer.  You'll find that most helpful if you've worked through the questions yourself beforehand, so this is advance notice so that you can slot the questions into your timetable for the next few days.  They are both from 2013, one is Q5 from Maths I (on the Groups and Group Actions course), and the other is Q3 from Maths IV (on the Dynamics course).  You can access these, and a large collection of other past Prelims exam questions, via the archive.

This week’s Fridays@2 session, led by Dr Richard Earl and Dr Vicky Neale, is intended to provide advice on exam preparation and how to approach the Part A and Part B exams.

This session is aimed at second years and third years who will be sitting exams this term. Next week’s Fridays@2 will be for first years and will look at preparing for Prelims papers.
 

This workshop will focus on the main causes of exam stress, anxiety and panic and look at practical strategies to manage and overcome these issues. We will also review strategies to best support exam preparation.

Dr Ruth Collins is a Chartered Psychologist who specialises in the management of anxiety and panic. She is also a trained mindfulness teacher and an associate of the Oxford Mindfulness Centre.

This year sees the 100th anniversary of Emmy Noether receiving her Habilitation and thus becoming the first women to be granted the right to teach and lecture at a university in Prussia (now Germany).  Noether shaped modern algebra and her influence was felt in many other fields including topology.

We will start by exploring what algebraic topology is, how the subject was shaped by algebra (under the influence of Noether), before considering some current challenges and applications.