Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrey Bout

dblp:225/1448 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2023
0009-0007-8786-2269ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Language models and text generation · 46% Question answering and dialogue systems · 23% Learning paradigms · 15%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › text generation
grammatical error correction
1.322023
Efficient Grammatical Error Correction Via Multi-Task Training and Optimized Training Schedule · EMNLP 2023
GEC-DePenD: Non-Autoregressive Grammatical Error Correction with Decoupled Permutation and Decoding · ACL (1) 2023
Machine learning › Learning paradigms
multi-task learning
0.712023
Efficient Grammatical Error Correction Via Multi-Task Training and Optimized Training Schedule · EMNLP 2023
Natural language and speech › Language models and text generation › decoding
non-autoregressive decoding
0.712023
GEC-DePenD: Non-Autoregressive Grammatical Error Correction with Decoupled Permutation and Decoding · ACL (1) 2023
Information retrieval › cross-modal retrieval
image-text retrieval
0.712023
Sinkhorn Transformations for Single-Query Postprocessing in Text-Video Retrieval · SIGIR 2023
Information retrieval
multimodal retrieval
0.712023
Sinkhorn Transformations for Single-Query Postprocessing in Text-Video Retrieval · SIGIR 2023
Natural language and speech › Question answering and dialogue systems
intent detection
0.512021
Revisiting Mahalanobis Distance for Transformer-Based Out-of-Domain Detection · AAAI 2021
Natural language and speech › Question answering and dialogue systems › intent detection
out-of-domain detection
0.512021
Revisiting Mahalanobis Distance for Transformer-Based Out-of-Domain Detection · AAAI 2021
Machine learning › Deep learning architectures and training
transformer
0.512021
Revisiting Mahalanobis Distance for Transformer-Based Out-of-Domain Detection · AAAI 2021
Machine learning › Probabilistic and Bayesian machine learning › structured prediction › ranking model
permutation models
0.212023
GEC-DePenD: Non-Autoregressive Grammatical Error Correction with Decoupled Permutation and Decoding · ACL (1) 2023

Methods — techniques the papers use, named apart from their topics

synthetic data pretraining · 0.7sinkhorn transformations · 0.7sequence-to-sequence · 0.7non-autoregressive decoding · 0.7multi-task training · 0.7dual-softmax loss · 0.7decoupled permutation · 0.7transformer fine-tuning · 0.5mahalanobis distance · 0.5
YearPublicationVenuePosition
2023 GEC-DePenD: Non-Autoregressive Grammatical Error Correction with Decoupled Permutation and Decoding
abstract
Konstantin Yakovlev, Alexander Podolskiy, Andrey Bout, Sergey Nikolenko, Irina Piontkovskaya. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2023.
Konstantin Yakovlev, Alexander Podolskiy, Andrey Bout, Sergey I. Nikolenko, Irina Piontkovskaya
ACL (1)3
2023 Efficient Grammatical Error Correction Via Multi-Task Training and Optimized Training Schedule
abstract
Progress in neural grammatical error correction (GEC) is hindered by the lack of annotated training data.Sufficient amounts of highquality manually annotated data are not available, so recent research has relied on generating synthetic data, pretraining on it, and then finetuning on real datasets; performance gains have been achieved either by ensembling or by using huge pretrained models such as XXL-T5 as the backbone.In this work, we explore an orthogonal direction: how to use available data more efficiently.First, we propose auxiliary tasks that exploit the alignment between the original and corrected sentences, such as predicting a sequence of corrections.We formulate each task as a sequence-to-sequence problem and perform multi-task training.Second, we discover that the order of datasets used for training and even individual instances within a dataset may have important effects on the final performance, so we set out to find the best training schedule.Together, these two ideas lead to significant improvements, producing results that improve state of the art with much smaller models; in particular, we outperform the best models based on T5-XXL (11B parameters) with a BART-based model (400M parameters).
Andrey Bout, Alexander Podolskiy, Sergey I. Nikolenko, Irina Piontkovskaya
EMNLP1
2023 Sinkhorn Transformations for Single-Query Postprocessing in Text-Video Retrieval
abstract
A recent trend in multimodal retrieval is related to postprocessing test set results via the dual-softmax loss (DSL). While this approach can bring significant improvements, it usually presumes that an entire matrix of test samples is available as DSL input. This work introduces a new postprocessing approach based on Sinkhorn transformations that outperforms DSL. Further, we propose a new postprocessing setting that does not require access to multiple test queries. We show that our approach can significantly improve the results of state of the art models such as CLIP4Clip, BLIP, X-CLIP, and DRL, thus achieving a new state-of-the-art on several standard text-video retrieval datasets both with access to the entire test set and in the single-query setting.
Konstantin Yakovlev, Gregory Polyakov, Ilseyar Alimova, Alexander Podolskiy, Andrey Bout, Sergey I. Nikolenko, Irina Piontkovskaya
SIGIR5
2021 Revisiting Mahalanobis Distance for Transformer-Based Out-of-Domain Detection
abstract
Real-life applications, heavily relying on machine learning, such as dialog systems, demand for out-of-domain detection methods. Intent classification models should be equipped with a mechanism to distinguish seen intents from unseen ones so that the dialog agent is capable of rejecting the latter and avoiding undesired behavior. However, despite increasing attention paid to the task, the best practices for out-of-domain intent detection have not yet been fully established. This paper conducts a thorough comparison of out-of-domain intent detection methods. We prioritize the methods, not requiring access to out-of-domain data during training, gathering of which is extremely time- and labor-consuming due to lexical and stylistic variation of user utterances. We evaluate multiple contextual encoders and methods, proven to be efficient, on three common datasets for intent classification, expanded with out-of-domain utterances. Our main findings show that fine-tuning Transformer-based encoders on in-domain data leads to superior results. Mahalanobis distance, together with utterance representations, derived from Transformer-based encoders, outperform other methods by a wide margin(1-5% in terms of AUROC) and establish new state-of-the-art results for all datasets. The broader analysis shows that the reason for success lies in the fact that the fine-tuned Transformer is capable of constructing homogeneous representations of in-domain utterances, revealing geometrical disparity to out of domain utterances. In turn, the Mahalanobis distance captures this disparity easily.
Alexander Podolskiy, Dmitry Lipin, Andrey Bout, Ekaterina Artemova, Irina Piontkovskaya
AAAI3
2021 Single Example Can Improve Zero-Shot Data Generation
abstract
Sub-tasks of intent classification, such as robustness to distribution shift, adaptation to specific user groups and personalization, out-ofdomain detection, require extensive and flexible datasets for experiments and evaluation.As collecting such datasets is time-and laborconsuming, we propose to use text generation methods to gather datasets.The generator should be trained to generate utterances that belong to the given intent.We explore two approaches to generating task-oriented utterances.In the zero-shot approach, the model is trained to generate utterances from seen intents and is further used to generate utterances for intents unseen during training.In the oneshot approach, the model is presented with a single utterance from a test intent.We perform a thorough automatic, and human evaluation of the dataset generated utilizing two proposed approaches.Our results reveal that the attributes of the generated data are close to original test sets, collected via crowd-sourcing.
Pavel Burnyshev, Valentin Malykh, Andrey Bout, Ekaterina Artemova, Irina Piontkovskaya
INLG3