IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v462y2016icp31-37.html
   My bibliography  Save this article

Minimal perceptrons for memorizing complex patterns

Author

Listed:
  • Pastor, Marissa
  • Song, Juyong
  • Hoang, Danh-Tai
  • Jo, Junghyo

Abstract

Feedforward neural networks have been investigated to understand learning and memory, as well as applied to numerous practical problems in pattern classification. It is a rule of thumb that more complex tasks require larger networks. However, the design of optimal network architectures for specific tasks is still an unsolved fundamental problem. In this study, we consider three-layered neural networks for memorizing binary patterns. We developed a new complexity measure of binary patterns, and estimated the minimal network size for memorizing them as a function of their complexity. We formulated the minimal network size for regular, random, and complex patterns. In particular, the minimal size for complex patterns, which are neither ordered nor disordered, was predicted by measuring their Hamming distances from known ordered patterns. Our predictions agree with simulations based on the back-propagation algorithm.

Suggested Citation

  • Pastor, Marissa & Song, Juyong & Hoang, Danh-Tai & Jo, Junghyo, 2016. "Minimal perceptrons for memorizing complex patterns," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 31-37.
    • Handle: RePEc:eee:phsmap:v:462:y:2016:i:c:p:31-37
    DOI: 10.1016/j.physa.2016.06.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711630293X
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2016.06.025?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Silva, Luiz Eduardo Virgilio & Cabella, Brenno Caetano Troca & Neves, Ubiraci Pereira da Costa & Murta Junior, Luiz Otavio, 2015. "Multiscale entropy-based methods for heart rate variability complexity analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 422(C), pages 143-152.
    2. Larrondo, H.A. & González, C.M. & Martín, M.T. & Plastino, A. & Rosso, O.A., 2005. "Intensive statistical complexity measure of pseudorandom number generators," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 356(1), pages 133-138.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Avaroğlu, Erdinç, 2020. "The implementation of ring oscillator based PUF designs in Field Programmable Gate Arrays using of different challenge," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 546(C).
    2. Zunino, L. & Pérez, D.G. & Kowalski, A. & Martín, M.T. & Garavaglia, M. & Plastino, A. & Rosso, O.A., 2008. "Fractional Brownian motion, fractional Gaussian noise, and Tsallis permutation entropy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(24), pages 6057-6068.
    3. Zunino, Luciano & Zanin, Massimiliano & Tabak, Benjamin M. & Pérez, Darío G. & Rosso, Osvaldo A., 2009. "Forbidden patterns, permutation entropy and stock market inefficiency," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 388(14), pages 2854-2864.
    4. Wang, Mengjiao & Liao, Xiaohan & Deng, Yong & Li, Zhijun & Su, Yongxin & Zeng, Yicheng, 2020. "Dynamics, synchronization and circuit implementation of a simple fractional-order chaotic system with hidden attractors," Chaos, Solitons & Fractals, Elsevier, vol. 130(C).
    5. Wang, Shaojie & He, Shaobo & Yousefpour, Amin & Jahanshahi, Hadi & Repnik, Robert & Perc, Matjaž, 2020. "Chaos and complexity in a fractional-order financial system with time delays," Chaos, Solitons & Fractals, Elsevier, vol. 131(C).
    6. Azami, Hamed & Escudero, Javier, 2017. "Refined composite multivariate generalized multiscale fuzzy entropy: A tool for complexity analysis of multichannel signals," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 261-276.
    7. Lijun Zhang & Caochuan Ma & Yuxiang Zhao & Wenbo Zhao, 2023. "A Novel Dynamic S-Box Generation Scheme Based on Quantum Random Walks Controlled by a Hyper-Chaotic Map," Mathematics, MDPI, vol. 12(1), pages 1-22, December.
    8. De Micco, Luciana & Fernández, Juana Graciela & Larrondo, Hilda A. & Plastino, Angelo & Rosso, Osvaldo A., 2012. "Sampling period, statistical complexity, and chaotic attractors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2564-2575.
    9. He, Shaobo & Sun, Kehui & Wang, Huihai, 2016. "Multivariate permutation entropy and its application for complexity analysis of chaotic systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 812-823.
    10. Cui, Huizi & Zhou, Lingge & Li, Yan & Kang, Bingyi, 2022. "Belief entropy-of-entropy and its application in the cardiac interbeat interval time series analysis," Chaos, Solitons & Fractals, Elsevier, vol. 155(C).
    11. Etem, Taha & Kaya, Turgay, 2020. "A novel True Random Bit Generator design for image encryption," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 540(C).
    12. Valle, João & Machicao, Jeaneth & Bruno, Odemir M., 2022. "Chaotical PRNG based on composition of logistic and tent maps using deep-zoom," Chaos, Solitons & Fractals, Elsevier, vol. 161(C).
    13. Eduarda T. C. Chagas & Marcelo Queiroz‐Oliveira & Osvaldo A. Rosso & Heitor S. Ramos & Cristopher G. S. Freitas & Alejandro C. Frery, 2022. "White Noise Test from Ordinal Patterns in the Entropy–Complexity Plane," International Statistical Review, International Statistical Institute, vol. 90(2), pages 374-396, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:462:y:2016:i:c:p:31-37. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.