Email discussion lists for the UK Education and Research communities

allstat@JISCMAIL.AC.UK

View:

 Message: [ First | Previous | Next | Last ] By Topic: [ First | Previous | Next | Last ] By Author: [ First | Previous | Next | Last ] Font: Proportional Font

Options

Subject:

WORKSHOP: Probabilistic Numerics for Differential Equations, 21st April, University of Warwick

From:

Date:

Sun, 1 Feb 2015 15:43:38 +0000

Content-Type:

text/plain

Parts/Attachments:

 text/plain (32 lines)
 ```*** WORKSHOP: Probabilistic Numerics for Differential Equations, 21st April, University of Warwick *** Confirmed Speakers: Prof. Martin Hairer, University of Warwick. Dr. Catherine Powell, University of Manchester. Dr. Søren Hauberg, Technical University of Denmark. Dr. Patrick Conrad, University of Warwick. Abstract: Numerical algorithms, such as methods for the numerical solution of integrals and ordinary differential equations, as well as optimization algorithms can be interpreted as estimation rules. They estimate the value of a latent, intractable quantity – the value of an integral, the solution of a differential equation, the location of an extremum – given the result of tractable computations (“observations”, such as function values of the integrand, evaluations of the differential equation, function values of the gradient of an objective). So these methods perform inference, and are accessible to the formal frameworks of probability theory. They are learning machines. Taking this observation seriously, a probabilistic numerical method is a numerical algorithm that takes in a probability distribution over its inputs, and returns a probability distribution over its output. Recent research shows that it is in fact possible to directly identify existing numerical methods, including some real classics, with specific probabilistic models. Interpreting numerical methods as learning algorithms offers various benefits. It can offer insight into the algebraic assumptions inherent in existing methods. As a joint framework for methods developed in separate communities, it allows transfer of knowledge among these areas. But the probabilistic formulation also explicitly provides a richer output than simple convergence bounds. If the probability measure returned by a probabilistic method is well-calibrated, it can be used to monitor, propagate and control the quality of computations. Lunch will be provided. We hope that you will be able to join us! Register now at: http://warwick.ac.uk/probabilisticnumerics Organisers: Mark Girolami, Philipp Hennig, Chris Oates, Michael Osborne. You may leave the list at any time by sending the command SIGNOFF allstat to [log in to unmask], leaving the subject line blank. ```