TY - GEN
T1 - Understanding SyncMap's Dynamics and Its Self-organization Properties
T2 - 5th Artificial Intelligence and Cloud Computing Conference, AICCC 2022
AU - Zhang, Heng
AU - Vargas, Danilo Vasconcellos
N1 - Funding Information:
This work was supported by JST SPRING, Grant Number JPMJSP2136.
Publisher Copyright:
© 2022 ACM.
PY - 2022/12/17
Y1 - 2022/12/17
N2 - Human are shown able to rapidly recognize patterns in sequences by detecting and chunking together the patterns found, without supervised signals. Recently, inspired by how neuron groups act in quickly switching behaviors, SyncMap was proposed to solve chunking problems based solely on self-organization. The idea is to create dynamical equations that maintain an equilibrium state by dynamically updating with positive and negative feedback loops. When the underlying structure changes, the system can quickly adapt to the new structure. Although SyncMap can solve chunking problems effectively, the properties of its dynamics during training, is still underexplored. Here, we give a detailed investigation of SyncMap's dynamics by using several experiments to demonstrate the behaviors of SyncMap from the perspectives of space and time, in which a problem that causes imprecise results in the original work was identified. We then propose a solution call SyncMap with moving average (i.e., SyncMap-MA), which surpasses the original work and the baselines in all experiments, suggesting that the modification here is effective and can be integrated in the future version of the algorithm.
AB - Human are shown able to rapidly recognize patterns in sequences by detecting and chunking together the patterns found, without supervised signals. Recently, inspired by how neuron groups act in quickly switching behaviors, SyncMap was proposed to solve chunking problems based solely on self-organization. The idea is to create dynamical equations that maintain an equilibrium state by dynamically updating with positive and negative feedback loops. When the underlying structure changes, the system can quickly adapt to the new structure. Although SyncMap can solve chunking problems effectively, the properties of its dynamics during training, is still underexplored. Here, we give a detailed investigation of SyncMap's dynamics by using several experiments to demonstrate the behaviors of SyncMap from the perspectives of space and time, in which a problem that causes imprecise results in the original work was identified. We then propose a solution call SyncMap with moving average (i.e., SyncMap-MA), which surpasses the original work and the baselines in all experiments, suggesting that the modification here is effective and can be integrated in the future version of the algorithm.
UR - http://www.scopus.com/inward/record.url?scp=85158111304&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85158111304&partnerID=8YFLogxK
U2 - 10.1145/3582099.3582102
DO - 10.1145/3582099.3582102
M3 - Conference contribution
AN - SCOPUS:85158111304
T3 - ACM International Conference Proceeding Series
SP - 14
EP - 20
BT - Proceedings of the 2022 5th Artificial Intelligence and Cloud Computing Conference, AICCC 2022
PB - Association for Computing Machinery
Y2 - 17 December 2022 through 19 December 2022
ER -