Designing recurrent neural networks by unfolding an l1-l1 minimization algorithm.
Hung Duy LeHuynh Van LuongNikos DeligiannisPublished in: CoRR (2019)
Keyphrases
- recurrent neural networks
- objective function
- computational complexity
- cost function
- np hard
- optimal solution
- similarity measure
- dynamic programming
- detection algorithm
- preprocessing
- k means
- neural network
- computational cost
- expectation maximization
- search space
- worst case
- simulated annealing
- particle swarm optimization
- bayesian framework