Pith. sign in

REVIEW 3 major objections 4 minor 27 references

Computing with traceable tensor networks

T0 review · 3 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read SVD-based decomposition, addition, and rounding are defined for tensor networks on any graph topology that admits a Hamiltonian path, enabling step-truncation integration of high-dimensional PDEs directly in graph format.

desk verdict A useful new algorithmic idea for tensor network computation, but the central tolerance-control claim for cyclic graphs is heuristic and the numerical comparisons use unoptimized baselines; worth a serious referee but needs revision. read the letter →

arxiv 2608.02849 v1 pith:AHRTDQWF submitted 2026-08-03 physics.comp-ph cs.NAmath.NA

Sarah Ellwein , Daniele Venturi This is my paper · ORCID
classification physics.comp-phcs.NAmath.NA MSC 15A69
keywords tensornetworksgraphSVDdecompositionroundingtrainhierarchicalTuckerFokker-Planckequationstep-truncationtimeintegration
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that a tensor network shaped as any graph with a Hamiltonian path, not just the chains of tensor-train or the trees of hierarchical Tucker, can be decomposed, added, and rounded using SVD-based sweeps. That closes the step-truncation workflow: a time-dependent high-dimensional PDE solution can be advanced and recompressed to a prescribed tolerance entirely inside the graph format, never forming the dense tensor. On multivariate test functions and a four-dimensional Fokker-Planck equation, a barbell-shaped graph matches or beats tensor-train and hierarchical-Tucker accuracy while needing far fewer degrees of freedom, sometimes by factors of hundreds. The authors present the advantage as empirical evidence rather than a theorem, and they flag that their baselines use default, un-optimized arrangements.

What carries the argument

The load-bearing objects are the rank adjacency matrix $\mathbf{R}$, whose diagonal entries are physical mode sizes and whose off-diagonal entries are edge ranks (1 for absent edges), and the traceable (Hamiltonian) path through the network, a path that visits every core exactly once. GTN-SVD builds on FCTN-SVD and uses the SplitRankRule to allocate a truncated-SVD rank among the outgoing bonds of each core. The traceable path turns the graph into a TT-like chain with chords; GTN-Round then runs a QR orthogonalization sweep from right to left and a truncated-SVD compression sweep from left to right along that path, budgeting the threshold $\delta = \varepsilon \|\widetilde{X}\|_F/\sqrt{(p-1)+c}$ over path edges and chords. Addition block-concatenates the path edges while max-concatenating the chords, so chord ranks do not grow during repeated addition.

What would settle it

Re-run the six-dimensional f1 decomposition at $\varepsilon = 10^{-8}$ after optimizing the tensor-train core ordering (e.g., by permutation search) and compare the resulting degrees of freedom with the 47,264 reported for the barbell graph. If the optimized TT representation comes within a small factor of that count, the claimed 334x storage advantage is an artifact of using the default un-optimized TT ordering.

Watch

Extended reading notes

Core claim

The central discovery is that any simple graph tensor network is isomorphic to a fully-connected tensor network whose missing edges have bond dimension one, which lets SVD-based decomposition (GTN-SVD) extend to arbitrary user-specified topologies. For computation, the paper shows that a traceable path through the graph orders the cores into a TT-like spine, and that this spine makes two further operations possible: addition, which block-concatenates path edges and overlays chords at the larger of their two ranks, and rounding, which sweeps right-to-left with QR orthogonalization and left-to-right with truncated SVD. Because chords are frozen during addition while path edges are compressed each step, iterative step-truncation remains stable on cyclic networks. The paper reports that this graph-format integrator solves a 4D Fokker-Planck equation with comparable accuracy to TT and HT at lower degrees of freedom and lower overall runtime.

Load-bearing premise

The reported factor-of-hundreds savings compare the new graph formats against off-the-shelf tensor-train and hierarchical-Tucker codes with their default variable orderings; an optimized reordering of those baselines could shrink or erase the advantage.

Editorial extensions

If this is right

  • Any graph topology that admits a Hamiltonian path becomes usable for computation: tensors can be decomposed into it, added, and rounded entirely in the format.
  • Step-truncation time integration of high-dimensional PDEs can run directly in graph format with rank truncation controlled to a prescribed relative tolerance at every step.
  • In the tested cases, the traceable barbell graph attains comparable or better accuracy than tensor-train and hierarchical Tucker while using dramatically fewer degrees of freedom (a 382x reduction for a 4D function at $\varepsilon=10^{-8}$; a 166x reduction at the first Fokker-Planck step).
  • Repeated addition is stable on cyclic traceable networks because path edges are compressed each step while chord edges are frozen, so chord ranks do not inflate over time.
  • The authors claim the gains as empirical, not universal: there is no theorem that graph formats beat chain or tree formats in general.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial extension: the chord-freezing addition rule suggests a general recipe for any cyclic format: identify a spanning path, concatenate along it, and overlay every other edge, which may let tensor-ring and other looped formats round stably over many steps.
  • Editorial extension: if the GTN advantage is robust, tensor-network structure search should treat the graph topology itself as the optimization variable, not just the mode ordering inside a fixed format, making GTN a natural target format for such searches.
  • Editorial extension: the rounding error budget is deliberately conservative because chords are never compressed; a sharper per-chord criterion could lower the achieved ranks without exceeding the stated tolerance, a directly testable improvement.
  • Editorial extension: because chord ranks freeze during addition, the per-step cost of a traceable GTN integrator should stay nearly constant as the number of steps grows, unlike TT where costs fall as ranks decay; long-time runs could verify whether this changes the crossover point seen in the diffusion experiment.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper develops SVD-based algorithms for tensor networks with arbitrary graph topologies. It first introduces GTN-SVD, which constructs a decomposition in a user-prescribed graph format by viewing the graph as a subgraph of a complete graph and applying a recursive SVD along unfoldings, with an error bound stated in Theorem 1. It then defines addition, Hadamard product, Frobenius norm, and a rounding procedure, GTN-Round, that operates along a Hamiltonian ('traceable') path through the network while leaving chord edges untouched. The authors apply these algorithms to 6D function approximation and to 4D Fokker-Planck step-truncation time integration, reporting that the barbell GTN format uses substantially fewer degrees of freedom than TT and HT at comparable or better accuracy.

Significance. The paper makes a plausible and useful extension of SVD-constructible low-rank formats beyond TT, HT, and TR to arbitrary graph topologies, with rounding and addition restricted to traceable graphs. The GTN-SVD error bound in Theorem 1 is a genuine contribution, and the addition rule that freezes chord ranks is a sensible mechanism for keeping cyclic networks stable under step truncation. The paper is also honest about the heuristic nature of the rank-splitting rule, the heuristic rounding error control, and the unoptimized TT/HT baselines. If the two load-bearing gaps identified below are resolved, the work would be a significant step toward topology-adaptive tensor computations for high-dimensional PDEs.

major comments (3)
  1. [§3.4, Eq. (24), Algorithm 3] The claim that GTN-Round controls the truncation error to a prescribed tolerance at every step is not established. After the QR sweep, a bond on the traceable path has, to its right, a subnetwork that contains chord edges and is therefore generally not an isometry; the discarded singular-value tail can be amplified when the remainder of the network is contracted. Setting delta = eps ||X~||_F / sqrt((p-1)+c) in Eq. (24) does not repair this, because the budget for chord truncations is not tied to any bound on the amplification factor. The paper itself explicitly calls the procedure heuristic and says the error remains below tolerance only 'in practice, uniformly across the topologies we tested.' This matters because the abstract and the output contract of Algorithm 3 assert per-step tolerance control. Please either prove a per-step error bound under explicit assumptions on the chord cores, or remove the prescribed-tolerance claim from the abstract and algorithm contract and add a per-step empirical error diagnostic for the cyclic cases.
  2. [Algorithm 1 and Theorem 1] Algorithm 1 computes truncation parameters delta_k using the tensor dimension d, while Theorem 1 and its proof use p, the number of cores. For the barbell examples p = d+2, so the loop k = 1,...,p-1 reaches values with d-k < 0 and the square root is undefined. The pseudocode is therefore internally inconsistent and not executable as printed. Please correct the formula to use p, or the quantity actually used in the implementation, and verify that the stated error bound holds for the internal cores.
  3. [§4, before Fig. 8] The claimed DOF reductions (e.g., factors 334 and 344 for f1 at eps=1e-8) are measured against tt-toolbox and htucker with default mode orderings and dimension trees. Since TT ranks depend on core ordering and HT ranks depend on the dimension tree, the headline 'substantially fewer degrees of freedom' may be an artifact of not aligning the baselines to the interaction structure of the test functions. The authors acknowledge this, but the conclusion is still stated more strongly than the experiment supports. Please add a sensitivity study with several permuted TT orderings and HT trees, or clearly restrict the claim in the abstract and conclusions to 'default TT/HT implementations.'
minor comments (4)
  1. [Algorithm 1] In line 10, the SplitRankRule call uses 'rank(U1)' where it should use the current factor U (or U_k); line 11 also has a trailing comma in the reshape list. Please correct these typographical issues.
  2. [§4.1, Figure 7] The text says the barbell's two internal cores are G6 and G7, but the figure appears to label eight cores G1 through G8; please make the core numbering consistent between text and figure.
  3. [Eq. (13)] The entry R_ij = 'rank(i,j)' uses the word 'rank' in a way that could be confused with matrix rank; please define the edge rank explicitly as r_ij before this equation.
  4. [§4.2.2] The sentence 'Both methods exceed the per-step tolerance eps=1e-9, which is expected' is confusing because the reported final error is an accumulated trajectory error, not a single per-step rounding error; please clarify the distinction.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: GTN-SVD is an explicit extension of external FCTN-SVD, and the GTN-Round tolerance claim is an acknowledged heuristic rather than a fitted prediction.

full rationale

The paper's derivation chain is not circular. GTN-SVD (Section 2.3, Algorithm 1) is presented as an extension of the FCTN-SVD algorithm of Wang and Li [17], with Theorem 1 proved by an SVD induction using only properties of orthonormal factors and stated unfolding ranks; no fitted parameter is used to produce the reported accuracies. Addition and rounding (Section 3) are built on the traceable-path ordering, with the chord-overlay addition explicitly following the external tensor-ring work of Mickelin and Karaman [19]. The only load-bearing claim that might look circular is the GTN-Round tolerance control in Section 3.4: Eq. (24) sets delta = eps ||X~||_F / sqrt((p-1)+c) and says this 'budgets for truncations at the chords as well, even though the sweep performs none there.' But the paper itself labels the rounding as heuristic, states that the quasi-optimality argument breaks down with chords, and supports the bound only empirically ('the accumulated error remains below eps||X||_F in practice'). That is an unproven heuristic assertion, not a parameter fitted to data and then renamed a prediction, so it is a rigor/correctness issue rather than circularity. Section 4's caveat that TT/HT baselines use default orderings and Section 5's explicit disclaimer that no general superiority is claimed are further limitations, not hidden inputs. Self-citations to previous Venturi-group step-truncation work ([2], [18]) are background and are not load-bearing for the new graph-format operations; the cited external SVD and tensor-ring results are independent support. An internal inconsistency in Algorithm 1 (delta_k uses d instead of p, making d-k negative for the reported p=d+2 runs) is a bug, not a circular step.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central claim rests on standard SVD machinery, the existence and usefulness of a traceable path, the heuristic rounding tolerance, and the matching between the chosen topology and the tensor's interaction structure. No new physical entities are postulated.

assumptions (4)
  • standard math SVD truncation of the k-mode unfoldings yields a quasi-optimal low-rank approximation with controllable Frobenius error.
    Used in Theorem 1 and in GTN-Round to justify per-edge truncation; standard Eckart-Young-Mirsky property invoked without proof.
  • ad hoc to paper The selected GTN topology (barbell or bowtie) can faithfully represent the interaction structure of the target functions and PDE solutions.
    The test problems are constructed so that the pairwise interactions match the graph cycles; if the graph does not match the tensor structure, the DOF advantage is not guaranteed (Section 5).
  • ad hoc to paper The rounding threshold delta = epsilon * ||X||_F / sqrt((p-1)+c) in eq. (24) keeps the accumulated rounding error below epsilon * ||X||_F on cyclic networks.
    Stated as a conservative heuristic, 'we claim no optimality', verified only numerically in Section 4; no proof is given for networks with chords.
  • domain assumption A traceable path exists for the considered GTNs and can be found at negligible cost.
    The rounding and addition operations require a Hamiltonian path; the paper notes traceability is NP-complete in general but graphs are small (Section 3.1).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Computing with traceable tensor networks." pith.science (2026). https://pith.science/paper/AHRTDQWF

@misc{pith2026260802849,
  author       = {Pith},
  title        = {Pith review of: Computing with traceable tensor networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AHRTDQWF}},
  note         = {Machine review of arXiv:2608.02849}
}
read the original abstract

We introduce a new SVD-based tensor decomposition method for tensor networks with arbitrary graph topologies, extending classical hierarchical SVD-based techniques to networks with cycles and general connectivity. We also introduce addition and rounding procedures for traceable tensor graphs, enabling step-rounding time integration of high-dimensional PDEs directly in graph format, with rank truncation controlled to a prescribed tolerance at every time step. We demonstrate the new method on the decomposition of multivariate functions and on the numerical solution of the Fokker-Planck equation, and find that the graph-format representation attains comparable or better accuracy than the classical tensor train and hierarchical Tucker tensor formats, while using substantially fewer degrees of freedom at lower computational cost.

