Andrey Savchenko
2026
WeightLoRA: Keep Only Necessary Adapters
Andrey Veprikov | Vladimir Solodkin | Zyl Alexander | Andrey Savchenko | Aleksandr Beznosikov
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Andrey Veprikov | Vladimir Solodkin | Zyl Alexander | Andrey Savchenko | Aleksandr Beznosikov
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
The widespread utilization of language models in modern applications is inconceivable without Parameter-Efficient Fine-Tuning techniques, such as low-rank adaptation (LoRA), which adds trainable adapters to selected layers. Although LoRA may obtain accurate solutions, it requires significant memory to train large models and intuition on which layers to add adapters. In this paper, we propose a novel method, WeightLoRA, which overcomes this issue by adaptive selection of the most critical LoRA heads throughout the optimization process. As a result, we can significantly reduce the number of trainable parameters while maintaining the capability to obtain consistent or even superior metric values. We conduct experiments for a series of competitive benchmarks and DeBERTa, BART, Llama and Qwen models, comparing our method with different adaptive approaches. The experimental results demonstrate the efficacy of WeightLoRA and the superior performance of WeightLoRA+ in almost all cases. The source code is available at https://github.com/brain-lab-research/WLoRA
Anatomy of Unlearning: The Dual Impact of Fact Salience and Model Fine-Tuning
Anna Borisiuk | Andrey Savchenko | Alexander Panchenko | Elena Tutubalina
Findings of the Association for Computational Linguistics: ACL 2026
Anna Borisiuk | Andrey Savchenko | Alexander Panchenko | Elena Tutubalina
Findings of the Association for Computational Linguistics: ACL 2026
Machine Unlearning (MU) enables Large Language Models (LLMs) to remove unsafe or outdated information. However, existing work assumes that all facts are equally forgettable and largely ignores whether the forgotten knowledge originates from pretraining or supervised fine-tuning (SFT). In this paper, we introduce DUAL (Dual Unlearning Evaluation across Training Stages), a benchmark of 28.6k Wikidata-derived triplets annotated with fact popularity using Wikipedia link counts and LLM-based salience scores. Our experiments show that pretrained and SFT models respond differently to unlearning. An SFT step on the forget data yields smoother forgetting, more stable tuning, and 10–50% higher retention, while direct unlearning on pretrained models remains unstable and prone to relearning or catastrophic forgetting.
Hallucination Detection in LLMs with Topological Divergence on Attention Graphs
Alexandra Bazarova | Andrei Volodichev | Aleksandr Yugay | Andrey Shulga | Alina Ermilova | Konstantin Polev | Julia Belikova | Rauf Parchiev | Dmitry Simakov | Maxim Savchenko | Andrey Savchenko | Serguei Barannikov | Alexey Zaytsev
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Alexandra Bazarova | Andrei Volodichev | Aleksandr Yugay | Andrey Shulga | Alina Ermilova | Konstantin Polev | Julia Belikova | Rauf Parchiev | Dmitry Simakov | Maxim Savchenko | Andrey Savchenko | Serguei Barannikov | Alexey Zaytsev
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Hallucinations remain a critical challenge for large language models (LLMs), particularly in Retrieval-Augmented Generation (RAG) settings where models may generate outputs unsupported by the provided context. To address this, we introduce TOHA, a TOpology-based HAllucination detector, which leverages a topological divergence metric to quantify the structural properties of graphs induced by attention matrices. Examining the topological divergence between prompt and response subgraphs in RAG settings reveals consistent patterns: higher divergence values in specific attention heads correlate with unfaithful outputs, independent of the dataset. Extensive experiments — including evaluations on question answering and summarization tasks — show that our approach achieves state-of-the-art or competitive results on several benchmarks while requiring minimal annotated data and computational resources. Our findings indicate that the topological structure of attention matrices provides an efficient and robust metric for assessing the correctness of LLM’s responses.
2025
ATGen: A Framework for Active Text Generation
Akim Tsvigun | Daniil Vasilev | Ivan Tsvigun | Ivan Lysenko | Talgat Bektleuov | Aleksandr Medvedev | Uliana Vinogradova | Nikita Severin | Mikhail Mozikov | Andrey Savchenko | Ilya Makarov | Grigorev Rostislav | Ramil Kuleev | Fedor Zhdanov | Artem Shelmanov
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations)
Akim Tsvigun | Daniil Vasilev | Ivan Tsvigun | Ivan Lysenko | Talgat Bektleuov | Aleksandr Medvedev | Uliana Vinogradova | Nikita Severin | Mikhail Mozikov | Andrey Savchenko | Ilya Makarov | Grigorev Rostislav | Ramil Kuleev | Fedor Zhdanov | Artem Shelmanov
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations)
Active learning (AL) has demonstrated remarkable potential in reducing the annotation effort required for training machine learning models. However, despite the surging popularity of natural language generation (NLG) tasks in recent years, the application of AL to NLG has been limited. In this paper, we introduce Active Text Generation (ATGen) - a comprehensive framework that bridges AL with text generation tasks, enabling the application of state-of-the-art AL strategies to NLG. Our framework simplifies AL-empowered annotation in NLG tasks using both human annotators and automatic annotation agents based on large language models (LLMs). The framework supports LLMs deployed as a service, such as ChatGPT and Claude, or operated on-premises. Furthermore, ATGen provides a unified platform for smooth implementation and benchmarking of novel AL strategies tailored to NLG tasks. Finally, we present experimental results across multiple text generation tasks where we compare the performance of state-of-the-art AL strategies in various settings. We demonstrate that ATGen can reduce both the effort of human annotators and costs for API calls to automatic annotation agents based on LLMs.
LATTE: Learning Aligned Transactions and Textual Embeddings for Bank Clients
Egor Fadeev | Dzhambulat Mollaev | Aleksei Shestov | Dima Korolev | Omar Zoloev | Ivan A Kireev | Andrey Savchenko | Maksim Makarenko
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing: Industry Track
Egor Fadeev | Dzhambulat Mollaev | Aleksei Shestov | Dima Korolev | Omar Zoloev | Ivan A Kireev | Andrey Savchenko | Maksim Makarenko
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing: Industry Track
Learning clients embeddings from sequences of their historic communications is central to financial applications. While large language models (LLMs) offer general world knowledge, their direct use on long event sequences is computationally expensive and impractical in real-world pipelines. In this paper, we propose , a contrastive learning framework that aligns raw event embeddings with description-based semantic embeddings from frozen LLMs. Behavioral features based on statistical user descriptions are summarized into short prompts, embedded by the LLM, and used as supervision via contrastive loss. The proposed approach significantly reduces inference cost and input size compared to the conventional processing of complete sequences by LLM. We experimentally show that our method outperforms state-of-the-art techniques for learning event sequence representations on real-world financial datasets while remaining deployable in latency-sensitive environments.
MADD: Multi-Agent Drug Discovery Orchestra
Gleb Vitalevich Solovev | Alina Borisovna Zhidkovskaya | Anastasia Orlova | Nina Gubina | Anastasia Vepreva | Rodion Golovinskii | Ilya Tonkii | Ivan Dubrovsky | Ivan Gurev | Dmitry Gilemkhanov | Denis Chistiakov | Timur A. Aliev | Ivan Poddiakov | Galina Zubkova | Ekaterina V. Skorb | Vladimir Vinogradov | Alexander Boukhanovsky | Nikolay Nikitin | Andrei Dmitrenko | Anna Kalyuzhnaya | Andrey Savchenko
Findings of the Association for Computational Linguistics: EMNLP 2025
Gleb Vitalevich Solovev | Alina Borisovna Zhidkovskaya | Anastasia Orlova | Nina Gubina | Anastasia Vepreva | Rodion Golovinskii | Ilya Tonkii | Ivan Dubrovsky | Ivan Gurev | Dmitry Gilemkhanov | Denis Chistiakov | Timur A. Aliev | Ivan Poddiakov | Galina Zubkova | Ekaterina V. Skorb | Vladimir Vinogradov | Alexander Boukhanovsky | Nikolay Nikitin | Andrei Dmitrenko | Anna Kalyuzhnaya | Andrey Savchenko
Findings of the Association for Computational Linguistics: EMNLP 2025
Hit identification is a central challenge in early drug discovery, traditionally requiring substantial experimental resources. Recent advances in artificial intelligence, particularly large language models (LLMs), have enabled virtual screening methods that reduce costs and improve efficiency. However, the growing complexity of these tools has limited their accessibility to wet-lab researchers. Multi-agent systems offer a promising solution by combining the interpretability of LLMs with the precision of specialized models and tools. In this work, we present MADD, a multi-agent system that builds and executes customized hit identification pipelines from natural language queries. MADD employs four coordinated agents to handle key subtasks in de novo compound generation and screening. We evaluate MADD across seven drug discovery cases and demonstrate its superior performance compared to existing LLM-based solutions. Using MADD, we pioneer application of AI-first drug design to five biological targets and release the identified hit molecules. Finally, we introduce a new benchmark of query-molecule pairs and docking scores for over three million compounds to contribute to the agentic future of drug design.
3MDBench: Medical Multimodal Multi-agent Dialogue Benchmark
Ivan Sviridov | Amina Miftakhova | Artemiy Tereshchenko | Galina Zubkova | Pavel Blinov | Andrey Savchenko
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Ivan Sviridov | Amina Miftakhova | Artemiy Tereshchenko | Galina Zubkova | Pavel Blinov | Andrey Savchenko
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Though Large Vision-Language Models (LVLMs) are being actively explored in medicine, their ability to conduct complex real-world telemedicine consultations combining accurate diagnosis with professional dialogue remains underexplored. This paper presents 3MDBench (Medical Multimodal Multi-agent Dialogue Benchmark), an open-source framework for simulating and evaluating LVLM-driven telemedical consultations. 3MDBench simulates patient variability through temperament-based Patient Agent and evaluates diagnostic accuracy and dialogue quality via Assessor Agent. It includes 2996 cases across 34 diagnoses from real-world telemedicine interactions, combining textual and image-based data. The experimental study compares diagnostic strategies for widely used open and closed-source LVLMs. We demonstrate that multimodal dialogue with internal reasoning improves F1 score by 6.5% over non-dialogue settings, highlighting the importance of context-aware, information-seeking questioning. Moreover, injecting predictions from a diagnostic convolutional neural network into the LVLM’s context boosts F1 by up to 20%. Source code is available at https://github.com/univanxx/3mdbench.
2024
Leveraging Summarization for Unsupervised Dialogue Topic Segmentation
Aleksei Artemiev | Daniil Parinov | Alexey Grishanov | Ivan Borisov | Alexey Vasilev | Daniil Muravetskii | Aleksey Rezvykh | Aleksei Goncharov | Andrey Savchenko
Findings of the Association for Computational Linguistics: NAACL 2024
Aleksei Artemiev | Daniil Parinov | Alexey Grishanov | Ivan Borisov | Alexey Vasilev | Daniil Muravetskii | Aleksey Rezvykh | Aleksei Goncharov | Andrey Savchenko
Findings of the Association for Computational Linguistics: NAACL 2024
Traditional approaches to dialogue segmentation perform reasonably well on synthetic or written dialogues but suffer when dealing with spoken, noisy dialogs. In addition, such methods require careful tuning of hyperparameters. We propose to leverage a novel approach that is based on dialogue summaries. Experiments on different datasets showed that the new approach outperforms popular state-of-the-art algorithms in unsupervised topic segmentation and requires less setup.
Lost in Translation: Chemical Language Models and the Misunderstanding of Molecule Structures
Veronika Ganeeva | Andrey Sakhovskiy | Kuzma Khrabrov | Andrey Savchenko | Artur Kadurin | Elena Tutubalina
Findings of the Association for Computational Linguistics: EMNLP 2024
Veronika Ganeeva | Andrey Sakhovskiy | Kuzma Khrabrov | Andrey Savchenko | Artur Kadurin | Elena Tutubalina
Findings of the Association for Computational Linguistics: EMNLP 2024
The recent integration of chemistry with natural language processing (NLP) has advanced drug discovery. Molecule representation in language models (LMs) is crucial in enhancing chemical understanding. We propose Augmented Molecular Retrieval (AMORE), a flexible zero-shot framework for assessment of Chemistry LMs of different natures: trained solely on molecules for chemical tasks and on a combined corpus of natural language texts and string-based structures. The framework relies on molecule augmentations that preserve an underlying chemical, such as kekulization and cycle replacements. We evaluate encoder-only and generative LMs by calculating a metric based on the similarity score between distributed representations of molecules and their augmentations. Our experiments on ChEBI-20 and QM9 benchmarks show that these models exhibit significantly lower scores than graph-based molecular models trained without language modeling objectives. Additionally, our results on the molecule captioning task for cross-domain models, MolT5 and Text+Chem T5, demonstrate that the lower the representation-based evaluation metrics, the lower the classical text generation metrics like ROUGE and METEOR.
2020
Ad Lingua: Text Classification Improves Symbolism Prediction in Image Advertisements
Andrey Savchenko | Anton Alekseev | Sejeong Kwon | Elena Tutubalina | Evgeny Myasnikov | Sergey Nikolenko
Proceedings of the 28th International Conference on Computational Linguistics
Andrey Savchenko | Anton Alekseev | Sejeong Kwon | Elena Tutubalina | Evgeny Myasnikov | Sergey Nikolenko
Proceedings of the 28th International Conference on Computational Linguistics
Understanding image advertisements is a challenging task, often requiring non-literal interpretation. We argue that standard image-based predictions are insufficient for symbolism prediction. Following the intuition that texts and images are complementary in advertising, we introduce a multimodal ensemble of a state of the art image-based classifier, a classifier based on an object detection architecture, and a fine-tuned language model applied to texts extracted from ads by OCR. The resulting system establishes a new state of the art in symbolism prediction.
Search
Fix author
Co-authors
- Elena Tutubalina 3
- Galina Zubkova 2
- Anton Alekseev 1
- Zyl Alexander 1
- Timur A. Aliev 1
- Aleksei Artemiev 1
- Serguei Barannikov 1
- Alexandra Bazarova 1
- Talgat Bektleuov 1
- Julia Belikova 1
- Aleksandr Beznosikov 1
- Pavel Blinov 1
- Anna Borisiuk 1
- Ivan Borisov 1
- Alexander Boukhanovsky 1
- Denis Chistiakov 1
- Andrei Dmitrenko 1
- Ivan Dubrovsky 1
- Alina Ermilova 1
- Egor Fadeev 1
- Veronika Ganeeva 1
- Dmitry Gilemkhanov 1
- Rodion Golovinskii 1
- Aleksei Goncharov 1
- Alexey Grishanov 1
- Nina Gubina 1
- Ivan Gurev 1
- Artur Kadurin 1
- Anna Kalyuzhnaya 1
- Kuzma Khrabrov 1
- Ivan A Kireev 1
- Dima Korolev 1
- Ramil Kuleev 1
- Sejeong Kwon 1
- Ivan Lysenko 1
- Maksim Makarenko 1
- Ilya Makarov 1
- Aleksandr Medvedev 1
- Amina Miftakhova 1
- Dzhambulat Mollaev 1
- Mikhail Mozikov 1
- Daniil Muravetskii 1
- Evgeny Myasnikov 1
- Nikolay Nikitin 1
- Sergey Nikolenko 1
- Anastasia Orlova 1
- Alexander Panchenko 1
- Rauf Parchiev 1
- Daniil Parinov 1
- Ivan Poddiakov 1
- Konstantin Polev 1
- Aleksey Rezvykh 1
- Grigorev Rostislav 1
- Andrey Sakhovskiy 1
- Maxim Savchenko 1
- Nikita Severin 1
- Artem Shelmanov 1
- Aleksei Shestov 1
- Andrey Shulga 1
- Dmitry Simakov 1
- Ekaterina V. Skorb 1
- Vladimir Solodkin 1
- Gleb Vitalevich Solovev 1
- Ivan Sviridov 1
- Artemiy Tereshchenko 1
- Ilya Tonkii 1
- Akim Tsvigun 1
- Ivan Tsvigun 1
- Daniil Vasilev 1
- Alexey Vasilev 1
- Anastasia Vepreva 1
- Andrey Veprikov 1
- Vladimir Vinogradov 1
- Uliana Vinogradova 1
- Andrei Volodichev 1
- Aleksandr Yugay 1
- Alexey Zaytsev 1
- Fedor Zhdanov 1
- Alina Borisovna Zhidkovskaya 1
- Omar Zoloev 1