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

Yichen You

dblp:408/7492 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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
1 paper
Efficient and distributed learning · 75% Language models and text generation · 25%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
inference efficiency
0.912025
R2R: Efficiently Navigating Divergent Reasoning Paths with Small-Large Model Token Routing · NeurIPS 2025
Natural language and speech › Language models and text generation › large language model
reasoning model
0.912025
R2R: Efficiently Navigating Divergent Reasoning Paths with Small-Large Model Token Routing · NeurIPS 2025
Machine learning › Efficient and distributed learning › collaborative learning › model collaboration
small-large model collaboration
0.912025
R2R: Efficiently Navigating Divergent Reasoning Paths with Small-Large Model Token Routing · NeurIPS 2025
Machine learning › Efficient and distributed learning › dynamic neural network
token routing
0.912025
R2R: Efficiently Navigating Divergent Reasoning Paths with Small-Large Model Token Routing · NeurIPS 2025

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

neural token router · 0.9knowledge distillation · 0.9
YearPublicationVenuePosition
2025 R2R: Efficiently Navigating Divergent Reasoning Paths with Small-Large Model Token Routing
abstract
Large Language Models (LLMs) achieve impressive reasoning capabilities at the cost of substantial inference overhead, posing substantial deployment challenges. Although distilled Small Language Models (SLMs) significantly enhance efficiency, their performance suffers as they fail to follow LLMs' reasoning paths. Luckily, we reveal that only a small fraction of tokens genuinely diverge reasoning paths between LLMs and SLMs. Most generated tokens are either identical or exhibit neutral differences, such as minor variations in abbreviations or expressions. Leveraging this insight, we introduce **Roads to Rome (R2R)**, a neural token router that selectively utilizes LLMs only for these critical, path-divergent tokens, while leaving the majority of token generation to the SLM. We also develop an automatic data generation pipeline that identifies divergent tokens and generates token-level routing labels to train the lightweight router. We apply R2R to combine R1-1.5B and R1-32B models from the DeepSeek family, and evaluate on challenging math, coding, and QA benchmarks. With an average activated parameter size of 5.6B, R2R surpasses the average accuracy of R1-7B by 1.6×, outperforming even the R1-14B model. Compared to R1-32B, it delivers a 2.8× wall-clock speedup with comparable performance, advancing the Pareto frontier of test-time scaling efficiency.
Tianyu Fu 0004, Yi Ge, Yichen You, Enshu Liu, Zhihang Yuan, Guohao Dai 0001, Shengen Yan, Huazhong Yang, Yu Wang 0002
NeurIPS3