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

Julius Cheng

dblp:291/3621 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-author · 3 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
Language models and text generation · 67% Machine translation · 33%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
decoding
0.712023
Faster Minimum Bayes Risk Decoding with Confidence-based Pruning · EMNLP 2023
Natural language and speech › Language models and text generation › decoding
minimum bayes risk decoding
0.712023
Faster Minimum Bayes Risk Decoding with Confidence-based Pruning · EMNLP 2023
Natural language and speech › Machine translation
neural machine translation
0.712023
Faster Minimum Bayes Risk Decoding with Confidence-based Pruning · EMNLP 2023

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

confidence-based pruning · 0.7bootstrap sampling · 0.7
YearPublicationVenuePosition
2025 A Bayesian Optimization Approach to Machine Translation Reranking
abstract
Julius Cheng, Maike Züfle, Vilém Zouhar, Andreas Vlachos. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025.
Julius Cheng, Maike Züfle, Vilém Zouhar, Andreas Vlachos 0001
NAACL (Long Papers)1
2024 Measuring Uncertainty in Neural Machine Translation with Similarity-Sensitive Entropy
abstract
Uncertainty estimation is an important diagnostic tool for statistical models, and is often used to assess the confidence of model predictions.Previous work shows that neural machine translation (NMT) is an intrinsically uncertain task where there are often multiple correct and semantically equivalent translations, and that well-trained NMT models produce good translations despite spreading probability mass among many semantically similar translations.These findings suggest that popular measures of uncertainty based on token-and sequencelevel entropies which measure surface form diversity may not be good proxies of the more useful quantity of interest, semantic diversity.We propose to adapt similarity-sensitive Shannon entropy (S3E), a concept borrowed from theoretical ecology, for NMT.By demonstrating significantly improved correlation between S3E and task performance on quality estimation and named entity recall, we show that S3E is a useful framework for measuring uncertainty in NMT.
Julius Cheng, Andreas Vlachos 0001
EACL (1)1
2023 Faster Minimum Bayes Risk Decoding with Confidence-based Pruning
abstract
Minimum Bayes risk (MBR) decoding outputs the hypothesis with the highest expected utility over the model distribution for some utility function.It has been shown to improve accuracy over beam search in conditional language generation problems and especially neural machine translation, in both human and automatic evaluations.However, the standard samplingbased algorithm for MBR is substantially more computationally expensive than beam search, requiring a large number of samples as well as a quadratic number of calls to the utility function, limiting its applicability.We describe an algorithm for MBR which gradually grows the number of samples used to estimate the utility while pruning hypotheses that are unlikely to have the highest utility according to confidence estimates obtained with bootstrap sampling.Our method requires fewer samples and drastically reduces the number of calls to the utility function compared to standard MBR while being statistically indistinguishable in terms of accuracy.We demonstrate the effectiveness of our approach in experiments on three language pairs, using chrF++ and COMET as utility/evaluation metrics.
Julius Cheng, Andreas Vlachos 0001
EMNLP1