Phase transition in sparse associative neural networks.
Oleksiy DekhtyarenkoValery TereshkoColin FyfePublished in: ESANN (2005)
Keyphrases
- phase transition
- neural network
- constraint satisfaction
- associative memory
- randomly generated
- satisfiability problem
- hard problems
- combinatorial problems
- pattern recognition
- average degree
- np complete
- random constraint satisfaction problems
- sat problem
- deep structure
- graph coloring
- cellular automata
- high dimensional
- random instances
- random graphs
- stochastic local search
- hamiltonian cycle
- np complete problems
- boolean satisfiability
- genetic algorithm
- activation function
- magnetic field
- search algorithm
- computational complexity
- lower bound
- learning algorithm
- upper bound