SpecSearch speeds up tree-search LLM reasoning by drafting thoughts with a small model, rejecting low-quality thoughts with a PRM-based threshold, and correcting them with a large model, achieving up to 2.12x speedup over token-level speculative decoding.
PaDeLLM-NER: Parallel Decoding in Large Language Models for Named Entity Recognition
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this study, we aim to reduce generation latency for Named Entity Recognition (NER) with Large Language Models (LLMs). The main cause of high latency in LLMs is the sequential decoding process, which autoregressively generates all labels and mentions for NER, significantly increase the sequence length. To this end, we introduce Parallel Decoding in LLM for NE} (PaDeLLM-NER), a approach that integrates seamlessly into existing generative model frameworks without necessitating additional modules or architectural modifications. PaDeLLM-NER allows for the simultaneous decoding of all mentions, thereby reducing generation latency. Experiments reveal that PaDeLLM-NER significantly increases inference speed that is 1.76 to 10.22 times faster than the autoregressive approach for both English and Chinese. Simultaneously it maintains the quality of predictions as evidenced by the performance that is on par with the state-of-the-art across various datasets.
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Accelerating Large Language Model Reasoning via Speculative Search
SpecSearch speeds up tree-search LLM reasoning by drafting thoughts with a small model, rejecting low-quality thoughts with a PRM-based threshold, and correcting them with a large model, achieving up to 2.12x speedup over token-level speculative decoding.