Pith. sign in

REVIEW 1 cited by

Generative Tensor Network Classification Model for Supervised 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 1903.10742 v1 pith:7552DPN4 submitted 2019-03-26 cs.LG cond-mat.str-elquant-phstat.ML

classification cs.LGcond-mat.str-elquant-phstat.ML
keywords generativegtncspaceclassificationhilbertmany-bodynetworkclassifier
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Tensor network (TN) has recently triggered extensive interests in developing machine-learning models in quantum many-body Hilbert space. Here we purpose a generative TN classification (GTNC) approach for supervised learning. The strategy is to train the generative TN for each class of the samples to construct the classifiers. The classification is implemented by comparing the distance in the many-body Hilbert space. The numerical experiments by GTNC show impressive performance on the MNIST and Fashion-MNIST dataset. The testing accuracy is competitive to the state-of-the-art convolutional neural network while higher than the naive Bayes classifier (a generative classifier) and support vector machine. Moreover, GTNC is more efficient than the existing TN models that are in general discriminative. By investigating the distances in the many-body Hilbert space, we find that (a) the samples are naturally clustering in such a space; and (b) bounding the bond dimensions of the TN's to finite values corresponds to removing redundant information in the image recognition. These two characters make GTNC an adaptive and universal model of excellent performance.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates

    quant-ph 2019-08 conditional novelty 5.0 of 10

    An iterative disentangling algorithm encodes matrix product states with large virtual dimensions into circuits of one- and two-qubit gates, with modest per-site error in benchmark spin models.

Pith tools