The DOI matches its Crossref record; 106 of the 106 references it cites were found in a registry or an index.
Tensor Decomposition for Signal Processing and Machine Learning
Open accessAbstract
Tensors or multiway arrays are functions of three or more indices (i, j, k, . . . )-similar to matrices (two-way arrays), which are functions of two indices (r, c) for (row, column). Tensors have a rich history, stretching over almost a century, and touching upon numerous disciplines; but they have only recently become ubiquitous in signal and data analytics at the confluence of signal processing, statistics, data mining, and machine learning. This overview article aims to provide a good starting point for researchers and practitioners interested in learning about and working with tensors. As such, it focuses on fundamentals and motivation (using various application examples), aiming to strike an appropriate balance of breadth and depth that will enable someone having taken first graduate courses in matrix algebra and probability to get started doing research and/or developing tensor algorithms and software. Some background in applied optimization is useful but not strictly required. The material covered includes tensor rank and rank decomposition; basic tensor factorization models and their relationships and properties (including fairly good coverage of identifiability); broad coverage of algorithms ranging from alternating optimization to stochastic gradient; statistical performance analysis; and applications ranging from source separation to collaborative filtering, mixture and topic modeling, classification, and multilinear subspace learning.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Fundamentals of Statistical Signal Processing: Estimation Theory
Sengijpta, S. K. (1995) · Technometrics · doi:10.1080/00401706.1995.10484391 · Cited by 11,076
Tensor Decompositions and Applications
Kolda, T. G., & Bader, B. W. (2009) · SIAM Review · doi:10.1137/07070111x · Cited by 10,301
(2006) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-0-387-40065-5 · Cited by 9,008
Carroll, J. D., & Chang, J.-J. (1970) · Psychometrika · doi:10.1007/bf02310791 · Cited by 4,678
A Multilinear Singular Value Decomposition
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479896305696 · Cited by 4,106
Self-citationParikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., & Parrilo, P. A. (2010) · SIAM Review · doi:10.1137/070697835 · Cited by 3,471
Rendle, S. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.127 · Cited by 3,189
PARAFAC. Tutorial and applications
Bro, R. (1997) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(97)00032-4 · Cited by 2,814
A blind source separation technique using second-order statistics
Belouchrani, A., Abed-Meraim, K., Cardoso, J.-F., & Moulines, E. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.554307 · Cited by 2,775
Oseledets, I. V. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090752286 · Cited by 2,636
Harshman, R. A. (1970) · Cited by 2,255
Parlar, M. (2000) · Interactive Operations Research with Maple · doi:10.1007/978-1-4612-1356-7_5 · Cited by 1,741
Kruskal, J. B. (1977) · Linear Algebra and its Applications · doi:10.1016/0024-3795(77)90069-6 · Cited by 1,619
On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2000) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479898346995 · Cited by 1,567
Self-citationHandbook of Blind Source Separation, Independent Component Analysis and Applications
Comon, P., & Jutten, C. (2010) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 1,501
Petersen, K. B., & Pedersen, M. S. (2012) · doi:10.5281/zenodo.8002926 · Cited by 1,434
Cichocki, A., Mandic, D., De Lathauwer, L., Zhou, G., Zhao, Q., Caiafa, C., & PHAN, H. A. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2297439 · Cited by 1,384
Self-citationThe Expression of a Tensor or a Polyadic as a Sum of Products
Hitchcock, F. L. (1927) · Journal of Mathematics and Physics · doi:10.1002/sapm192761164 · Cited by 1,345
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Multimodal Data Fusion: An Overview of Methods, Challenges, and Prospects
Lahat, D., Adali, T., & Jutten, C. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2460697 · Cited by 1,296
Andersson, C. A., & Bro, R. (2000) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(00)00071-x · Cited by 1,229
Efficient projections onto the l1-ball for learning in high dimensions
Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390191 · Cited by 1,184
Multi‐Way Analysis with Applications in the Chemical Sciences
Smilde, A., Bro, R., & Geladi, P. (2004) · Wiley eBooks · doi:10.1002/0470012110 · Cited by 1,176
Most Tensor Problems Are NP-Hard
Hillar, C. J., & Lim, L.-H. (2013) · Journal of the ACM · doi:10.1145/2512329 · Cited by 1,099
ESPRIT--A subspace rotation approach to estimation of parameters of cisoids in noise
Roy, R., Paulraj, A., & Kailath, T. (1986) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1986.1164935 · Cited by 1,088
Multilinear Analysis of Image Ensembles: TensorFaces
Vasilescu, M. A. O., & Terzopoulos, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-47969-4_30 · Cited by 836
Tensor decompositions for learning latent variable models
(2012) · arXiv (Cornell University) · doi:10.5555/2627435.2697055 · Cited by 779
Karatzoglou, A., Amatriain, X., Baltrunas, L., & Oliver, N. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864727 · Cited by 721
Polynomial interpolation in several variables
Gasca, M., & Sauer, T. (2000) · Advances in Computational Mathematics · doi:10.1023/a:1018981505752 · Cited by 697
Tensors: Geometry and Applications
Landsberg, J. (2011) · Graduate Studies in Mathematics · doi:10.1090/gsm/128 · Cited by 623
Tensor Spaces and Numerical Tensor Calculus
Hackbusch, W. (2012) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-28027-6 · Cited by 607
Temporal Collaborative Filtering with Bayesian Probabilistic Tensor Factorization
Xiong, L., Chen, X., Huang, T.-K., Schneider, J., & Carbonell, J. G. (2010) · Proceedings of the 2010 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972801.19 · Cited by 585
Håstad, J. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90014-6 · Cited by 584
A literature survey of low‐rank tensor approximation techniques
Grasedyck, L., Kressner, D., & Tobler, C. (2013) · GAMM-Mitteilungen · doi:10.1002/gamm.201310004 · Cited by 577
Blind PARAFAC receivers for DS-CDMA systems
Sidiropoulos, N. D., Giannakis, G. B., & Bro, R. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.824675 · Cited by 560
Self-citationAn analytical constant modulus algorithm
van der Veen, A.-J., & Paulraj, A. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.502327 · Cited by 526
On the uniqueness of multilinear decomposition ofN-way arrays
Sidiropoulos, N. D., & Bro, R. (2000) · Journal of Chemometrics · doi:10.1002/1099-128x(200005/06)14:3<229::aid-cem587>3.0.co;2-n · Cited by 525
Self-citationA theory of pseudoskeleton approximations
Goreinov, S. A., Tyrtyshnikov, E. E., & Замарашкин, Н. Л. (1997) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(96)00301-1 · Cited by 498
Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
De Lathauwer, L. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/070690729 · Cited by 479
Self-citationUnsupervised Multiway Data Analysis: A Literature Survey
Acar, E., & Yener, B. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.112 · Cited by 434
De Lathauwer, L. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040608830 · Cited by 419
Self-citationYeredor, A. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.1011195 · Cited by 397
A comparison of algorithms for fitting the PARAFAC model
Tomasi, G., & Bro, R. (2006) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2004.11.013 · Cited by 372
A survey of multilinear subspace learning for tensor data
Lu, H., Plataniotis, K. N., & Venetsanopoulos, A. N. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2011.01.004 · Cited by 357
Tensors for Data Mining and Data Fusion: Models, Applications, and Scalable Algorithms
Papalexakis, E. E., Faloutsos, C., & Sidiropoulos, N. D. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2915921 · Cited by 354
Self-citationTensors : A brief introduction
Comon, P. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2298533 · Cited by 347
Multilinear Discriminant Analysis for Face Recognition
Yan, S., Xu, D., Yang, Q., Zhang, L., Tang, X., & Zhang, H.-J. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.884929 · Cited by 340
Lower bounds for parametric estimation with constraints
Gorman, J. D., & Hero, A. O. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.59929 · Cited by 332
Cattell, R. B. (1944) · Psychometrika · doi:10.1007/bf02288739 · Cited by 279
Sorber, L., Van Barel, M., & De Lathauwer, L. (2013) · SIAM Journal on Optimization · doi:10.1137/120868323 · Cited by 273
Self-citationNon-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
Huang, K., Sidiropoulos, N. D., & Swami, A. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2285514 · Cited by 264
Self-citationHigher-Order Web Link Analysis Using Multilinear Algebra
Kolda, T. G., Bader, B. W., & Kenny, J. P. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.77 · Cited by 252
Learning mixtures of spherical gaussians: moment methods and spectral decompositions
Hsu, D., & Kakade, S. M. (2013) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2422436.2422439 · Cited by 251
Applications of tensor (multiway array) factorizations and decompositions in data mining
Mørup, M. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1 · Cited by 244
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Kang, U., Papalexakis, E., Harpale, A., & Faloutsos, C. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339583 · Cited by 238
Self-citationAll-at-once Optimization for Coupled Matrix and Tensor Factorizations
Acar, E., Kolda, T. G., & Dunlavy, D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1105.3422 · Cited by 233
On Kruskal’s uniqueness condition for the Candecomp/Parafac decomposition
Stegeman, A., & Sidiropoulos, N. D. (2007) · Linear Algebra and its Applications · doi:10.1016/j.laa.2006.08.010 · Cited by 228
Self-citationRank and optimal computation of generic tensors
Strassen, V. (1983) · Linear Algebra and its Applications · doi:10.1016/0024-3795(83)80041-x · Cited by 222
Sorber, L., Van Barel, M., & De Lathauwer, L. (2015) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2015.2400415 · Cited by 209
Self-citationSPLATT: Efficient and Parallel Sparse Tensor-Matrix Multiplication
Smith, S., Ravindran, N., Sidiropoulos, N. D., & Karypis, G. (2015) · 2015 IEEE International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps.2015.27 · Cited by 206
Self-citationCramer-Rao lower bounds for low-rank decomposition of multidimensional arrays
Liu, X., & Sidiropoulos, N. D. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.942635 · Cited by 206
Self-citationAdaptive Algorithms to Track the PARAFAC Decomposition of a Third-Order Tensor
Nion, D., & Sidiropoulos, N. D. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016885 · Cited by 201
Self-citationJiang, T., & Sidiropoulos, N. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.832022 · Cited by 185
Self-citationNonnegative approximations of nonnegative tensors
Lim, L., & Comon, P. (2009) · Journal of Chemometrics · doi:10.1002/cem.1244 · Cited by 183
Vervliet, N., Debals, O., Sorber, L., & De Lathauwer, L. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2329429 · Cited by 179
Self-citationLeast squares algorithms under unimodality and non-negativity constraints
Bro, R., & Sidiropoulos, N. D. (1998) · Journal of Chemometrics · doi:10.1002/(sici)1099-128x(199807/08)12:4 · Cited by 176
Self-citationA Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
Huang, K., Sidiropoulos, N. D., & Liavas, A. P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2576427 · Cited by 172
Self-citationModeling and Multiway Analysis of Chatroom Tensors
Acar, E., Camtepe, S. A., Krishnamoorthy, M. S., & Yener, B. (2005) · Lecture notes in computer science · doi:10.1007/11427995_21 · Cited by 170
ParCube: Sparse Parallelizable Tensor Decompositions
Papalexakis, E. E., Faloutsos, C., & Sidiropoulos, N. D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33460-3_39 · Cited by 162
Self-citationDomanov, I., & Lathauwer, L. D. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/120877258 · Cited by 155
The TOPHITS Model for Higher-Order Web Link Analysis∗
Kolda, T. G., & Bader, B. W. (2006) · Cited by 153
Fast Alternating LS Algorithms for High Order CANDECOMP/PARAFAC Tensor Factorizations
Phan, A. H., Tichavský, P., & Cichocki, A. S. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2269903 · Cited by 150
Determination and Proof of Minimum Uniqueness Conditions for PARAFAC1
Harshman, R. A. (1972) · Cited by 143
Lathauwer, L. D. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/100805510 · Cited by 136
DFacTo: Distributed Factorization of TensorsPreprint
Choi, J. H., & Vishwanathan, S. V. N. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.4519 · Cited by 131
Domanov, I., & Lathauwer, L. D. (2014) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/130916084 · Cited by 124
Robust iterative fitting of multilinear models
Vorobyov, S. A., Rong, Y., Sidiropoulos, N. D., et al. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.850343 · Cited by 123
Self-citationLiavas, A. P., & Sidiropoulos, N. D. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2454476 · Cited by 122
Self-citationSørensen, M., & Lathauwer, L. D. (2015) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/140956853 · Cited by 121
Ishteva, M. K., Absil, P.-A., Huffel, S. V., & Lathauwer, L. D. (2011) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/090764827 · Cited by 120
Quasi-Newton Methods on Grassmannians and Multilinear Approximations of Tensors
Savas, B., & Lim, L. (2010) · SIAM Journal on Scientific Computing · doi:10.1137/090763172 · Cited by 116
F lexi F a CT: Scalable Flexible Factorization of Coupled Tensors on Hadoop
Beutel, A., Talukdar, P. P., Kumar, A., et al. (2014) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611973440.13 · Cited by 107
Understanding data fusion within the framework of coupled matrix and tensor factorizations
Acar, E., Rasmussen, M. A., Savorani, F., Næs, T., & Bro, R. (2013) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/j.chemolab.2013.06.006 · Cited by 107
An Algorithm For Generic and Low-Rank Specific Identifiability of Complex Tensors
Chiantini, L., Ottaviani, G., & Vannieuwenhoven, N. (2014) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/140961389 · Cited by 107
Tensor-CUR Decompositions for Tensor-Based Data
Mahoney, M. W., Maggioni, M., & Petros Drineas, B. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/060665336 · Cited by 104
Domanov, I., & Lathauwer, L. D. (2016) · Linear Algebra and its Applications · doi:10.1016/j.laa.2016.10.019 · Cited by 89
A Randomized Block Sampling Approach to Canonical Polyadic Decomposition of Large-Scale Tensors
Vervliet, N., & Lathauwer, L. D. (2015) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2015.2503260 · Cited by 81
On generic identifiability of symmetric tensors of subgeneric rank
Chiantini, L., Ottaviani, G., & Vannieuwenhoven, N. (2015) · Transactions of the American Mathematical Society · doi:10.1090/tran/6762 · Cited by 79
On the Constrained CramÉr–Rao Bound With a Singular Fisher Information Matrix
Ben‐Haim, Z., & Eldar, Y. C. (2009) · IEEE Signal Processing Letters · doi:10.1109/lsp.2009.2016831 · Cited by 77
Generic Uniqueness Conditions for the Canonical Polyadic Decomposition and INDSCAL
Domanov, I., & Lathauwer, L. D. (2015) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/140970276 · Cited by 76
Sidiropoulos, N. D., Papalexakis, E. E., & Faloutsos, C. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2329196 · Cited by 69
Self-citationGeneralizing Caratheodory's uniqueness of harmonic parameterization to N dimensions
Sidiropoulos, N. D. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.923759 · Cited by 53
Self-citationTurbo-SMT: Accelerating Coupled Sparse Matrix-Tensor Factorizations by 200x
Papalexakis, E. E., Faloutsos, C., Mitchell, T. M., Talukdar, P. P., Sidiropoulos, N. D., & Murphy, B. (2014) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611973440.14 · Cited by 52
Self-citationGuo, X., Miron, S., Brie, D., & Stegeman, A. (2012) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110825765 · Cited by 47
Stegeman, A., & de Almeida, A. L. F. (2009) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/080743354 · Cited by 35
On Convergence of the Maximum Block Improvement Method
Li, Z., Uschmajew, A., & Zhang, S. (2015) · SIAM Journal on Optimization · doi:10.1137/130939110 · Cited by 35
Phase Retrieval Using Feasible Point Pursuit: Algorithms and Cramér–Rao Bound
Qian, C., Sidiropoulos, N. D., Huang, K., Huang, L., & So, H. C. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2593688 · Cited by 35
Self-citationMemory-efficient parallel computation of tensor and matrix products for big tensor decomposition
Ravindran, N., Sidiropoulos, N. D., Smith, S., & Karypis, G. (2014) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2014.7094512 · Cited by 33
Self-citationVannieuwenhoven, N., Meerbergen, K., & Vandebril, R. (2015) · SIAM Journal on Scientific Computing · doi:10.1137/14097968x · Cited by 30
Anandkumar, A., HsuDaniel, JanzaminMajid, & KakadeSham (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1308.2853 · Cited by 28
Improved Uniqueness Conditions for Canonical Tensor Decompositions with Linearly Dependent Loadings
Stegeman, A., & Lam, T. T. T. (2012) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110847275 · Cited by 10
Vannieuwenhoven, N., Vandebril, R., & Meerbergen, K. (2014) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drt069 · Cited by 6
Cited by
Channel Estimation for RIS-Aided Multiuser Millimeter-Wave Systems
Zhou, G., Pan, C., Ren, H., Popovski, P., & Swindlehurst, A. L. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3158024 · Cited by 326
Market segmentation and travel choice prediction in Spa hotels through TripAdvisor’s online reviews
Ahani, A., Nilashi, M., Ibrahim, O., Sanzogni, L., & Weaven, S. (2019) · International Journal of Hospitality Management · doi:10.1016/j.ijhm.2019.01.003 · Cited by 262
Tensor Network Contractions: Methods and Applications to Quantum Many-Body Systems
Ran, S.-J., Tirrito, E., Peng, C., Chen, X., Tagliacozzo, L., Su, G., & Lewenstein, M. (2020) · Lecture Notes in Physics · doi:10.1007/978-3-030-34489-4 · Cited by 176
Neural Architecture Search for Transformers: A Survey
Chitty-Venkata, K. T., Emani, M., Vishwanath, V., & Somani, A. K. (2022) · IEEE Access · doi:10.1109/access.2022.3212767 · Cited by 118
Lightspeech: Lightweight and Fast Text to Speech with Neural Architecture Search
Luo, R., Tan, X., Wang, R., Qin, T., Li, J., Zhao, S., Chen, E., & Liu, T.-Y. (2021) · ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp39728.2021.9414403 · Cited by 67
Metadata
- Authors
- Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2017-07-01
- Volume
- 65
- Issue
- 13
- Pages
- 3551-3582
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2469230926
- Cited by
- 1,617
- References
- 106
- FWCI
- 53.94
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.