Daria Kotova
Author directory2026
INTRYGUE: Induction-Aware Entropy Gating for Reliable RAG Uncertainty Estimation
Alexandra Kuleshova | Andrei Volodichev | Daria Kotova | Alexey Zaytsev
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Alexandra Kuleshova | Andrei Volodichev | Daria Kotova | Alexey Zaytsev
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
While retrieval-augmented generation (RAG) enhances LLM performance, it does not eliminate hallucinations, making accurate detection essential. Uncertainty-based methods are attractive for this purpose because they can be integrated into real-world pipelines with little overhead. One of the most widely used uncertainty signals is predictive entropy. We show, however, that entropy can be unreliable in RAG settings and trace this limitation to two opposing internal effects. Induction heads, which copy patterns from earlier context, causally support correct responses and lower predictive entropy, but they also appear to co-activate entropy neurons that push it back up. As a result, correct, context-grounded responses can still receive high uncertainty scores. To address this, we propose INTRYGUE (Induction-Aware Entropy Gating for Uncertainty Estimation), a training-free, mechanistically grounded method that gates predictive entropy by an attention-based estimate of induction-head activity. Evaluated across four RAG-style benchmarks and six open-source LLMs (4B to 13B parameters), INTRYGUE performs competitively against a wide range of baselines, matching or exceeding the strongest of them in most settings. Our findings suggest that hallucination detection in RAG benefits from combining predictive uncertainty with interpretable internal signals of context utilization.
2025
What Makes Cryptic Crosswords Challenging for LLMs?
Abdelrahman Sadallah | Daria Kotova | Ekaterina Kochmar
Proceedings of the 31st International Conference on Computational Linguistics
Abdelrahman Sadallah | Daria Kotova | Ekaterina Kochmar
Proceedings of the 31st International Conference on Computational Linguistics
Cryptic crosswords are puzzles that rely on general knowledge and the solver’s ability to manipulate language on different levels, dealing with various types of wordplay. Previous research suggests that solving such puzzles is challenging even for modern NLP models, including Large Language Models (LLMs). However, there is little to no research on the reasons for their poor performance on this task. In this paper, we establish the benchmark results for three popular LLMs: Gemma2, LLaMA3 and ChatGPT, showing that their performance on this task is still significantly below that of humans. We also investigate why these models struggle to achieve superior performance. We release our code and introduced datasets at https://github.com/bodasadallah/decrypting-crosswords.