Evgenii Dzhivelikian

dblp:302/1814 · also Evgenii Aleksandrovich Dzhivelikian · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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
1 paper
Reinforcement learning · 50% Time series and sequential data · 50%

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

TopicWeightPapersLastEvidence papers
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 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
ICLR1