Implementing Online Reinforcement Learning with Clustering Neural Networks
An agent employing reinforcement learning takes inputs (state variables) from an environment and performs actions that affect the environment in order to achieve some objective. Rewards (positive or negative) guide the agent toward improved future actions. This paper builds on prior clustering neural network research by constructing an agent with biologically plausible neo-Hebbian three-factor synaptic learning rules, with a reward signal as the third factor (in addition to pre- and post-synaptic spikes). The classic cart-pole problem (balancing an inverted pendulum) is used as a running example throughout the exposition. Simulation results demonstrate the efficacy of the approach, and the proposed method may eventually serve as a low-level component of a more general method.
Code (0)
등록된 구현이 없습니다.
Tasks
Clusteringreinforcement-learningReinforcement LearningSimilar Papers 제목 키워드 기반
Implementing Online Reinforcement Learning with Temporal Neural Networks
A Temporal Neural Network (TNN) architecture for implementing efficient online reinforcement learning is proposed and studied via simulation. The proposed T-learning system is composed of a frontend TNN that implements o…
Clusteringreinforcement-learningReinforcement LearningReinforcement Learning (RL)Designing and evaluating an online reinforcement learning agent for physical exercise recommendations in N-of-1 trials
Personalized adaptive interventions offer the opportunity to increase patient benefits, however, there are challenges in their planning and implementation. Once implemented, it is an important question whether personaliz…
reinforcement-learningReinforcement LearningXAI Beyond Classification: Interpretable Neural Clustering
In this paper, we study two challenging problems in explainable AI (XAI) and data clustering. The first is how to directly design a neural network with inherent interpretability, rather than giving post-hoc explanations …
ClassificationClusteringExplainable Artificial Intelligence (XAI)Online Clustering+1Online Regret Bounds for Undiscounted Continuous Reinforcement Learning
We derive sublinear regret bounds for undiscounted reinforcement learning in continuous state space. The proposed algorithm combines state aggregation with the use of upper confidence bounds for implementing optimism in …
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Real-time News Story Identification
To improve the reading experience, many news sites organize news into topical collections, called stories. In this work, we present an approach for implementing real-time story identification for a news monitoring system…
Text Clustering