Figures

Figures reproduced from arXiv: 2608.02849 by the authors.

Figure 1
Figure 1. Performance of our GTN-SVD algorithm on a barbell t [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Tensor train (TT), tensor ring (TR), fully-connec [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Examples of well-known tensor formats expressed a [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (12 more)
Figure 4
Figure 4. Figure 4: (a) Rank adjacency matrix for a graph tensor networ [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: (a) A traceable path through an arbitrary GTN: the d [PITH_FULL_IMAGE:figures/full_fig_p011_5.png]
Figure 6
Figure 6. Figure 6: Traceability of common tensor network formats for [PITH_FULL_IMAGE:figures/full_fig_p011_6.png]
Figure 7
Figure 7. Figure 7: Two GTN topologies representing a 6D tensor: (a) [PITH_FULL_IMAGE:figures/full_fig_p015_7.png]
Figure 8
Figure 8. Figure 8: Tensor decomposition of the six-dimensional func [PITH_FULL_IMAGE:figures/full_fig_p016_8.png]
Figure 9
Figure 9. Figure 9: Tensor decomposition of the six-dimensional func [PITH_FULL_IMAGE:figures/full_fig_p016_9.png]
Figure 10
Figure 10. Figure 10: The GTN barbell format (GTN-BB) used to represent [PITH_FULL_IMAGE:figures/full_fig_p018_10.png]
Figure 11
Figure 11. Figure 11: Fokker–Planck equation (29) with no drift term ( [PITH_FULL_IMAGE:figures/full_fig_p018_11.png]
Figure 12
Figure 12. Figure 12: Fokker–Planck equation (29) with no drift term ( [PITH_FULL_IMAGE:figures/full_fig_p020_12.png]
Figure 13
Figure 13. Figure 13: Fokker–Planck equation (29) with η = 1, ν = 0.1, and initial condition (30). Comparison between the performance of GTN-BB and TT representations of the solution in terms of DoF (left) and computation time (right), all plotted versus time [PITH_FULL_IMAGE:figures/full…
Figure 14
Figure 14. Figure 14: Fokker–Planck equation (29) with η = 1, ν = 0.1, and initial condition (30). Comparison between the performance of GTN-BB and TT representations of the solution in terms of error relative to full (dense) tensor computations (left) and mass conservation (right), all pl…
Figure 15
Figure 15. Figure 15: Fokker–Planck equation (29) with η = 1, ν = 0.1, and initial condition (30). We plot the (x1, x3) marginals of the solution obtained using GTN-BB with tolerance ε = 10−9 at different times, and the error relative to the full (dense) tensor computation. Acknowledgement…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

27 extracted references · 24 canonical work pages

  1. [1]

    Risken, The Fokker-Planck Equation: Methods of Solut ion and Applications, Springer, 1996

    H. Risken, The Fokker-Planck Equation: Methods of Solut ion and Applications, Springer, 1996

    work page 1996

  2. [2]

    Dektor, A

    A. Dektor, A. Rodgers, D. Venturi, Rank-adaptive tensor methods for high-dimensional non- linear PDEs, Journal of Scientific Computing 88 (2) (2021) 36

    2021

  3. [3]

    Rodgers, D

    A. Rodgers, D. Venturi, Implicit integration of nonline ar evolution equations on tensor mani- folds, Journal of Scientific Computing 97 (2) (2023) 33

    work page 2023

  4. [4]

    X. Tang, L. Ying, Solving high-dimensional Fokker-Plan ck equation with functional hierarchical tensor, Journal of Computational Physics 511 (2024) 113110 . 22

    work page 2024

  5. [5]

    A. M. P. Boelens, D. Venturi, D. M. Tartakovsky, Tensor met hods for the Boltzmann-BGK equation, Journal of Computational Physics 421 (2020) 1097 44

    work page 2020

  6. [6]

    Cercignani, The Boltzmann Equation and Its Applicatio ns, Vol

    C. Cercignani, The Boltzmann Equation and Its Applicatio ns, Vol. 67 of Applied Mathematical Sciences, Springer, New York, 1988

    work page 1988

  7. [7]

    Dimarco, L

    G. Dimarco, L. Pareschi, Numerical methods for kinetic e quations, Acta Numerica 23 (2014) 369–520

    work page 2014

  8. [8]

    Einkemmer, K

    L. Einkemmer, K. Kormann, J. Kusch, R. G. McClarren, J.-M . Qiu, A review of low-rank methods for time-dependent kinetic simulations, Journal o f Computational Physics 538 (2025) 114191

    work page 2025

Show all 27 references
  1. [9]

    Rodgers, D

    A. Rodgers, D. Venturi, Tensor approximation of functio nal differential equations, Physical Review E 110 (2024) 015310

    2024

  2. [10]

    Venturi, D

    D. Venturi, D. A, Spectral methods for nonlinear functi onals and functional differential equa- tions, Research in the Mathematical Sciences 8 (2021) 1–39

    2021

  3. [11]

    Venturi, The numerical approximation of nonlinear f unctionals and functional differential equations, Physics Reports 732 (2018) 1–102

    D. Venturi, The numerical approximation of nonlinear f unctionals and functional differential equations, Physics Reports 732 (2018) 1–102

    2018

  4. [12]

    I. V. Oseledets, Tensor-train decomposition, SIAM Jou rnal on Scientific Computing 33 (5) (2011) 2295–2317

    2011

  5. [13]

    Grasedyck, Hierarchical singular value decomposit ion of tensors, SIAM Journal on Matrix Analysis and Applications 31 (4) (2010) 2029–2054

    L. Grasedyck, Hierarchical singular value decomposit ion of tensors, SIAM Journal on Matrix Analysis and Applications 31 (4) (2010) 2029–2054

    2010

  6. [14]

    Q. Zhao, G. Zhou, S. Xie, L. Zhang, A. Cichocki, Tensor ri ng decomposition, arXiv:1606.05535 (2016)

    2016 arXiv

  7. [15]

    M. Wang, H. Cui, H. Li, SVD-based algorithms for tensor w heel decomposition, Advances in Computational Mathematics 50 (5) (2024) 99

    2024

  8. [16]

    Zheng, T.-Z

    Y.-B. Zheng, T.-Z. Huang, X.-L. Zhao, Q. Zhao, T.-X. Jian g, Fully-connected tensor network decomposition and its application to higher-order tensor c ompletion, Proceedings of the AAAI Conference on Artificial Intelligence 35 (12) (2021) 11071– 11078

    2021

  9. [17]

    M. Wang, H. Li, SVD-based algorithms for fully-connect ed tensor network decomposition, Computational and Applied Mathematics 43 (5) (2024) 265

    2024

  10. [18]

    Rodgers, A

    A. Rodgers, A. Dektor, D. Venturi, Adaptive integratio n of nonlinear evolution equations on tensor manifolds, Journal of Scientific Computing 92 (2) (20 22) 39

  11. [19]

    Mickelin, S

    O. Mickelin, S. Karaman, On algorithms for and computin g with the tensor ring decomposition, arXiv:1807.02513 (2020)

    2020 arXiv

  12. [20]

    Batselier, The trouble with tensor ring decompositio ns, arXiv:1811.03813 (2018)

    K. Batselier, The trouble with tensor ring decompositio ns, arXiv:1811.03813 (2018)

    2018 arXiv

  13. [21]

    I. V. Oseledets, TT-Toolbox: The git repository for the TT-Toolbox (2014)

    2014

  14. [22]

    Kressner, C

    D. Kressner, C. Tobler, Algorithm 941: Htucker—a Matla b toolbox for tensors in hierarchical tucker format, ACM Transactions on Mathematical Software 4 0 (3) (2014) 22:1–22:22. 23

    2014

  15. [23]

    C. Li, J. Zeng, Z. Tao, Q. Zhao, Permutation search of ten sor network structures via local sampling, in: Proceedings of the 39th International Confer ence on Machine Learning, 2022, pp. 13106–13124

    2022

  16. [24]

    Tichavský, O

    P. Tichavský, O. Straka, Optimizing the order of modes i n tensor train decomposition, IEEE Signal Processing Letters 32 (2025) 1361–1365

    2025

  17. [25]

    C. Li, Z. Sun, Evolutionary topology search for tensor n etwork decomposition, in: Proceedings of the 37th International Conference on Machine Learning, V ol. 119, 2020, pp. 5947–5957

    2020

  18. [26]

    C. Li, J. Zeng, C. Li, C. F. Caiafa, Q. Zhao, Alternating l ocal enumeration (TnALE): Solving tensor network structure search with fewer evaluations, in : Proceedings of the 40th Interna- tional Conference on Machine Learning, Vol. 202, 2023, pp. 2 0384–20411

    2023

  19. [27]

    J. Zeng, G. Zhou, Y. Qiu, C. Li, Q. Zhao, Bayesian tensor ne twork structure search and its application to tensor completion, Neural Networks 175 (202 4) 106290. 24

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.