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

Giorgos Vernikos

dblp:275/3540 · also Giorgios Vernikos · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2024
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-author · 4 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
1 paper
Machine translation · 100%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Machine translation › machine translation evaluation
translation quality estimation
0.812024
Don't Rank, Combine! Combining Machine Translation Hypotheses Using Quality Estimation · ACL (1) 2024
Machine learning and data management
active learning
0.512021
Active Learning by Acquiring Contrastive Examples · EMNLP (1) 2021
Natural language and speech › Machine translation › neural machine translation
large language model translation
0.212024
Don't Rank, Combine! Combining Machine Translation Hypotheses Using Quality Estimation · ACL (1) 2024

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

reranking · 0.8minimum bayes risk decoding · 0.8uncertainty sampling · 0.5diversity sampling · 0.5contrastive learning · 0.5
YearPublicationVenuePosition
2024 Don't Rank, Combine! Combining Machine Translation Hypotheses Using Quality Estimation
abstract
Neural machine translation systems estimate probabilities of target sentences given source sentences, yet these estimates may not align with human preferences.This work introduces QE-fusion, a method that synthesizes translations using a quality estimation metric (QE), which correlates better with human judgments.QE-fusion leverages a pool of candidates sampled from a model and combines spans from different candidates using a QE metric such as COMETKIWI.We compare QE-fusion against beam search and recent reranking techniques, such as Minimum Bayes Risk decoding or QE-reranking.Our method consistently improves translation quality in terms of COMET and BLEURT scores when applied to large language models (LLMs) used for translation (PolyLM, XGLM, Llama2, Mistral, ALMA, and Tower) and to multilingual translation models (NLLB), over five language pairs.Notably, QE-fusion exhibits larger improvements for LLMs due to their ability to generate diverse outputs.We demonstrate that our approach generates novel translations in over half of the cases and consistently outperforms other methods across varying numbers of candidates .Furthermore, we empirically show that QE-fusion scales linearly with the number of candidates in the pool.
Giorgos Vernikos, Andrei Popescu-Belis
ACL (1)1
2024 Small Language Models Improve Giants by Rewriting Their Outputs
abstract
Giorgos Vernikos, Arthur Brazinskas, Jakub Adamek, Jonathan Mallinson, Aliaksei Severyn, Eric Malmi. Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.
Giorgos Vernikos, Arthur Brazinskas, Jakub Adámek, Jonathan Mallinson, Aliaksei Severyn, Eric Malmi
EACL (1)1
2023 Assessing the Importance of Frequency versus Compositionality for Subword-based Tokenization in NMT
abstract
Subword tokenization is the de-facto standard for tokenization in neural language models and machine translation systems. Three advantages are frequently put forward in favor of subwords: shorter encoding of frequent tokens, compositionality of subwords, and ability to deal with unknown words. As their relative importance is not entirely clear yet, we propose a tokenization approach that enables us to separate frequency (the first advantage) from compositionality, thanks to the use of Huffman coding, which tokenizes words using a fixed amount of symbols. Experiments with CS-DE, EN-FR and EN-DE NMT show that frequency alone accounts for approximately 90% of the BLEU scores reached by BPE, hence compositionality has less importance than previously thought.
Benoist Wolleb, Romain Silvestri, Giorgos Vernikos, Ljiljana Dolamic, Andrei Popescu-Belis
EAMT3
2021 Active Learning by Acquiring Contrastive Examples
abstract
Common acquisition functions for active learning use either uncertainty or diversity sampling, aiming to select difficult and diverse data points from the pool of unlabeled data, respectively.In this work, leveraging the best of both worlds, we propose an acquisition function that opts for selecting contrastive examples, i.e. data points that are similar in the model feature space and yet the model outputs maximally different predictive likelihoods.We compare our approach, CAL (Contrastive Active Learning), with a diverse set of acquisition functions in four natural language understanding tasks and seven datasets.Our experiments show that CAL performs consistently better or equal than the best performing baseline across all tasks, on both in-domain and out-of-domain data.We also conduct an extensive ablation study of our method and we further analyze all actively acquired datasets showing that CAL achieves a better trade-off between uncertainty and diversity compared to other strategies.
Aikaterini Margatina, Giorgos Vernikos, Loïc Barrault, Nikolaos Aletras
EMNLP (1)2