Pith. sign in

REVIEW 1 cited by

Tensor networks for unsupervised 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 2106.12974 v2 pith:ZO2PU47P submitted 2021-06-24 cond-mat.stat-mech cs.LGquant-phstat.ML

classification cond-mat.stat-mechcs.LGquant-phstat.ML
keywords learningmodelstensormachinemodelnetworkmodelingnetworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Modeling the joint distribution of high-dimensional data is a central task in unsupervised machine learning. In recent years, many interests have been attracted to developing learning models based on tensor networks, which have the advantages of a principle understanding of the expressive power using entanglement properties, and as a bridge connecting classical computation and quantum computation. Despite the great potential, however, existing tensor network models for unsupervised machine learning only work as a proof of principle, as their performance is much worse than the standard models such as restricted Boltzmann machines and neural networks. In this Letter, we present autoregressive matrix product states (AMPS), a tensor network model combining matrix product states from quantum many-body physics and autoregressive modeling from machine learning. Our model enjoys the exact calculation of normalized probability and unbiased sampling. We demonstrate the performance of our model using two applications, generative modeling on synthetic and real-world data, and reinforcement learning in statistical physics. Using extensive numerical experiments, we show that the proposed model significantly outperforms the existing tensor network models and the restricted Boltzmann machines, and is competitive with state-of-the-art neural network models.

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. No-Free-Lunch Theories for Tensor-Network Machine Learning Models

    quant-ph 2024-12 conditional novelty 6.0 of 10

    Tensor-network machine learning models (MPS and PEPS) have average generalization risk lower bounded by explicit functions of training-set size and bond dimension, formalizing no-free-lunch limits for quantum-inspired...

Pith tools