@inproceedings{lazzaroni-etal-2026-relation,
title = "Relation-Specific Elicitation of a Base Model under a 32{B} Closed-Book Budget for {LM}-{KBC} 2026",
author = "Lazzaroni, Ruggero Marino and
Booker, Tim and
Soler Valad{\'e}s, Pau and
Angermaier, Mathias and
Solovev, Kirill",
editor = "Kalo, Jan-Christoph and
Nakashole, Ndapa and
Razniewski, Simon and
Suchanek, Fabian M. and
Vlachos, Andreas and
McCallum, Andrew",
booktitle = "Proceedings of the 11th Workshop on Automated Knowledge Base Construction ({AKBC} 2026)",
month = oct,
year = "2026",
address = "Budapest, Hungary",
publisher = "Association for Computational Linguistics",
url = "https://aclanthology.org/2026.akbc-1.45/",
pages = "560--571",
ISBN = "979-8-89176-464-4",
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.6975 global F1 on the official validation set, compared with 0.308 for the organiser baseline on validation. The largest per-relation gains over our earlier baseline configuration come from a company-listing prompt with explicit abstention and a log-stratified 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."
}<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="lazzaroni-etal-2026-relation">
<titleInfo>
<title>Relation-Specific Elicitation of a Base Model under a 32B Closed-Book Budget for LM-KBC 2026</title>
</titleInfo>
<name type="personal">
<namePart type="given">Ruggero</namePart>
<namePart type="given">Marino</namePart>
<namePart type="family">Lazzaroni</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Tim</namePart>
<namePart type="family">Booker</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Pau</namePart>
<namePart type="family">Soler Valadés</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Mathias</namePart>
<namePart type="family">Angermaier</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Kirill</namePart>
<namePart type="family">Solovev</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>2026-10</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026)</title>
</titleInfo>
<name type="personal">
<namePart type="given">Jan-Christoph</namePart>
<namePart type="family">Kalo</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Ndapa</namePart>
<namePart type="family">Nakashole</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Simon</namePart>
<namePart type="family">Razniewski</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Fabian</namePart>
<namePart type="given">M</namePart>
<namePart type="family">Suchanek</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Andreas</namePart>
<namePart type="family">Vlachos</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Andrew</namePart>
<namePart type="family">McCallum</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Association for Computational Linguistics</publisher>
<place>
<placeTerm type="text">Budapest, Hungary</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
<identifier type="isbn">979-8-89176-464-4</identifier>
</relatedItem>
<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.6975 global F1 on the official validation set, compared with 0.308 for the organiser baseline on validation. The largest per-relation gains over our earlier baseline configuration come from a company-listing prompt with explicit abstention and a log-stratified 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.</abstract>
<identifier type="citekey">lazzaroni-etal-2026-relation</identifier>
<location>
<url>https://aclanthology.org/2026.akbc-1.45/</url>
</location>
<part>
<date>2026-10</date>
<extent unit="page">
<start>560</start>
<end>571</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Relation-Specific Elicitation of a Base Model under a 32B Closed-Book Budget for LM-KBC 2026
%A Lazzaroni, Ruggero Marino
%A Booker, Tim
%A Soler Valadés, Pau
%A Angermaier, Mathias
%A Solovev, Kirill
%Y Kalo, Jan-Christoph
%Y Nakashole, Ndapa
%Y Razniewski, Simon
%Y Suchanek, Fabian M.
%Y Vlachos, Andreas
%Y McCallum, Andrew
%S Proceedings of the 11th Workshop on Automated Knowledge Base Construction (AKBC 2026)
%D 2026
%8 October
%I Association for Computational Linguistics
%C Budapest, Hungary
%@ 979-8-89176-464-4
%F lazzaroni-etal-2026-relation
%X 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.6975 global F1 on the official validation set, compared with 0.308 for the organiser baseline on validation. The largest per-relation gains over our earlier baseline configuration come from a company-listing prompt with explicit abstention and a log-stratified 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.
%U https://aclanthology.org/2026.akbc-1.45/
%P 560-571
Markdown (Informal)
[Relation-Specific Elicitation of a Base Model under a 32B Closed-Book Budget for LM-KBC 2026](https://aclanthology.org/2026.akbc-1.45/) (Lazzaroni et al., AKBC 2026)
ACL