Reliable tool use requires more than triggering a mechanism or matching a query to an API description. Before selecting a specific tool, an agent must first infer the capability requirements implied by the user query. In this paper, we investigate whether these query-side capability requirements are linearly decodable...
Kyo-Nam Choo, Mi-Ra Song, Yun-Ju Kang et al.· 0 citations
FACET, the authors' reference-free submission to the WMT26 Automated Translation Quality Evaluation Task, is presented, which decomposes evaluation into Fluency, Accuracy, and Consistency passes and gives each pass only the context its error type requires.
Ahrii Kim, Chanjun Park, Seong-heum Kim· 0 citations
Directional verification mitigates the transfer of errors from teacher-generated answers to students by providing more accurate training targets, and introduces directional label distillation, in which frozen teachers score candidate answers in that known direction and the best-scoring candidate becomes the student's t...
Jungseob Lee, Sugyeong Eo, Seongtae Hong et al.· 0 citations
Block drafters for speculative decoding are commonly trained on corpora written by external models, where a single off-policy token invalidates supervision for all subsequent slots in a block. Existing approaches discard these divergent slots, resulting in severe supervision loss. To resolve this problem while preservi...
Jungseob Lee, Chanjun Park, Sugyeong Eo et al.· 1 citation
PriceCheck is introduced, which builds a compact family of decision rules from label-free checks such as re-solving a problem, and shows that choosing how checks are combined and stopped matters alongside how well a verifier ranks answers.
D. Lee, Jungseob Lee, Chanjun Park et al.· 2 citations
Redline is a finite-sample procedure that selects operating points, hand-picked or learned, from the correctness of their answers on calibration prompts, and keeps the reference-relative risk, the joint probability that the reference answers correctly and a candidate configuration does not, within a user-chosen budget...
Jungseob Lee, D. Lee, Chanjun Park et al.· 1 citation
Client-Resolved Generation (CRG), a genera- tion interface that separates server-side generation from the lexical realization of input-derived content, is introduced, which provides a practical interface for privacy-sensitive cloud LLMs by reducing plaintext exposure across both input and output pathways while preserv-...
Jeongho Yoon, Chanhee Park, Yong-Chan Chun et al.· 0 citations
A counterfactual condition (MIX) is test with a counterfactual condition (MIX) in which each document combines segments drawn from different systems, preserving document-level presentation while breaking cross-segment consistency.
Ahrii Kim, Vilém Zouhar, Chanjun Park et al.· 0 citations
This work argues that one meaningful and currently unmeasured axis is referential reach, the distance a segment must look back into its document to resolve the entities and pronouns it contains, and formalizes this as discourse dependency (DDP), a metric-free, source-side measure computed from named entity re-mentions...
Ahrii Kim, Chanjun Park, Seong-heum Kim· 0 citations
It is demonstrated that aggregate averages can create a misleading illusion of tool-use proficiency, whereas RAE directly measures whether the retrieval-to-answer pipeline genuinely rescues more outcomes than it harms.
GLANCE is presented, the first one-pass block drafter that is lossless on an unmodified VLM target, and it breaks the cycle at both ends of a self-defeating cycle.
Jungseob Lee, Seongtae Hong, D. Lee et al.· 0 citations
DART is introduced, a training-free routing framework that samples two cheap no-think drafts, accepts direct answering when the drafts agree, and predicts a thinking budget from draft entropy when they disagree, and preserves or improves always-thinking accuracy in most settings while reducing thinking-token use.
Jungseob Lee, Seongtae Hong, Seungjun Lee et al.· arXiv.org· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.