Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Electrical and Computer Engineering

PDF

The Summer Undergraduate Research Fellowship (SURF) Symposium

Conference

Machine learning

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Reward Modulated Spike Timing Dependent Plasticity Based Learning Mechanism In Spiking Neural Networks, Shrihari Sridharan, Gopalakrishnan Srinivasan, Kaushik Roy Aug 2016

Reward Modulated Spike Timing Dependent Plasticity Based Learning Mechanism In Spiking Neural Networks, Shrihari Sridharan, Gopalakrishnan Srinivasan, Kaushik Roy

The Summer Undergraduate Research Fellowship (SURF) Symposium

Spiking Neural Networks (SNNs) are one of the recent advances in machine learning that aim to further emulate the computations performed in the human brain. The efficiency of such networks stems from the fact that information is encoded as spikes, which is a paradigm shift from the computing model of the traditional neural networks. Spike Timing Dependent Plasticity (STDP), wherein the synaptic weights interconnecting the neurons are modulated based on a pair of pre- and post-synaptic spikes is widely used to achieve synaptic learning. The learning mechanism is extremely sensitive to the parameters governing the neuron dynamics, the extent of …


Model-Free Method Of Reinforcement Learning For Visual Tasks, Jeff S. Soldate, Jonghoon Jin, Eugenio Culurciello Aug 2014

Model-Free Method Of Reinforcement Learning For Visual Tasks, Jeff S. Soldate, Jonghoon Jin, Eugenio Culurciello

The Summer Undergraduate Research Fellowship (SURF) Symposium

There has been success in recent years for neural networks in applications requiring high level intelligence such as categorization and assessment. In this work, we present a neural network model to learn control policies using reinforcement learning. It takes a raw pixel representation of the current state and outputs an approximation of a Q value function made with a neural network that represents the expected reward for each possible state-action pair. The action is chosen an \epsilon-greedy policy, choosing the highest expected reward with a small chance of random action. We used gradient descent to update the weights and biases …