Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Petr Anokhin

dblp:369/3360 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0002-7974-5077ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Language models and text generation · 46% Knowledge representation and reasoning · 25% Question answering and dialogue systems · 22%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
knowledge graph
0.912025
AriGraph: Learning Knowledge Graph World Models with Episodic Memory for LLM Agents · IJCAI 2025
Natural language and speech › Language models and text generation
LLM agents
0.912025
AriGraph: Learning Knowledge Graph World Models with Episodic Memory for LLM Agents · IJCAI 2025
Medical and health informatics › clinical informatics › clinical coding
automated ICD coding
0.912025
RuCCoD: Towards Automated ICD Coding in Russian · EMNLP 2025
Medical and health informatics › clinical informatics
clinical coding
0.912025
RuCCoD: Towards Automated ICD Coding in Russian · EMNLP 2025
Natural language and speech › Question answering and dialogue systems › machine reading comprehension
document question answering
0.812024
BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystack · NeurIPS 2024
Natural language and speech › Language models and text generation › large language model reasoning
long-context reasoning
0.812024
BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystack · NeurIPS 2024
Natural language and speech › Information extraction and text analysis › text mining › biomedical text mining
clinical text analysis
0.312025
RuCCoD: Towards Automated ICD Coding in Russian · EMNLP 2025
Information retrieval
retrieval-augmented generation
0.212024
BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystack · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

recurrent memory transformers · 1.5benchmark construction · 1.5retrieval augmentation · 0.9large language model · 0.9
YearPublicationVenuePosition
2025 RuCCoD: Towards Automated ICD Coding in Russian
abstract
Alexandr Nesterov, Andrey Sakhovskiy, Ivan Sviridov, Airat Valiev, Vladimir Makharev, Petr Anokhin, Galina Zubkova, Elena Tutubalina. Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing. 2025.
Alexandr Nesterov, Andrey Sakhovskiy, Ivan Sviridov, Airat Valiev, Vladimir Makharev, Petr Anokhin, Galina Zubkova, Elena Tutubalina
EMNLP6
2025 AriGraph: Learning Knowledge Graph World Models with Episodic Memory for LLM Agents
abstract
Advancements in the capabilities of Large Language Models (LLMs) have created a promising foundation for developing autonomous agents. With the right tools, these agents could learn to solve tasks in new environments by accumulating and updating their knowledge. Current LLM-based agents process past experiences using a full history of observations, summarization, retrieval augmentation. However, these unstructured memory representations do not facilitate the reasoning and planning essential for complex decision-making. In our study, we introduce AriGraph, a novel method wherein the agent constructs and updates a memory graph that integrates semantic and episodic memories while exploring the environment. We demonstrate that our Ariadne LLM agent, consisting of the proposed memory architecture augmented with planning and decision-making, effectively handles complex tasks within interactive text game environments difficult even for human players. Results show that our approach markedly outperforms other established memory methods and strong RL baselines in a range of problems of varying complexity. Additionally, AriGraph demonstrates competitive performance compared to dedicated knowledge graph-based methods in static multi-hop question-answering.
Petr Anokhin, Nikita Semenov, Artyom Y. Sorokin, Dmitry Evseev, Andrey Kravchenko, Mikhail Burtsev 0001, Evgeny Burnaev
IJCAI1
2024 BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystack
abstract
In recent years, the input context sizes of large language models (LLMs) have increased dramatically. However, existing evaluation methods have not kept pace, failing to comprehensively assess the efficiency of models in handling long contexts. To bridge this gap, we introduce the BABILong benchmark, designed to test language models' ability to reason across facts distributed in extremely long documents. BABILong includes a diverse set of 20 reasoning tasks, including fact chaining, simple induction, deduction, counting, and handling lists/sets. These tasks are challenging on their own, and even more demanding when the required facts are scattered across long natural text. Our evaluations show that popular LLMs effectively utilize only 10-20% of the context and their performance declines sharply with increased reasoning complexity. Among alternatives to in-context reasoning, Retrieval-Augmented Generation methods achieve a modest 60% accuracy on single-fact question answering, independent of context length. Among context extension methods, the highest performance is demonstrated by recurrent memory transformers after fine-tuning, enabling the processing of lengths up to 50 million tokens. The BABILong benchmark is extendable to any length to support the evaluation of new upcoming models with increased capabilities, and we provide splits up to 10 million token lengths.
Yuri Kuratov, Aydar Bulatov, Petr Anokhin, Ivan Rodkin, Dmitry Sorokin, Artyom Y. Sorokin, Mikhail Burtsev 0001
NeurIPS3
2024 Associative Learning and Active Inference
abstract
Associative learning is a behavioral phenomenon in which individuals develop connections between stimuli or events based on their co-occurrence. Initially studied by Pavlov in his conditioning experiments, the fundamental principles of learning have been expanded on through the discovery of a wide range of learning phenomena. Computational models have been developed based on the concept of minimizing reward prediction errors. The Rescorla-Wagner model, in particular, is a well-known model that has greatly influenced the field of reinforcement learning. However, the simplicity of these models restricts their ability to fully explain the diverse range of behavioral phenomena associated with learning. In this study, we adopt the free energy principle, which suggests that living systems strive to minimize surprise or uncertainty under their internal models of the world. We consider the learning process as the minimization of free energy and investigate its relationship with the Rescorla-Wagner model, focusing on the informational aspects of learning, different types of surprise, and prediction errors based on beliefs and values. Furthermore, we explore how well-known behavioral phenomena such as blocking, overshadowing, and latent inhibition can be modeled within the active inference framework. We accomplish this by using the informational and novelty aspects of attention, which share similar ideas proposed by seemingly contradictory models such as Mackintosh and Pearce-Hall models. Thus, we demonstrate that the free energy principle, as a theoretical framework derived from first principles, can integrate the ideas and models of associative learning proposed based on empirical experiments and serve as a framework for a better understanding of the computational processes behind associative learning in the brain.
Petr Anokhin, Artyom Y. Sorokin, Mikhail Burtsev 0001, Karl J. Friston
Neural Comput.1