Machine Learning 2. Lecture 4. Attention Models and Transformers
2026LectureКонстантин Вячеславович Воронцов
54 results
2026·Lecture·Константин Вячеславович Воронцов
2024·Conference paper·Gleb Skiba, Mikhail Pukemo, Dmitry Melikhov, Konstantin Vorontsov
2020·Journal article·Anastasia Ianina, Konstantin Vorontsov
International Journal of Embedded and Real-Time Communication Systems
2022·Journal article·N. A. Gerasimenko, A. S. Chernyavsky, M. A. Nikiforova, M. D. Nikitin +1
Doklady Mathematics
With a soaring number of scientific publications and rapid emergence of new directions and approaches, the scientific community faces the task of timely identification of trends. By a trend, we mean a semantically homogeneous topic characterized by a steady lexical kernel and a sharp, often exponential increase in the number of publications [1]. Examples of trends in machine learning are “LSTM,” “deep learning,” “word2vec,” “BERT,” and “fake news detection.” For real-time detection of trend topics from a stream of scientific publications, we use incremental methods of probabilistic topic modeling. An ARTM-based approach to early trend detection has been shown to outperform popular classical and neural network approaches to this task. A dataset of 91 trends for performance evaluation has been manually collected and made available for public use.
2023·Conference paper·Nikolai Gerasimenko, Alexander Chernyavskiy, Maria Nikiforova, Anastasia Ianina +1
Computational Linguistics and Intellectual Technologies
2024·Preprint·Gorbulev, Alex, Alekseev, Vasiliy, Vorontsov, Konstantin
arXiv (Cornell University)
2026·Other·Bogdan Zavyalov
2026·Theory·Sean Cotner
2013·Conference paper·Anna Potapenko, Konstantin Vorontsov
Lecture notes in computer science
2017·Conference paper·Anna Potapenko, Artem Popov, Konstantin Vorontsov
Communications in computer and information science
2017·Preprint·Potapenko, Anna, Popov, Artem, Vorontsov, Konstantin
arXiv (Cornell University)
We consider probabilistic topic models and more recent word embedding\ntechniques from a perspective of learning hidden semantic representations.\nInspired by a striking similarity of the two approaches, we merge them and\nlearn probabilistic embeddings with online EM-algorithm on word co-occurrence\ndata. The resulting embeddings perform on par with Skip-Gram Negative Sampling\n(SGNS) on word similarity tasks and benefit in the interpretability of the\ncomponents. Next, we learn probabilistic document embeddings that outperform\nparagraph2vec on a document similarity task and require less memory and time\nfor training. Finally, we employ multimodal Additive Regularization of Topic\nModels (ARTM) to obtain a high sparsity and learn embeddings for other\nmodalities, such as timestamps and categories. We observe further improvement\nof word similarity performance and meaningful inter-modality similarities.\n
2026·Theory·Sean Cotner
Two pathological phenomena for algebraic groups over general bases — a group degenerating between the multiplicative and additive group across a DVR, and a non-affine identity component — built as centralizers in SL_n.
2022·Conference paper·Alexey Grishanov, Anastasia Ianina, Konstantin Vorontsov
2022·Journal article·N. A. Skachkov, K. V. Vorontsov
Automation and Remote Control
2010·Journal article·K. V. Vorontsov
Pattern Recognition and Image Analysis
2016·Journal article·Murat Apishev, Sergei Koltcov, Olessia Koltsova, Sergey Nikolenko +1
Computación y Sistemas
2012·Journal article·Konstantin Vyacheslavovich Vorontsov, Anna Alexandrovna Potapenko
Computer Research and Modeling
2019·Conference paper·Anastasia Ianina, Konstantin Vorontsov
2019·Conference paper·Evgeny Egorov, Filipp Nikitin, Vasiliy Alekseev, Alexey Goncharov +1
2020·Conference paper·D. G. Feldman, T. R. Sadekova, K. V. Vorontsov
Computational Linguistics and Intellectual Technologies