Pith. sign in

REVIEW 3 cited by

Improvements to Gradient Descent Methods for Quantum Tensor Network Machine Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.03366 v1 pith:ZYT6CM6I submitted 2022-03-03 cs.LG cond-mat.str-elquant-ph

classification cs.LGcond-mat.str-elquant-ph
keywords tensornetworksgradientlearningmachinenetworkproblemsdescent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Tensor networks have demonstrated significant value for machine learning in a myriad of different applications. However, optimizing tensor networks using standard gradient descent has proven to be difficult in practice. Tensor networks suffer from initialization problems resulting in exploding or vanishing gradients and require extensive hyperparameter tuning. Efforts to overcome these problems usually depend on specific network architectures, or ad hoc prescriptions. In this paper we address the problems of initialization and hyperparameter tuning, making it possible to train tensor networks using established machine learning techniques. We introduce a `copy node' method that successfully initializes arbitrary tensor networks, in addition to a gradient based regularization technique for bond dimensions. We present numerical results that show that the combination of techniques presented here produces quantum inspired tensor network models with far fewer parameters, while improving generalization performance.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficient Finite Initialization with Partial Norms for Tensorized Neural Networks and Tensor Networks Algorithms

    cs.LG 2023-09 unverdicted novelty 5.0 of 10

    Introduces two algorithms for efficient finite initialization of tensor network layers via iterative partial norm computations, applied to MPS/TT and MPO/TT-M layers with scaling analysis and public code.

  2. SeeMPS: A Python-based Matrix Product State and Tensor Train Library

    quant-ph 2026-01 conditional novelty 4.0 of 10

    SeeMPS is a Python MPS/TT library offering a BLAS/LAPACK-style API for compressed linear algebra, from DMRG and time evolution to PDE solving and Fourier transforms.

  3. Bayesian perspectives for quantum states and application to ab initio quantum chemistry

    cond-mat.str-el 2025-08 conditional novelty 3.0 of 10

    A review of Bayesian Gaussian Process States for ab initio quantum chemistry, with new MNIST digit classification results reaching about 1.6% test error.

Pith tools