Hanyu Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hanyu Li has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Hu Yang
College of Mathematics and Statistics, Chongqing University, Chongqing, 401331, China
10 shared publications - Shaoxin Wang
School of Statistics Qufu Normal University 273165 Qufu P. R. China
9 shared publications Yanjun Zhang
Chongqing Univ Technol, Dept Stat & Data Sci, Chongqing 400054, Peoples R China
8 shared publications- Mengyu Wang
Department of Statistics and Data Science, School of Economics, Xiamen University, Xiamen, People’s Republic of China
7 shared publications - Yajie Yu
College of Mathematics and Statistics, Chongqing University, Chongqing, P.R. China
7 shared publications Ling Tang
School of Sciences Southwest Petroleum University Chengdu Sichuan P.R. China
6 shared publications
Latest Publications
- 10 November 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (6)
Efficient Deterministic Algorithms for Approximating Tensor–Tensor Multiplication
This article investigates the efficient computation of the tensor–tensor multiplication, that is, t‐product, in streaming settings with limited memory and computational resources. We propose two deterministic sketching algorithms, FD‐ATP and COOD‐ATP. For both methods, we rigorously establish spectral norm error bounds and prove that they achieve a ‐approximation up to a multiplicative factor with respect to the best low‐tubal‐rank approximation of the t‐product. Extensive numerical experiments demonstrate the effectiveness and efficiency of the proposed methods.
- 10 November 2026
- Published by Wiley in Numerical Linear Algebra with Applications
- Vol. 33 (6)
Efficient Deterministic Algorithms for Approximating Tensor–Tensor Multiplication
This article investigates the efficient computation of the tensor–tensor multiplication, that is, t‐product, in streaming settings with limited memory and computational resources. We propose two deterministic sketching algorithms, FD‐ATP and COOD‐ATP. For both methods, we rigorously establish spectral norm error bounds and prove that they achieve a ‐approximation up to a multiplicative factor with respect to the best low‐tubal‐rank approximation of the t‐product. Extensive numerical experiments demonstrate the effectiveness and efficiency of the proposed methods.
- 24 August 2026
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 52 (5) , 71
Block-randomized stochastic methods for tensor ring decomposition
- 24 August 2026
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 52 (5) , 71
Block-randomized stochastic methods for tensor ring decomposition
- 14 August 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 46 (1) , 29
Efficient randomized algorithms for block tensor-tensor multiplication
- 14 August 2026
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 46 (1) , 29
Efficient randomized algorithms for block tensor-tensor multiplication
- Open Access
- 11 April 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (2) , 72
Correction: Accelerated Alternating Least Squares for Tensor Wheel Decomposition with Applications
- 11 April 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (2) , 72
Open AccessCorrection: Accelerated Alternating Least Squares for Tensor Wheel Decomposition with Applications
- 6 April 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (2) , 59
Fast and Accurate Generalized Tensor Network Decomposition
- 6 April 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (2) , 59
Fast and Accurate Generalized Tensor Network Decomposition
- 20 January 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 106 (2) , 54
Accelerated Alternating Least Squares for Tensor Wheel Decomposition with Applications
- 20 January 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 106 (2) , 54
Accelerated Alternating Least Squares for Tensor Wheel Decomposition with Applications
- 26 December 2025
- Published by Springer Nature in Machine Learning
- Vol. 115 (1) , 10
Low-Rank Fully-Connected Tensor Network Learning for Tensor-on-Tensor Regression
- 26 December 2025
- Published by Springer Nature in Machine Learning
- Vol. 115 (1) , 10
Low-Rank Fully-Connected Tensor Network Learning for Tensor-on-Tensor Regression
- 22 September 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 511
On sketch-and-project methods for solving tensor equations
- 22 September 2025
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 511
On sketch-and-project methods for solving tensor equations
- 1 July 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 104 (2) , 1-32
Learnable Transform-based Nonnegative CP Decomposition
- 1 July 2025
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 104 (2) , 1-32
Learnable Transform-based Nonnegative CP Decomposition
- 9 April 2025
- Published by Taylor & Francis in Journal of Applied Statistics
- Vol. 52 (15) , 2894-2923
LPRE estimation for functional multiplicative model and optimal subsampling
In this paper, we study the functional linear multiplicative model based on the least product relative error criterion. Under some regularization conditions, we establish the consistency and asymptotic normality of the estimator. Further, we investigate the optimal subsampling for this model with massive data. Both the consistency and asymptotic distribution of the subsampling estimator are first derived. Then, we obtain the optimal subsampling probabilities based on the A-optimality criterion. Moreover, the useful alternative subsampling probabilities without computing the inverse of the Hessian matrix are also proposed, which are easier to implement in practise. Finally, numerical studies and real data analysis are carried out to evaluate the performance of the proposed approaches.
- 9 April 2025
- Published by Taylor & Francis in Journal of Applied Statistics
- Vol. 52 (15) , 2894-2923
LPRE estimation for functional multiplicative model and optimal subsampling
In this paper, we study the functional linear multiplicative model based on the least product relative error criterion. Under some regularization conditions, we establish the consistency and asymptotic normality of the estimator. Further, we investigate the optimal subsampling for this model with massive data. Both the consistency and asymptotic distribution of the subsampling estimator are first derived. Then, we obtain the optimal subsampling probabilities based on the A-optimality criterion. Moreover, the useful alternative subsampling probabilities without computing the inverse of the Hessian matrix are also proposed, which are easier to implement in practise. Finally, numerical studies and real data analysis are carried out to evaluate the performance of the proposed approaches.