A compositional approach to scalable statistical modelling and computation
60 mins,
415.44 MB,
WebM
640x360,
29.97 fps,
44100 Hz,
945.34 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Wilkinson, D
Thursday 8th February 2018 - 11:00 to 12:00 |
|---|
| Created: | 2018-02-12 11:16 |
|---|---|
| Collection: | Statistical scalability |
| Publisher: | Isaac Newton Institute |
| Copyright: | Wilkinson, D |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | In statistics, and in life, we typically solve big problems by (recursively) breaking them down into smaller problems that we can solve more easily, and then compose the solutions of the smaller problems to provide a solution to the big problem that we are really interested in. This "divide and conquer" approach is necessary for the development of genuinely scalable models and algorithms. It is therefore unfortunate that statistical models and algorithms are not usually formulated in a composable way, and that the programming languages typically used for scientific and statistical computing also fail to naturally support composition of models, data and computation. The mathematical subject of category theory is in many ways the mathematical study of composition, and provides significant insight into the development of more compositional models of computation. Functional programming languages which are strongly influenced by category theory turn out to be much better suited to the development of scalable statistical algorithms than the imperative programming languages more commonly used. Expressing algorithms in a functional/categorical way is not only more elegant, concise and less error-prone, but provides numerous more tangible benefits, such as automatic parallelisation and distribution of algorithms. I will illustrate the concepts using examples such as the statistical analysis of streaming data, image analysis, numerical integration of PDEs, particle filtering, Gibbs sampling, and probabilistic programming, using concepts from category theory such as functors, monads and comonads. Illustrative code snippets will given using the Scala programming language. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 873.05 MB | View | Download | |
| WebM * | 640x360 | 945.34 kbits/sec | 415.44 MB | View | Download | |
| iPod Video | 480x270 | 498.5 kbits/sec | 219.07 MB | View | Download | |
| MP3 | 44100 Hz | 253.62 kbits/sec | 111.46 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||