Ant colony optimization for triple product property triples to fast matrix multiplication
- 139 Downloads
The group-theoretic approach to fast matrix multiplication has been introduced by Cohn and Umans (proceedings of 44th annual IEEE symposium on foundations of computer science, IEEE Computer Society, 2003). In this approach, there is a challenging problem. It is to find three subsets of a given group satisfying the so-called triple product property such that the product of their sizes is as large as possible. For this challenging problem, some brute-force algorithm has been proposed, which is exact but time-consuming. The ant colony optimization is a randomized heuristic algorithm and finds extensive applications in many fields. We use it to solve the problem of searching for three subsets of a given group such that they satisfy the triple product property and the product of their sizes reaches the maximum. Experimental results show that the ant colony optimization is efficient for this problem. Using this approach, we obtain three subsets for each nonabelian group of order not larger than 44 which satisfy the triple product property and the product of whose sizes reaches the best value found so far.
KeywordsAnt colony optimization Matrix multiplication Triple product property Search algorithm Group
Compliance with Ethical Standards
This study was funded by the National Natural Science Foundation of China (Nos. 61472143, 61562071), the Scientific Research Special Plan of Guangzhou Science and Technology Programme (No. 201607010045), and the Natural Science Foundation of Jiangxi Province (No. 20151BAB207020).
Conflict of interest
The authors declare that they have no conflict of interest
Human and Participants
This article does not contain any studies with human participants or animals performed by any of the authors.
- Ambainis A, Filmus Y, Le Gall F (2015) Fast matrix multiplication: limitations of the coppersmith-winograd method. In: Proceedings of the forty-seventh annual acm symposium on theory of computing, pp 585–593Google Scholar
- Cohn H, Umans C (2003) A group-theoretic approach to fast matrix multiplication. In: Proceedings of 44th annual IEEE symposium on foundations of computer science, IEEE Computer Society, pp 438–449Google Scholar
- Hopcroft JE, Kerr LR (1969) Some techniques for proving certain simple programs optimal. In: IEEE conference record of 10th annual symposium on switching and automata theory, pp 36–45Google Scholar
- Le Gall F (2014) Powers of tensors and fast matrix multiplication. Eprint Arxiv pp 296–303Google Scholar
- Pan VY (1978) Strassen’s algorithm is not optimal, trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. In: Proceedings of the 19th annual symposium on foundations of computer science, pp 166–176Google Scholar
- Salama K, Abdelbar AM (2014) A novel ant colony algorithm for building neural network topologies. In: Proceedings of the 9th international conference on ant colony optimization and swarm intelligence, ANTS 2014, Brussels, Belgium, September 10–12, pp 1–12Google Scholar
- Stothers A (2010) On the complexity of matrix multiplication. Ph.D. thesis, University of EdinburghGoogle Scholar
- Williams VV (2012) Multiplying matrices faster than coppersmith-winograd. In: Proceedings of the forty-fourth annual acm symposium on theory of computing, pp 887–898Google Scholar