Some thoughts about constrained sampling algorithms
47 mins 21 secs,
86.62 MB,
MP3
44100 Hz,
249.76 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Leimkuhler, B
Thursday 21st November 2019 - 13:50 to 14:30 |
|---|
| Created: | 2019-11-22 12:41 |
|---|---|
| Collection: | Geometry, compatibility and structure preservation in computational differential equations |
| Publisher: | Isaac Newton Institute |
| Copyright: | Leimkuhler, B |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | I will survey our work on algorithms for sampling diffusions on manifolds, including isokinetic methods and constrained Langevin dynamics methods. These have mostly been introduced and tested in the setting of molecular dynamics. It is interesting to consider possible uses of these ideas in other types of sampling computations, like neural network parameterization and training of generative models.
|
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.91 Mbits/sec | 678.49 MB | View | Download | |
| WebM | 640x360 | 1.03 Mbits/sec | 366.25 MB | View | Download | |
| iPod Video | 480x270 | 491.79 kbits/sec | 170.38 MB | View | Download | |
| MP3 * | 44100 Hz | 249.76 kbits/sec | 86.62 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||