• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Dean — Ivan Arzhantsev


First Deputy Dean — Tamara Voznesenskaya


Deputy Dean for Research and International Relations — Sergei Obiedkov


Deputy Dean for Methodical and Educational Work — Ilya Samonenko


Deputy Dean for Development, Finance and Administration — Irina Plisetskaya

Phone: +7 (495) 772-95-90 * 12332


125319, Moscow, 3 Kochnovsky Proezd (near metro station 'Aeroport'). 

Linear switched dynamical systems on graphs
In press

Protasov V. Y., Cicone A., Guglielmi N.

Nonlinear Analysis: Hybrid Systems. 2018. Vol. 29. P. 165-186.

Final Results of the OPERA Experiment on ντ Appearance in the CNGS Neutrino Beam

Ustyuzhanin A.

Physical Review Letters. 2018. Vol. 120. No. 21. P. 211801-1-211801-7.

Qualitative Judgement of Research Impact: Domain Taxonomy as a Fundamental Framework for Judgement of the Quality of Research

Murtagh F., Orlov M. A., Mirkin B.

Journal of Classification. 2018. Vol. 35. No. 1. P. 5-28.

Predictive Model for the Bottomhole Pressure based on Machine Learning

Spesivtsev P., Sinkov K., Sofronov I. et al.

Journal of Petroleum Science and Engineering. 2018. No. 166. P. 825-841.

New and old results on spherical varieties via moduli theory

Roman Avdeev, Cupit-Foutou S.

Advances in Mathematics. 2018. Vol. 328. P. 1299-1352.

Open Lectures of the Faculty of Computer Science

Event ended

Faculty of Computer Science will host a series of public lectures on February 20 and 26.


February 20, room 400

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.

February 26, room 317

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 Lattices
In 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.