Cellular Neural Networks for NP-Hard Optimization

被引:6
|
作者
Ercsey-Ravasz, Maria [1 ]
Roska, Tamas [2 ,3 ]
Neda, Zoltan [4 ]
机构
[1] Univ Notre Dame, Dept Phys, Notre Dame, IN 46556 USA
[2] Peter Pazmany Catholic Univ, Fac Informat Technol, H-1083 Budapest, Hungary
[3] Hungarian Acad Sci MTA SZTAKI, Comp & Automat Res Inst, H-1111 Budapest, Hungary
[4] Univ Babes Bolyai, Fac Phys, Cluj Napoca 400084, Romania
关键词
PARTIAL-DIFFERENTIAL EQUATIONS; SIMULATING NONLINEAR-WAVES; CNN UNIVERSAL MACHINE; SPIN-GLASS MODELS;
D O I
10.1155/2009/646975
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A cellular neural/nonlinear network (CNN) is used for NP-hard optimization. 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 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. Copyright (C) 2009 Maria Ercsey-Ravasz et al.
引用
收藏
页数:7
相关论文
共 50 条
  • [1] Cellular Neural Networks for NP-Hard Optimization
    Mária Ercsey-Ravasz
    Tamás Roska
    Zoltán Néda
    [J]. EURASIP Journal on Advances in Signal Processing, 2009
  • [2] Cellular neural networks for NP-hard optimization
    Ercsey-Ravasz, Maria
    Roska, Tamas
    Neda, Zoltan
    [J]. 2008 11TH INTERNATIONAL WORKSHOP ON CELLULAR NEURAL NETWORKS AND THEIR APPLICATIONS, 2008, : 52 - +
  • [3] ON THE PERFORMANCE GUARANTEE OF NEURAL NETWORKS FOR NP-HARD OPTIMIZATION PROBLEMS
    ZISSIMOPOULOS, V
    [J]. INFORMATION PROCESSING LETTERS, 1995, 54 (06) : 317 - 322
  • [4] Training Neural Networks is NP-Hard in Fixed Dimension
    Froese, Vincent
    Hertrich, Christoph
    [J]. 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
    [J]. INFORMATION PROCESSING LETTERS, 1992, 41 (02) : 93 - 98
  • [6] Optimization of lattice surgery is NP-hard
    Herr, Daniel
    Nori, Franco
    Devitt, Simon J.
    [J]. NPJ QUANTUM INFORMATION, 2017, 3
  • [7] Optimization of lattice surgery is NP-hard
    Daniel Herr
    Franco Nori
    Simon J. Devitt
    [J]. npj Quantum Information, 3
  • [8] Metabolic networks are NP-hard to reconstruct
    Nikoloski, Zoran
    Grimbs, Sergio
    May, Patrick
    Selbig, Joachim
    [J]. JOURNAL OF THEORETICAL BIOLOGY, 2008, 254 (04) : 807 - 816
  • [9] Scanning Phylogenetic Networks Is NP-hard
    Berry, Vincent
    Scornavacca, Celine
    Weller, Mathias
    [J]. SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2020, 12011 : 519 - 530
  • [10] FINDING MAPS FOR BELIEF NETWORKS IS NP-HARD
    SHIMONY, SE
    [J]. ARTIFICIAL INTELLIGENCE, 1994, 68 (02) : 399 - 410