Abstract
We study the average-case complexity of min-sum product of matrices, which is a fundamental operation that has many applications in computer science. We focus on optimizing the number of “algebraic” operations (i.e., operations involving real numbers) used in the computation, since such operations are usually expensive in various environments. We present an algorithm that can compute the min-sum product of two \(n \times n\) real matrices using only \(O(n^2)\) algebraic operations, given that the matrix elements are drawn independently and identically from some fixed probability distribution satisfying several constraints. This improves the previously best known upper-bound of \(O(n^2\log n)\). The class of probability distributions under which our algorithm works include many important and commonly used distributions, such as uniform distributions, exponential distributions, and folded normal distributions.
In order to evaluate the performance of the proposed algorithm, we performed experiments to compare the running time of the proposed algorithm with algorithms in [7]. The experimental results demonstrate that our algorithm achieves significant performance improvement over the previous algorithms.
This work was fully supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 122512].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)
Bloniarz, P.A.: A shortest-path algorithm with expected time \({O}(n^2 \log n\log ^*n)\). SIAM Journal on Computing 12(3), 588–600 (1983). http://link.aip.org/link/?SMJ/12/588/1
Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. Journal of Computer and System Sciences 7(4), 448–461 (1973). http://www.sciencedirect.com/science/article/pii/S0022000073800339
Chan, T.M.: More algorithms for all-pairs shortest paths in weighted graphs. SIAM Journal on Computing 39(5), 2075–2089 (2010)
Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation 9(3), 251–280 (1990). http://www.sciencedirect.com/science/article/pii/S0747717108800132
David, H.A., Nagaraja, H.N.: Order Statistics. Wiley, Hoboken (2003)
Felzenszwalb, P.F., McAuley, J.J.: Fast inference with min-sum matrix product. IEEE Transactions on Pattern Analysis and Machine Intelligence 33(12), 2549–2554 (2011)
Fredman, M.L.: On the decision tree complexity of the shortest path problems. In: Proc. 16th FOCS, pp. 98–99 (1975)
Fredman, M.L.: New bounds on the complexity of the shortest path problems. SIAM Journal on Computing 5(1), 83–89 (1976)
Han, Y.: An \({O}(n^3(\log \log {n}/ \log {n})^{5/4})\) time algorithm for all pairs shortest paths. Algorithmica 51(4), 428–434 (2008)
Han, Y., Takaoka, T.: An \({O}(n^3 \log {} \log {n} / \log ^2 {n})\) time algorithm for all pairs shortest paths. In: Proc. 13th SWAT (2012)
Karger, D., Koller, D., Phillips, S.: Finding the hidden path: time bounds for all-pairs shortest paths. SIAM Journal on Computing 22(6), 1199–1217 (1993)
McAuley, J.J., Caetano, T.S.: Exploiting within-clique factorizations in junction-tree algorithms. Journal of Machine Learning Research - Proceedings Track 9, 525–532 (2010)
McGeoch, C.: All-pairs shortest paths and the essential subgraph. Algorithmica 13(5), 426–441 (1995)
Mehlhorn, K., Priebe, V.: On the all-pairs shortest-path algorithm of Moffat and Takaoka. Random Structures and Algorithms 10(1–2), 205–220 (1997)
Moffat, A., Takaoka, T.: An all pairs shortest path algorithm with expected time \({O}(n^2 \log {n})\). SIAM Journal on Computing 16(6), 1023–1031 (1987)
Peres, Y., Sotnikov, D., Sudakov, B., Zwick, U.: All-pairs shortest paths in \({O}(n^{2})\) time with high probability. In: Proc. 51th FOCS, pp. 663–672 (2010)
Spira, P.M.: A new algorithm for finding all shortest paths in a graph of positive arcs in average time \({O(n^{2} {\rm {log}}^{2} n)}\). SIAM Journal on Computing 2(1), 28–32 (1973). http://link.aip.org/link/?SMJ/2/28/1
Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik 13(4), 354–356 (1969). http://dx.doi.org/10.1007/BF02165411
Takaoka, T.: Efficient algorithms for the maximum subarray problem by distance matrix multiplication. Electronic Notes in Theoretical Computer Science 61, 191–200 (2002).http://www.sciencedirect.com/science/article/pii/S1571066104003135
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Fong, K., Li, M., Liang, H., Yang, L., Yuan, H. (2014). Average-Case Complexity of the Min-Sum Matrix Product Problem. In: Ahn, HK., Shin, CS. (eds) Algorithms and Computation. ISAAC 2014. Lecture Notes in Computer Science(), vol 8889. Springer, Cham. https://doi.org/10.1007/978-3-319-13075-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-13075-0_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13074-3
Online ISBN: 978-3-319-13075-0
eBook Packages: Computer ScienceComputer Science (R0)