Fetching the paper…
Reading the bibliography…
1901
Earlier work this paper cites.
1906
Earlier work this paper cites.
1910
Earlier work this paper cites.
Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval research logistics quarterly, 2(1-2), 83-97
1955
Earlier work this paper cites.
Golub, G. H., & Reinsch, C. (1971). Singular value decomposition and least squares solutions. In Handbook for Automatic Computation: Volume II: Linear Algebra (pp. 134-151). Berlin, Heidelberg: Springer Berlin Heidelberg
1971
Earlier work this paper cites.
2002
Earlier work this paper cites.
Oseledets, I. V. (2011). Tensor-Train decomposition. SIAM Journal on Scientific Computing, 33(5), 2295-2317
2011
Earlier work this paper cites.
2015
Earlier work this paper cites.
Novikov, A., Podoprikhin, D., Osokin, A., & Vetrov, D. P. (2015). Tensorizing neural networks. Advances in neural information processing systems, 28
2015
Earlier work this paper cites.
Wu, J. N. (2016, February). Compression of fully-connected layer in neural network by Kronecker product. In 2016 Eighth International Conference on Advanced Computational Intelligence (ICACI) (pp. 173-179). IEEE
2016
Cited alongside, same era.
Atteya, M. J. (2016). Kronecker product with applications. MJ J. Algebra Appl., 1, 1-4
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., & Sutskever, I. (2019). Language models are unsupervised multitask learners. OpenAI blog, 1(8), 9
2019
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
Qu, Z., Deng, L., Wang, B., Chen, H., Lin, J., Liang, L., Li, G., Zhang, Z. & Xie, Y. (2021). Hardware-enabled efficient data processing with Tensor-Train decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 41(2), 372-385
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
Bougleux, S., Gaüzere, B., & Brun, L. (2017). A Hungarian algorithm for error-correcting graph matching. In Graph-Based Representations in Pattern Recognition: 11th IAPR-TC-15 International Workshop, GbRPR 2017, Anacapri, Italy, May 16–18, 2017, Proceedings 11 (pp. 118-127). Springer International Publishing
2017
Cited alongside, same era.
2018
Cited alongside, same era.
Gokaslan, A., & Cohen, V. (2019) OpenWebText corpus. http://Skylion007.github.io/OpenWebTextCorpus
2019
Cited alongside, same era.
2022
Later among the works it cites.
Kwon, W., Kim, S., Mahoney, M. W., Hassoun, J., Keutzer, K., & Gholami, A. (2022). A fast post-training pruning framework for transformers. Advances in Neural Information Processing Systems, 35, 24101-24116
2022
Later among the works it cites.
Lykov, D., Schutski, R., Galda, A., Vinokur, V., & Alexeev, Y. (2022, September). Tensor network quantum simulator with step-dependent parallelization. In 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) (pp. 582-593). IEEE
2022
Later among the works it cites.
Xiao, G., Lin, J., Seznec, M., Wu, H., Demouth, J., & Han, S. (2023, July). Smoothquant: Accurate and efficient post-training quantization for large language models. In International Conference on Machine Learning (pp. 38087-38099). PMLR
2023
Later among the works it cites.