Demo Data from VLDB 2026 / reviewers in the wild / expert
Jiaxi Bi
dblp:408/0008
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none
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 · 50% Efficient and distributed learning · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
inference efficiency |
1.0 | 1 | 2026 | Cut Your Losses! Learning to Prune Paths Early for Efficient Parallel Reasoning · ACL (1) 2026 |
Natural language and speech › Language models and text generation › large language model
large reasoning model |
1.0 | 1 | 2026 | Cut Your Losses! Learning to Prune Paths Early for Efficient Parallel Reasoning · ACL (1) 2026 |
Methods — techniques the papers use, named apart from their topics
token-level pruning · 1.0reinforcement learning · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Cut Your Losses! Learning to Prune Paths Early for Efficient Parallel ReasoningabstractParallel reasoning enhances Large Reasoning Models (LRMs) but incurs prohibitive costs due to futile paths caused by early errors.To mitigate this, path pruning at the prefix level is essential, yet existing research remains fragmented without a standardized framework.In this work, we propose the first systematic taxonomy of path pruning, categorizing methods by their signal source (internal vs. external) and learnability (learnable vs. non-learnable).This classification reveals the unexplored potential of learnable internal methods, motivating our proposal of STOP (Super TOken for Pruning).Extensive evaluations across LRMs ranging from 1.5B to 20B parameters demonstrate that STOP achieves superior effectiveness and efficiency compared to existing baselines.Furthermore, we rigorously validate the scalability of STOP under varying compute budgets-for instance, boosting GPT-OSS-20B accuracy on AIME25 from 84% to nearly 90% under fixed compute budgets.Finally, we distill our findings into formalized empirical guidelines to facilitate optimal real-world deployment.Code, data and models are available at https://bijiaxihh.github.io/STOP. Jiaxi Bi, Tongxu Luo, Wenyu Du, Zhengyang Tang, Benyou Wang |
ACL (1) | 1 |