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

Yanjin He

dblp:413/7745 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · unresolved

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

Artificial intelligence and machine learning · 1 · 1 first-author · 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
1 paper
Language models and text generation · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
tokenization
0.912025
Pre-trained Models Perform the Best When Token Distributions Follow Zipf's Law · EMNLP 2025
Graph algorithms and graph theory › network analysis › complex networks › degree distribution
power-law distribution
0.312025
Pre-trained Models Perform the Best When Token Distributions Follow Zipf's Law · EMNLP 2025

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

zipf's law analysis · 1.7
YearPublicationVenuePosition
2025 Pre-trained Models Perform the Best When Token Distributions Follow Zipf's Law
abstract
Tokenization is a fundamental step in natural language processing (NLP) and other sequence modeling domains, where the choice of vocabulary size significantly impacts model performance.Despite its importance, selecting an optimal vocabulary size remains underexplored, typically relying on heuristics or dataset-specific choices.In this work, we propose a principled method for determining the vocabulary size by analyzing token frequency distributions through Zipf's law.We show that downstream task performance correlates with how closely token distributions follow powerlaw behavior, and that aligning with Zipfian scaling improves both model efficiency and effectiveness.Extensive experiments across NLP, genomics, and chemistry demonstrate that models consistently achieve peak performance when the token distribution closely adheres to Zipf's law, establishing Zipfian alignment as a robust and generalizable criterion for vocabulary size selection.
Yanjin He
EMNLP1