Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Matrix factorization techniques in machine learning, signal processing, and statistics
Compressed sensing is an alternative to Shannon/Nyquist sampling for acquiring sparse or
compressible signals. Sparse coding represents a signal as a sparse linear combination of …
compressible signals. Sparse coding represents a signal as a sparse linear combination of …
Cross tensor approximation methods for compression and dimensionality reduction
Cross Tensor Approximation (CTA) is a generalization of Cross/skeleton matrix and CUR
Matrix Approximation (CMA) and is a suitable tool for fast low-rank tensor approximation. It …
Matrix Approximation (CMA) and is a suitable tool for fast low-rank tensor approximation. It …
Learned robust PCA: A scalable deep unfolding approach for high-dimensional outlier detection
Robust principal component analysis (RPCA) is a critical tool in modern machine learning,
which detects outliers in the task of low-rank matrix reconstruction. In this paper, we propose …
which detects outliers in the task of low-rank matrix reconstruction. In this paper, we propose …
Matrix completion with cross-concentrated sampling: Bridging uniform sampling and CUR sampling
While uniform sampling has been widely studied in the matrix completion literature, CUR
sampling approximates a low-rank matrix via row and column samples. Unfortunately, both …
sampling approximates a low-rank matrix via row and column samples. Unfortunately, both …
Quantum state tomography for matrix product density operators
The reconstruction of quantum states from experimental measurements, often achieved
using quantum state tomography (QST), is crucial for the verification and benchmarking of …
using quantum state tomography (QST), is crucial for the verification and benchmarking of …
Latent graph inference with limited supervision
Latent graph inference (LGI) aims to jointly learn the underlying graph structure and node
representations from data features. However, existing LGI methods commonly suffer from the …
representations from data features. However, existing LGI methods commonly suffer from the …
Error analysis of tensor-train cross approximation
Tensor train decomposition is widely used in machine learning and quantum physics due to
its concise representation of high-dimensional tensors, overcoming the curse of …
its concise representation of high-dimensional tensors, overcoming the curse of …
Mode-wise tensor decompositions: Multi-dimensional generalizations of CUR decompositions
Low rank tensor approximation is a fundamental tool in modern machine learning and data
science. In this paper, we study the characterization, perturbation analysis, and an efficient …
science. In this paper, we study the characterization, perturbation analysis, and an efficient …
Robust tensor CUR decompositions: Rapid low-tucker-rank tensor recovery with sparse corruptions
We study the tensor robust principal component analysis (TRPCA) problem, a tensorial
extension of matrix robust principal component analysis, which aims to split the given tensor …
extension of matrix robust principal component analysis, which aims to split the given tensor …
Fast robust tensor principal component analysis via fiber CUR decomposition
We study the problem of tensor robust principal component analysis (TRPCA), that aims to
separate an underlying low-multilinear-rank tensor and a sparse outlier tensor from their …
separate an underlying low-multilinear-rank tensor and a sparse outlier tensor from their …