Self-organising Neural Discrete Representation Learning a la Kohonen

被引:0
|
作者
Irie, Kazuki [1 ,6 ]
Csordas, Robert [2 ,6 ]
Schmidhuber, Juergen [3 ,4 ,5 ]
机构
[1] Harvard Univ, Ctr Brain Sci, Cambridge, MA 02138 USA
[2] Stanford Univ, Stanford, CA 94305 USA
[3] USI, Swiss AI Lab, IDSIA, Lugano, Switzerland
[4] SUPSI, Lugano, Switzerland
[5] King Abdullah Univ Sci & Technol KAUST, AI Initiat, Thuwal, Saudi Arabia
[6] IDSIA, Lugano, Switzerland
基金
瑞士国家科学基金会;
关键词
self-organizing maps; Kohonen maps; vector quantisation; VQ-VAE; discrete representation learning; ORGANIZATION; CELLS;
D O I
10.1007/978-3-031-72332-2_23
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Unsupervised learning of discrete representations in neural networks (NNs) from continuous ones is essential for many modern applications. Vector Quantisation (VQ) has become popular for this, in particular in the context of generative models, such as Variational Auto-Encoders (VAEs), where the exponential moving average-based VQ (EMA-VQ) algorithm is often used. Here, we study an alternative VQ algorithm based on Kohonen's learning rule for the Self-Organising Map (KSOM; 1982). EMA-VQ is a special case of KSOM. KSOM is known to offer two potential benefits: empirically, it converges faster than EMA-VQ, and KSOM-generated discrete representations form a topological structure on the grid whose nodes are the discrete symbols, resulting in an artificial version of the brain's topographic map. We revisit these properties by using KSOM in VQ-VAEs for image processing. In our experiments, the speed-up compared to well-configured EMA-VQ is only observable at the beginning of training, but KSOM is generally much more robust, e.g., w.r.t. the choice of initialisation schemes (Our code is public: https://github.com/IDSIA/kohonen-vae. The full version with an appendix can be found at: https://arxiv.org/abs/2302.07950).
引用
收藏
页码:343 / 362
页数:20
相关论文
共 50 条
  • [1] Visualisation of gait data with Kohonen self-organising neural maps
    Barton, Gabor
    Lees, Adrian
    Lisboa, Paulo
    Attfield, Steve
    GAIT & POSTURE, 2006, 24 (01) : 46 - 53
  • [2] An efficient approach for Kohonen self-organising network
    Pan, JS
    Kuo, TH
    Chu, SC
    Day, JD
    Liao, BY
    ICEMI '97 - CONFERENCE PROCEEDINGS: THIRD INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS, 1997, : 622 - 625
  • [3] Self-Organising (Kohonen) Maps for the Vietnam Banking Industry
    Ha, Man
    Gan, Christopher
    Nguyen, Cuong
    Anthony, Patricia
    JOURNAL OF RISK AND FINANCIAL MANAGEMENT, 2021, 14 (10)
  • [4] Using the Kohonen self-organising map for novel data handling in adaptive learning
    Buttress, J
    Frith, AM
    Gent, CR
    Beaumont, AJ
    NEURAL NETWORKS - PRODUCING DEPENDABLE SYSTEMS, CONFERENCE PROCEEDINGS, 1996, 95 (973): : 113 - 123
  • [5] Object Representation with Self-Organising Networks
    Angelopoulou, Anastassia
    Psarrou, Alexandra
    Garcia Rodriguez, Jose
    ADVANCES IN COMPUTATIONAL INTELLIGENCE, IWANN 2011, PT II, 2011, 6692 : 244 - 251
  • [6] Use of the Kohonen self-organising map to predict the flowability of powders
    Antikainen, OK
    Rantanen, JT
    Yliruusi, JK
    STP PHARMA SCIENCES, 2000, 10 (05): : 349 - 354
  • [7] Self-organising Neural Network Hierarchy
    Borgohain, Satya
    Kowadlo, Gideon
    Rawlinson, David
    Bergmeir, Christoph
    Loo, Kok
    Rangarajan, Harivallabha
    Kuhlmann, Levin
    AI 2020: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 12576 : 359 - 370
  • [8] Self-organising artificial neural networks
    Flanagan, JA
    Hasler, M
    FROM NATURAL TO ARTIFICIAL NEURAL COMPUTATION, 1995, 930 : 322 - 329
  • [9] Anaerobic digestion process modeling using Kohonen self-organising maps
    Ramachandran, Anjali
    Rustum, Rabee
    Adeloye, Adebayo J.
    HELIYON, 2019, 5 (04)
  • [10] Kohonen self-organising maps in the data mining of wine taster comments
    Sallis, P.
    Shanmuganathan, S.
    Pavesi, L.
    Munoz, M. C. J.
    DATA MINING IX: DATA MINING, PROTECTION, DETECTION AND OTHER SECURITY TECHNOLOGIES, 2008, 40 : 125 - 139