arXiv — cs.AI preprintsInternational21 October 2026
The Instruction Tax on Factual Recall: Base Models Can Beat Their Instruction-Tuned Counterparts
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.28407v1 Announce Type: cross Abstract: We present our solution to the AKBC LM-KBC 2026 Shared Task, where we achieved a score of 0.6836 on the official leaderboard, more than double the baseline of 0.2964. This task requires generating all possible objects for subject-relation pairs using a language model with up to 32 billion parameters, with no retrieval or fine-tuning involved. We show that the prompting methodology is as important as the model architecture: while the instruction-tuned model version achieves 0.5681 with its chat interface, the base model achieves 0.6836 when prom
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- Navalia: Advancing Cowork Agents through Verifiable Task Synthesis and Long-Horizon Post-Training21 October 2026
- Large language model and reinforcement learning based autonomous construction and progress updates21 October 2026
- Pareto-Optimal RTL Code Generation via Multi-Objective Reinforcement Learning with Large Language Models21 October 2026
- MedPAO-Assist: Edge-Deployable, Modality-Aware Agentic AI for Radiology Report Structuring21 October 2026
- DataPraxis: Scaling Analytics Tasks via Verified Workspace Evolution21 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.