University of Cambridge > > AI+Pizza > AI+Pizza February 2018

AI+Pizza February 2018

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

Please note, this event may be recorded. Microsoft will own the copyright of any recording and reserves the right to distribute it as required

Speaker 1: Konstantina Palla (MSR Cambridge). Title: Bayesian nonparametrics for Sparse Dynamic Networks. Abstract: We propose a Bayesian nonparametric prior for time-varying networks. To each node of the network is associated a positive parameter, modelling the sociability of that node. Sociabilities are assumed to evolve over time and are modelled via a dynamic point process model. The model is able to (a) capture smooth evolution of the interaction between nodes, allowing edges to appear/disappear over time (b) capture long term evolution of the sociabilities© and yield sparse graphs, where the number of edges grows subquadratically with the number of nodes. The evolution of the sociabilities is described by a tractable time-varying gamma process. We provide some theoretical insights into the model and apply it to real world datasets.

Speaker 2: Mark Rowland (Cambridge university). Title: Analysing Distributional Reinforcement Learning. Abstract: Distributional approaches to value-based reinforcement learning use the entire distribution of returns, rather than just their expected values. Recently, these methods have been shown to yield state-of-the-art performance on a variety of RL tasks. In this talk, I’ll recap some of the main algorithms and results in distributional reinforcement learning, and give an overview of some recent theoretical developments (joint work with Marc G. Bellemare, Will Dabney, Rémi Munos, and Yee Whye Teh).

This talk is part of the AI+Pizza series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity