arXiv (All)
open access
Making Tensor Decoupling More Robust and Less Parametric
Tensor decoupling algorithms recover compact representations of multivariate functions by combining linear factor matrices with univariate internal nonlinearities. We identify two limitations of recent methods. First, their performance is not invariant to mismatched output or gradient magnitudes, an
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Compressing multivariate functions with tree tensor networks#617772
- Compressing multivariate functions with tree tensor networks#617272
- ReLATE: Accelerating Tensor Decomposition via Safe and Efficient Learning of Sparse Encodings#677415
- ReLATE: Accelerating Tensor Decomposition via Safe and Efficient Learning of Sparse Encodings#674218
- Tensor CUR Decomposition under the Linear-Map-Based Tensor-Tensor Multiplication#984983
Record · ID 1341819
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive