Dean — Ivan Arzhantsev
First Deputy Dean— Tamara Voznesenskaya
Deputy Dean for Research and International Relations - Sergei Obiedkov
Deputy Dean for finance and administration - Irina Plisetskaya
Phone: +7 (495) 772-95-90 * 12332
Moscow, 3 Kochnovsky Proezd (near metro station 'Aeroport').
The faculty trains developers and researchers. The programme has been created based on the experience of leading American and European universities, such as Stanford University (U.S.) and EPFL (Switzerland). Also taken into consideration when creating the faculty was the School of Data Analysis, which is one of the strongest postgraduate schools in the field of computer science in Russia. The wide range of elective courses will allow each student to create his or her own educational path. In the faculty, learning is based on practice and projects.
A. Baranov, Derkach D., Filatov A. et al.
Journal of Physics: Conference Series. 2017. Vol. 934. No. 1. P. 12050-12054.
Gelfand M. S., Kaznadzey А., Shelyakin P.
Biology Direct. 2017.
Gurvich V., Nhan Bao H.
Discrete Applied Mathematics. 2018.
Konushin A., Nikitin M., Konushin V.
Computer Optics. 2017.
Arzhantsev I., Romaskevich E.
Proceedings of the American Mathematical Society. 2017. Vol. 145. No. 5. P. 1865-1879.
Theory of Computing Systems. 2017. Vol. 61. No. 4. P. 1440-1450.
Faculty of Computer Science will host a series of public lectures on February 20 and 26.
17.00 – 17.55. Thibaut Le Gouic (Ecole Centrale de Marseille)
Barycenters in Wasserstein spaces
The Wasserstein barycenter of a set of probabilitycommunity. This talk will introduce some of the problems in machine learning in which this tool appear as a solution. Then, after a formal definition of this notion, we will state its basics properties and study its stability with respect to the set of probability measures of which the barycenter is taken.
19.00 – 19.55. Alexey Naumov (Skoltech/CS HSE)
Large ball probabilities with applications in statistical inference
Many statistical inference problems require estimating the Kolmogorov distance between probabilities of two Gaussian elements to hit a ball in a Hilbert space. In this talk, we derive the bounds which are dimensional-free and depend on the nuclear (Schatten-one) norm of the difference between the covariance operators of the elements. We are also interested in the anti-concentration bound for a squared norm of a non-centered Gaussian element in a Hilbert space. All bounds are sharp and cannot be improved in general. A list of corresponding motivation examples and applications in statistical inference will be provided as well. The talk is based on the recent results arXiv:1708.08663 and arXiv:1703.00871.
14.00 – 14.55. Navid Talebanfard (Czech Academy of Sciences)
Hard Instances for SAT algorithms
The Boolean satisfiability problem (SAT) is the problem of deciding whether there exists a truth assignment to a given formula which makes it true. Many non-trivial exponential time algorithms are known. However the precise complexity of SAT remains elusive. Exponential Time Hypothesis (ETH) and Strong ETH are formulated to describe the possible complexities. In this talk I will review some constructions showing that several known classes of algorithms cannot refute Strong ETH. I will then present several open questions in this direction.
15.00 – 15.55. Laurent Beaudou (Université Clermont Auvergne)
Betweenness, Convexity and LatticesIn this lecture, we try to follow a natural progression from the notion of betweenness to that of convexity. Doing so, we explore some de Bruijn-Erdos problems around lines in convexity spaces. We also deal with the use of convex subsets in the framework of lattices, and discuss a potential way to extend Day’s duplication theorem to non-convex sets. This lecture is intended for a broad audience and I will be mostly interested in introducing concepts and open questions around these topics.