Indrajit Bhattacharya, Prayushi Faldu
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
An essential requirement for a real-world Knowledge Base Question Answering (KBQA) system is the ability to detect answerability of questions when generating logical forms. However, state-of-the-art KBQA models assume all questions to be answerable. Recent research has found that such models, when superficially adapted to detect answerability, struggle to satisfactorily identify the different categories of unanswerable questions, and simultaneously preserve good performance for answerable questions. Towards addressing this issue, we propose RetinaQA, a new KBQA model that unifies two key ideas in a single KBQA architecture: (a) discrimination over candidate logical forms, rather than generating these, for handling schema-related unanswerability, and (b) sketch-filling-based construction of candidate logical forms for handling data-related unaswerability. Our results show that RetinaQA significantly outperforms adaptations of state-of-the-art KBQA models in handling both answerable and unanswerable questions and demonstrates robustness across all categories of unanswerability. Notably, Reti-naQA also sets a new state-of-the-art for answerable KBQA, surpassing existing models. We release our code-base 1 for further research.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2403.10849")
get_code_for_paper("2403.10849")
have("2403.10849")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2403.10849.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2403.10849)
Connect an agent — have() is free.