aiqbench analysis
This research introduces DIRECT, a framework designed to enhance the efficiency and alignment of large language models for sequence labeling tasks through training-time optimization and inference-time rectification. By leveraging Direct Preference Optimization (DPO) and a template-filling mechanism that utilizes KV Cache reuse, the method significantly reduces redundant computation while enforcing fixed output formats. The approach demonstrates measurable improvements in both performance metrics and computational speed across eight diverse datasets compared to existing methods.
DIRECT: Direct Decoding for Efficient and Aligned Sequence Labeling with Large Language Models
arXiv:2607.26891v1 Announce Type: new Abstract: Sequence labeling is a fine-grained information extraction task, yet existing large language model-based approaches suffer from insufficient domain alignment and low inference efficiency. To address these issues, we propose DIRECT, a framework that addresses these issues through training-time optimization and inference-time rectification. Specifically, DIRECT performs Direct Preference Optimization (DPO) after supervised fine-tuning to strengthen task alignment with human preferences, and introduces a controlled decoding process that enforces fixed output formats and restricts predictions to candidate sets. To further improve efficiency, a template-filling mechanism requires the model to generate only label tokens while reusing prefixed content through the KV Cache, thus reducing redundant computation. Experimental results on eight datasets demonstrate that DIRECT achieves significant improvements in both performance and efficiency compared to existing methods.
Abstract:Sequence labeling is a fine-grained information extraction task, yet existing large language model-based approaches suffer from insufficient domain alignment and low inference efficiency. To address these issues, we propose DIRECT, a framework that addresses these issues through training-time optimization and inference-time rectification. Specifically, DIRECT performs Direct Preference Optimization (DPO) after supervised fine-tuning to strengthen task alignment with human preferences, and introduces a controlled decoding process that enforces fixed output formats and restricts predictions to candidate sets. To further improve efficiency, a template-filling mechanism requires the model to generate only label tokens while reusing prefixed content through the KV Cache, thus reducing redundant computation. Experimental results on eight datasets demonstrate that DIRECT achieves significant improvements in both performance and efficiency compared to existing methods.
Computation and Language (cs.CL)
arXiv:2607.26891 [cs.CL]
(or arXiv:2607.26891v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2607.26891 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 218 words
Related coverage
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · Oct 8, 2026

Build Your Own Transaction Foundation Model for Financial Intelligence
NVIDIA · Jun 16, 2026
DeGRe: Dense-supervised Generative Reranking for Recommendation
arXiv · Sep 26, 2026
Direct Preference Optimization Beyond Chatbots
Hugging Face · Jun 3, 2026