activity
20012026
most citedConvAI3: Generating Clarifying Questions for Open-Domain Dialogue Systems (ClariQ)

32 citations · 161 across the 38 of their papers we have counts for

collaborators
Showing cs.CLShow all

23 papers · 1 filter

cs.CL2026

Retrieval Capacity of Self-Attention Under Competition

Timur Mudarisov, Mikhail Burtsev, Radu State

How many tokens from its context does a language model actually use, and what determines that number? We study this question through self-attention. Without retraining, we retain o…

cs.CL2026

The Geometry of Inference in Transformer Residual Streams

Timur Mudarisov, Mikhail Burtsev, Radu State

Transformer language models build predictions through successive residual updates, but how their representations become specific to an eventual outcome remains unclear. We study th…

cs.CL2026

Extending LLM Context via Associative Recurrent Memory

Gleb Kuzmin, Ivan Rodkin, Aydar Bulatov +8

Extending the context length of large language models (LLMs) is critical for many real-world applications, yet standard transformers remain constrained by quadratic compute and lin…

cs.CL2026

Wikontic: Constructing Wikidata-Aligned, Ontology-Aware Knowledge Graphs with Large Language Models

Alla Chepurova, Aydar Bulatov, Mikhail Burtsev +1

Knowledge graphs (KGs) provide structured, verifiable grounding for large language models (LLMs), but current LLM-based systems commonly use KGs as auxiliary structures for text re…

cs.CL2025

Cramming 1568 Tokens into a Single Vector and Back Again: Exploring the Limits of Embedding Space Capacity

Yuri Kuratov, Mikhail Arkhipov, Aydar Bulatov +1

A range of recent works addresses the problem of compression of sequence of tokens into a shorter sequence of real-valued vectors to be used as inputs instead of token embeddings o…

cs.CL2024

Associative Recurrent Memory Transformer

Ivan Rodkin, Yuri Kuratov, Aydar Bulatov +1

This paper addresses the challenge of creating a neural architecture for very long sequences that requires constant time for processing new information at each time step. Our appro…