Rademacher Random Projections with Tensor Networks
원문 초록
Random projection (RP) have recently emerged as popular techniques in the machine learning community for their ability in reducing the dimension of very high-dimensional tensors. Following the work in [30], we consider a tensorized random projection relying on Tensor Train (TT) decomposition where each element of the core tensors is drawn from a Rademacher distribution. Our theoretical results reveal that the Gaussian low-rank tensor represented in compressed form in TT format in [30] can be replaced by a TT tensor with core elements drawn from a Rademacher distribution with the same embedding size. Experiments on synthetic data demonstrate that tensorized Rademacher RP can outperform the tensorized Gaussian RP studied in [30]. In addition, we show both theoretically and experimentally, that the tensorized RP in the Matrix Product Operator (MPO) format is not a Johnson-Lindenstrauss transform (JLT) and therefore not a well-suited random projection map
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A tensor network approach for chaotic time series prediction
Quantum Methods for Managing Ambiguity in Natural Language Processing
tn4ml: Tensor Network Training and Customization for Machine Learning
Comb Tensor Networks vs. Matrix Product States: Enhanced Efficiency in High-Dimensional Spaces
LTNtorch: PyTorch Implementation of Logic Tensor Networks
Learning out-of-time-ordered correlators with classical kernel methods
토론
이 논문과 연결된 포럼 글이 아직 없습니다.