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 Kuderov

dblp:286/7485 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
5since 2021 · last 2025
0000-0001-7055-3426ORCID · verified

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

Artificial intelligence and machine learning · 5 · 1 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
2 papers
Reinforcement learning · 33% Language models and text generation · 17% Learning theory · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
agent evaluation
0.912025
CrafText Benchmark: Advancing Instruction Following in Complex Multimodal Open-Ended World · ACL (1) 2025
Machine learning › Learning theory
generalization
0.912025
CrafText Benchmark: Advancing Instruction Following in Complex Multimodal Open-Ended World · ACL (1) 2025
Natural language and speech › Language models and text generation
instruction following
0.912025
CrafText Benchmark: Advancing Instruction Following in Complex Multimodal Open-Ended World · ACL (1) 2025
Computer vision › Vision and language › vision-language model › multimodal large language model
multimodal instruction following
0.912025
CrafText Benchmark: Advancing Instruction Following in Complex Multimodal Open-Ended World · ACL (1) 2025
Machine learning › Time series and sequential data
non-stationary environments
0.912025
Learning Successor Features with Distributed Hebbian Temporal Memory · ICLR 2025
Machine learning › Reinforcement learning › function approximation › representation learning for reinforcement learning
successor features
0.912025
Learning Successor Features with Distributed Hebbian Temporal Memory · ICLR 2025

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

hebbian learning · 0.9factor graph · 0.9distributed representations · 0.9
YearPublicationVenuePosition
2025 CrafText Benchmark: Advancing Instruction Following in Complex Multimodal Open-Ended World
abstract
Following instructions in real-world conditions requires a capability to adapt to the world's volatility and entanglement: the environment is dynamic and unpredictable, instructions can be linguistically complex with diverse vocabulary, and the number of possible goals an agent may encounter is vast.Despite extensive research in this area, most studies are conducted in static environments with simple instructions and a limited vocabulary, making it difficult to assess agent performance in more diverse and challenging settings.To address this gap, we introduce CrafText, a benchmark for evaluating instruction following in a multimodal environment with diverse instructions and dynamic interactions.CrafText includes 3,924 instructions with 3,423 unique words, covering Localization, Conditional, Building, and Achievement tasks.Additionally, we propose an evaluation protocol that measures an agent's ability to generalize to novel instruction formulations and dynamically evolving task configurations, providing a rigorous test of both linguistic understanding and adaptive decisionmaking.
Zoya Volovikova, Gregory Gorbov, Petr Kuderov, Aleksandr I. Panov, Aleksey Skrynnik
ACL (1)3
2025 Learning Successor Features with Distributed Hebbian Temporal Memory
abstract
This paper presents a novel approach to address the challenge of online sequence learning for decision making under uncertainty in non-stationary, partially observable environments. The proposed algorithm, Distributed Hebbian Temporal Memory (DHTM), is based on the factor graph formalism and a multi-component neuron model. DHTM aims to capture sequential data relationships and make cumulative predictions about future observations, forming Successor Features (SFs). Inspired by neurophysiological models of the neocortex, the algorithm uses distributed representations, sparse transition matrices, and local Hebbian-like learning rules to overcome the instability and slow learning of traditional temporal memory algorithms such as RNN and HMM. Experimental results show that DHTM outperforms LSTM, RWKV and a biologically inspired HMM-like algorithm, CSCG, on non-stationary data sets. Our results suggest that DHTM is a promising approach to address the challenges of online sequence learning and planning in dynamic environments.
Evgenii Dzhivelikian, Petr Kuderov, Aleksandr I. Panov
ICLR2
2024 Instruction Following with Goal-Conditioned Reinforcement Learning in Virtual Environments
abstract
In this study, we address the issue of enabling an artificial intelligence agent to execute complex language instructions within virtual environments. In our framework, we assume that these instructions involve intricate linguistic structures and multiple interdependent tasks that must be navigated successfully to achieve the desired outcomes. To effectively manage these complexities, we propose a hierarchical framework that combines the deep language comprehension of large language models with the adaptive action-execution capabilities of reinforcement learning agents: the language module (based on LLM) translates the language instruction into a high-level action plan, which is then executed by a pre-trained reinforcement learning agent.We have demonstrated the effectiveness of our approach in two different environments: in IGLU, where agents are instructed to build structures, and in Crafter, where agents perform tasks and interact with objects in the surrounding environment according to language commands.
Zoya Volovikova, Aleksey Skrynnik, Petr Kuderov, Aleksandr I. Panov
ECAI3
2023 Interpreting Decision Process in Offline Reinforcement Learning for Interactive Recommendation Systems
Zoya Volovikova, Petr Kuderov, Aleksandr I. Panov
ICONIP (9)2
2021 Planning with Hierarchical Temporal Memory for Deterministic Markov Decision Problem
Petr Kuderov, Aleksandr I. Panov
ICAART (2)1