Cellular neural networks for NP-hard optimization

被引:0
|
作者
Ercsey-Ravasz, Maria [1 ]
Roska, Tamas [1 ]
Neda, Zoltan [2 ]
机构
[1] Peter Pazmany Catholic Univ, Fac Informat Technol, HU-1083 Budapest, Hungary
[2] Univ Babes Bolyai, Fac Phys, RO-400084 Cluj Napoca, Romania
关键词
D O I
10.1109/CNNA.2008.4588649
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We prove, that a CNN in which the parameters of all cells can be separately controlled, is the analog correspondent of a two-dimensional Ising type (Edwards-Anderson) spin-glass system. Using the properties of CNN we show that one single operation (template) always yields a local minimum of the spin-glass energy function. This way a very fast optimization method, similar to simulated annealing, can be built. Estimating the simulation time needed with our optimization algorithm on CNN based computers, and comparing it with the time needed on normal digital computers using the simulated annealing algorithm, the results are astonishing: CNN computers could be faster than digital computers already at 10 x 10 lattice sizes. The local control of the template parameters was already partially realized on some of the hardwares, we think this study could further motivate their development in this direction.
引用
收藏
页码:52 / +
页数:2
相关论文
共 50 条
  • [1] Cellular Neural Networks for NP-Hard Optimization
    Mária Ercsey-Ravasz
    Tamás Roska
    Zoltán Néda
    EURASIP Journal on Advances in Signal Processing, 2009
  • [2] Cellular Neural Networks for NP-Hard Optimization
    Ercsey-Ravasz, Maria
    Roska, Tamas
    Neda, Zoltan
    EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2009,
  • [3] ON THE PERFORMANCE GUARANTEE OF NEURAL NETWORKS FOR NP-HARD OPTIMIZATION PROBLEMS
    ZISSIMOPOULOS, V
    INFORMATION PROCESSING LETTERS, 1995, 54 (06) : 317 - 322
  • [4] Training Neural Networks is NP-Hard in Fixed Dimension
    Froese, Vincent
    Hertrich, Christoph
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [5] FINDING APPROXIMATE SOLUTIONS TO NP-HARD PROBLEMS BY NEURAL NETWORKS IS HARD
    YAO, X
    INFORMATION PROCESSING LETTERS, 1992, 41 (02) : 93 - 98
  • [6] Optimization of lattice surgery is NP-hard
    Herr, Daniel
    Nori, Franco
    Devitt, Simon J.
    NPJ QUANTUM INFORMATION, 2017, 3
  • [7] Optimization of lattice surgery is NP-hard
    Daniel Herr
    Franco Nori
    Simon J. Devitt
    npj Quantum Information, 3
  • [8] Metabolic networks are NP-hard to reconstruct
    Nikoloski, Zoran
    Grimbs, Sergio
    May, Patrick
    Selbig, Joachim
    JOURNAL OF THEORETICAL BIOLOGY, 2008, 254 (04) : 807 - 816
  • [9] Scanning Phylogenetic Networks Is NP-hard
    Berry, Vincent
    Scornavacca, Celine
    Weller, Mathias
    SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2020, 12011 : 519 - 530
  • [10] FINDING MAPS FOR BELIEF NETWORKS IS NP-HARD
    SHIMONY, SE
    ARTIFICIAL INTELLIGENCE, 1994, 68 (02) : 399 - 410