11, Pokrovsky boulevard.
Phone: +7 (495) 531-00-00 *27254
Mendelson S., Zhivotovskiy N.
math. arxive. Cornell University, 2018
Dvurechensky P., Eduard Gorbunov, Gasnikov A.
European Journal of Operational Research. 2020. P. 1-21.
Shabanov D. A., Kozik J., Duraj L.
European Journal of Combinatorics. 2021. Vol. 91. P. 1-11.
Kuznetsov S., Kaytoue M., Belfodil A.
In bk.: International Journal of General Systems. Iss. 49. 2020. P. 271-285.
Kaledin M., Moulines E., Naumov A. et al.
In bk.: Proceedings of Machine Learning Research. Vol. 125: Proceedings of Thirty Third Conference on Learning Theory. 2020. P. 2144-2203.
I will motivate the talk by reviewing some state of the art models for problems like matrix factorisation models for link prediction and tweet clustering. Then I will review the classes of distributions that can be strung together in networks to generate discrete data. This allows a rich class of models that, in its simplest form, covers things like Poisson matrix factorisation, Latent Dirichlet allocation, and Stochastic block models, but, more generally, covers complex hierarchical models on network and text data. The distributions covered include so-called non-parametric distributions such as the Gamma process. Accompanying these are a set of collapsing and augmentation techniques that are used to generate fast Gibbs samplers for many models in this class. To complete this picture, turning complex network models into fast Gibbs samplers, I will illustrate our recent methods of doing matrix factorisation with side information (e.g., GloVe word embeddings), done for link prediction, for instance, for citation networks.
Venue:Moscow, Kochnovsky pr.,3, room 317, 18:10
Everyone interested is welcome to attend.
If you need a pass to HSE, please contact firstname.lastname@example.org