Absorbing Diagonal Algorithm: An Eigensolver of $O\left(n^{2.584963}\log \frac{1}{\varepsilon }\right)$On2.584963log1ɛ Complexity at Accuracy $\varepsilon$ɛ.
Junfeng WuJing HeChi-Hung ChiGuangyan HuangPublished in: IEEE Trans. Knowl. Data Eng. (2021)
Keyphrases
- computational complexity
- computational cost
- high accuracy
- log log
- worst case
- computational efficiency
- learning algorithm
- processing speed
- dynamic programming
- experimental evaluation
- preprocessing
- accuracy rate
- cost function
- np hard
- theoretical analysis
- optimal solution
- decision trees
- linear complexity
- detection algorithm
- optimization algorithm
- expectation maximization
- state space
- similarity measure
- markov chain
- simulated annealing
- model selection
- image sequences
- active learning
- times faster
- memory requirements
- recognition algorithm
- search space
- vc dimension
- bayesian networks
- search algorithm
- lower complexity
- reinforcement learning