AI Paper Atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

High-Rank Irreducible Cartesian Tensor Decomposition and Bases of Equivariant Spaces

Shihao Shao, Yikang Li, Zhouchen Lin, Qinghua Cui

JMLR 2025 · Learning theory and algorithms › Matrix and tensor methods · approach: Tensor network decompositions · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
replace the RREF-based, full-permutation ICT decomposition with analytical path matrices from the parentage schemeICT decomposition · maximum tensor rankmaximum rank reached: 5 -> 9Improved
use path matrices instead of the prior natural-tensor mappingICT decomposition matrices · orthogonality of decompositionorthogonality: No -> YesImproved
increase tensor rank from 5 to 9 when generating decomposition matricespath-matrix method · generation timetime: <0.1s -> 1s -> 3s -> 11s -> 4m32sHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy