3 papers
math.NA2025
Scalable Binary CUR Low-Rank Approximation Algorithm
Bowen Su
This paper proposes a scalable binary CUR low-rank approximation algorithm that leverages parallel selection of representative rows and columns within a deterministic framework. By…
cs.LG2024
Guaranteed Sampling Flexibility for Low-tubal-rank Tensor Completion
Bowen Su, Juntao You, HanQin Cai +1
While Bernoulli sampling is extensively studied in tensor completion, t-CUR sampling approximates low-tubal-rank tensors via lateral and horizontal subtensors. However, both method…
stat.ML2024
On the Robustness of Cross-Concentrated Sampling for Matrix Completion
HanQin Cai, Longxiu Huang, Chandra Kundu +1
Matrix completion is one of the crucial tools in modern data science research. Recently, a novel sampling model for matrix completion coined cross-concentrated sampling (CCS) has c…