Bhisham Dev Verma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bhisham Dev Verma has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Rameshwar Pratap
Indian Institute of Technology Hyderabad Telangana India
9 shared publications - Manoj Thakur
School of Mathematical and Statistical Sciences, Indian Institute of Technology Mandi, Mandi, India
4 shared publications - Debajyoti Bera
Indraprastha Institute of Information Technology Delhi
3 shared publications - Grey Ballard
Department of Computer Science, Wake Forest University, Winston-Salem, NC 27106 USA
3 shared publications Punit Pankaj Dubey
Indian Inst Technol Mandi, Mandi, Himachal Prades, India
2 shared publicationsAlex Zhang
Wake Forest University, Winston-Salem, NC 27109 USA
1 shared publication
Latest Publications
- Open Access
- 29 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
Mixed Precision Compression of Tucker Decomposition
We present a mixed precision approach for improving Tucker-based lossy compression of multiway data. Current Tucker decomposition algorithms use a uniform floating-point precision and obtain compression by minimizing the multilinear ranks of the representation subject to the target error tolerance. Our algorithm automatically determines which parameters of the representation can be stored in lower precision to improve the compression ratio without exceeding the error tolerance. Crucially, we show that the opportunities to reduce precision are not uniform across parameters, and thus using multiple precisions allows for smoothly transitioning across tolerances between the precisions of standard formats. Theoretical error bounds and numerical experiments validate the approach, and we obtain up to \(2\times\) and \(4\times\) compression improvement factors over initial Tucker approximations of single and double precision real-world numerical simulation data, respectively.- 29 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
Open AccessMixed Precision Compression of Tucker Decomposition
We present a mixed precision approach for improving Tucker-based lossy compression of multiway data. Current Tucker decomposition algorithms use a uniform floating-point precision and obtain compression by minimizing the multilinear ranks of the representation subject to the target error tolerance. Our algorithm automatically determines which parameters of the representation can be stored in lower precision to improve the compression ratio without exceeding the error tolerance. Crucially, we show that the opportunities to reduce precision are not uniform across parameters, and thus using multiple precisions allows for smoothly transitioning across tolerances between the precisions of standard formats. Theoretical error bounds and numerical experiments validate the approach, and we obtain up to \(2\times\) and \(4\times\) compression improvement factors over initial Tucker approximations of single and double precision real-world numerical simulation data, respectively. - 13 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (5) , A2959-A2985
Adaptive Randomized Tensor Train Rounding Using Khatri–Rao Products
Approximating a tensor in the tensor train (TT) format has many important applications in scientific computing. Rounding a TT tensor involves further compressing a tensor that is already in the TT format. This paper proposes new randomized algorithms for TT-rounding that use sketches based on Khatri-Rao products (KRP). When the TT-ranks are known in advance, the proposed methods are comparable in cost to the sketches that used a sketching matrix in the TT-format [Al Daas et al., SIAM J. Sci. Comput., 45 (2023), pp. A74–A95]. However, the use of KRP sketches enables adaptive algorithms to round the tensor in the TT-format within a fixed user-specified tolerance. An important component of the adaptivity is the estimation of error using KRP sketching, for which we develop theoretical guarantees. We report numerical experiments on synthetic tensors, parametric low-rank kernel approximations, and the solution of parametric partial differential equations. The numerical experiments show that we obtain speed-ups of up to [Formula: see text] compared to deterministic TT-rounding. Both the computational cost analysis and numerical experiments verify that the adaptive algorithms are competitive with the fixed-rank algorithms, suggesting that adaptivity has a small overhead. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/bhisham123/TT-Rounding-using-KRP-structure.git and in the supplementary materials ( M181708_Supplementary_Materials_1.pdf [459KB], TT-Rounding-using-KRP-structure-main.zip [12.8MB]). [Formula: see text]
- 13 October 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 48 (5) , A2959-A2985
Adaptive Randomized Tensor Train Rounding Using Khatri–Rao Products
Approximating a tensor in the tensor train (TT) format has many important applications in scientific computing. Rounding a TT tensor involves further compressing a tensor that is already in the TT format. This paper proposes new randomized algorithms for TT-rounding that use sketches based on Khatri-Rao products (KRP). When the TT-ranks are known in advance, the proposed methods are comparable in cost to the sketches that used a sketching matrix in the TT-format [Al Daas et al., SIAM J. Sci. Comput., 45 (2023), pp. A74–A95]. However, the use of KRP sketches enables adaptive algorithms to round the tensor in the TT-format within a fixed user-specified tolerance. An important component of the adaptivity is the estimation of error using KRP sketching, for which we develop theoretical guarantees. We report numerical experiments on synthetic tensors, parametric low-rank kernel approximations, and the solution of parametric partial differential equations. The numerical experiments show that we obtain speed-ups of up to [Formula: see text] compared to deterministic TT-rounding. Both the computational cost analysis and numerical experiments verify that the adaptive algorithms are competitive with the fixed-rank algorithms, suggesting that adaptivity has a small overhead. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/bhisham123/TT-Rounding-using-KRP-structure.git and in the supplementary materials ( M181708_Supplementary_Materials_1.pdf [459KB], TT-Rounding-using-KRP-structure-main.zip [12.8MB]). [Formula: see text]
- 16 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 47 (2) , 544-563
Efficient CP Rounding Using Alternating Least Squares with QR Decomposition
The CANDECOMP/PARAFAC (CP) decomposition is widely used for analyzing multidimensional data, and the alternating least squares (CP-ALS) algorithm is a common method for its computation. CP rounding is the problem of computing a lower-rank CP decomposition of an input already in a higher-rank CP format. While the normal equations (NE) approach in CP-ALS is efficient for the CP rounding problem and frequently used, it becomes unstable in the presence of ill-conditioned subproblems. This paper presents a new QR-based CP-ALS method for CP rounding that preserves both numerical stability and computational efficiency. Our experiments show that the proposed method offers significant speedup over a previous QR-based approach and the Tensor Toolbox’s NE-based implementation, particularly for higher-order tensors. Furthermore, our approach demonstrates a marked reduction in error for ill-conditioned problems, with error reductions several orders of magnitude smaller compared to the NE-based method, while achieving faster convergence and more accurate solutions. By using a more numerically stable approach, we can solve more problems in reduced working precision, which enables further reduction in time to solution. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/alexz949/CP-Rounding.git . [Formula: see text]
- 16 April 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 47 (2) , 544-563
Efficient CP Rounding Using Alternating Least Squares with QR Decomposition
The CANDECOMP/PARAFAC (CP) decomposition is widely used for analyzing multidimensional data, and the alternating least squares (CP-ALS) algorithm is a common method for its computation. CP rounding is the problem of computing a lower-rank CP decomposition of an input already in a higher-rank CP format. While the normal equations (NE) approach in CP-ALS is efficient for the CP rounding problem and frequently used, it becomes unstable in the presence of ill-conditioned subproblems. This paper presents a new QR-based CP-ALS method for CP rounding that preserves both numerical stability and computational efficiency. Our experiments show that the proposed method offers significant speedup over a previous QR-based approach and the Tensor Toolbox’s NE-based implementation, particularly for higher-order tensors. Furthermore, our approach demonstrates a marked reduction in error for ill-conditioned problems, with error reductions several orders of magnitude smaller compared to the NE-based method, while achieving faster convergence and more accurate solutions. By using a more numerically stable approach, we can solve more problems in reduced working precision, which enables further reduction in time to solution. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/alexz949/CP-Rounding.git . [Formula: see text]
- Open Access
Stochastic Trace and Diagonal Estimator for Tensors
We consider the problem of estimating the trace and diagonal entries of an N-order tensor (where $N \geq 2$) under the framework where the tensor can only be accessed through tensor-vector multiplication. The aim is to estimate the tensor's diagonal entries and trace by minimizing the number of tensor-vector queries. The seminal work of Hutchinson and its extended version due to Bekas et al. give unbiased estimates of the trace and diagonal elements of a given matrix, respectively, using matrix-vector queries. However, to the best of our knowledge, no analogous results are known for estimating the trace and diagonal entries of higher-order tensors using tensor-vector queries. This paper addresses this gap and presents unbiased estimators for the trace and diagonal entries of a tensor under this model. Our proposed methods can be seen as generalizations of Hutchinson's and Bekas et al.'s estimators and reduce to their estimators when N = 2. We provide a rigorous theoretical analysis of our proposals and complement it with supporting simulations.
Open AccessStochastic Trace and Diagonal Estimator for Tensors
We consider the problem of estimating the trace and diagonal entries of an N-order tensor (where $N \geq 2$) under the framework where the tensor can only be accessed through tensor-vector multiplication. The aim is to estimate the tensor's diagonal entries and trace by minimizing the number of tensor-vector queries. The seminal work of Hutchinson and its extended version due to Bekas et al. give unbiased estimates of the trace and diagonal elements of a given matrix, respectively, using matrix-vector queries. However, to the best of our knowledge, no analogous results are known for estimating the trace and diagonal entries of higher-order tensors using tensor-vector queries. This paper addresses this gap and presents unbiased estimators for the trace and diagonal entries of a tensor under this model. Our proposed methods can be seen as generalizations of Hutchinson's and Bekas et al.'s estimators and reduce to their estimators when N = 2. We provide a rigorous theoretical analysis of our proposals and complement it with supporting simulations.
- 3 July 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (12) , 1-28
Credibilistic skewness of LR power fuzzy numbers with applications in portfolio selection
- 3 July 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (12) , 1-28
Credibilistic skewness of LR power fuzzy numbers with applications in portfolio selection
- 4 February 2025
- Published by Springer Nature in Acta Informatica
- Vol. 62 (1) , 1-35
Improving LSH via tensorized random projection
- 4 February 2025
- Published by Springer Nature in Acta Informatica
- Vol. 62 (1) , 1-35
Improving LSH via tensorized random projection
- 12 June 2024
- Published by Elsevier in Information Processing Letters
- Vol. 187
Improving compressed matrix multiplication using control variate method
- 12 June 2024
- Published by Elsevier in Information Processing Letters
- Vol. 187
Improving compressed matrix multiplication using control variate method
- 29 February 2024
- Published by Elsevier in Information Processing Letters
- Vol. 186
Sparsifying Count Sketch
- 29 February 2024
- Published by Elsevier in Information Processing Letters
- Vol. 186
Sparsifying Count Sketch
- 17 May 2023
- Published by Elsevier in Information Processing Letters
- Vol. 183
Unbiased estimation of inner product via higher order count sketch
- 17 May 2023
- Published by Elsevier in Information Processing Letters
- Vol. 183
Unbiased estimation of inner product via higher order count sketch
- 2 May 2022
- Published by Springer Nature in Machine Learning
- Vol. 111 (7) , 2631-2662
Variance reduction in feature hashing using MLE and control variate method
- 2 May 2022
- Published by Springer Nature in Machine Learning
- Vol. 111 (7) , 2631-2662
Variance reduction in feature hashing using MLE and control variate method