Relation-Specific Elicitation of a Base Model under a 32B Closed-Book Budget for LM-KBC 2026
Year: 2026
Type: conference-paper
Abstract: We describe a system for the LM-KBC 2026 shared task on closed-book knowledge base construction.Given a subject and relation, the system tries to predict all corresponding objects without retrieval or additional training and remains within the 32-billion-parameter limit.The system uses the base model gemma-4-31B with separate prompting and aggregation rules for six relations; few-shot demonstrations and selection thresholds come from the train set and are checked on the validation set.It obtains 0.6843 global F1 on the official validation set and 0.6961 on the official test set, compared with 0.308 for our run of the organisers' baseline on validation.The largest per-relation gains over our earlier baseline configuration come from a companylisting prompt with explicit abstention and a logstratified area prompt, plus a vote-share abstention threshold for empty-heavy relations (like personHasCityOfDeath) that recovers most of the empty-case precision.Across more than 30 prompting, verification, and aggregation configurations, further inference rarely recovers facts that are absent from the generated candidates.These results indicate that relation-specific elicitation improves closed-book extraction, while candidate coverage and selection remain the main limitations.Code, prompts, and configuration files are available at https://github. com/ruggsea/lmkbc2026-submission.
Institution: University of Graz
Language: English
Topic: Topic Modeling
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W7224436865