Distributive Pre-Training of Generative Modeling Using Matrix-Product States
원문 초록
Tensor networks have recently found applications in machine learning for both supervised learning and unsupervised learning. The most common approaches for training these models are gradient descent methods. In this work, we consider an alternative training scheme utilizing basic tensor network operations, e.g., summation and compression. The training algorithm is based on compressing the superposition state constructed from all the training data in product state representation. The algorithm could be parallelized easily and only iterates through the dataset once. Hence, it serves as a pre-training algorithm. We benchmark the algorithm on the MNIST dataset and show reasonable results for generating new images and classification tasks. Furthermore, we provide an interpretation of the algorithm as a compressed quantum kernel density estimation for the probability amplitude of input data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Binned semiparametric Bayesian networks
EBC-ZIP: Improving Blockwise Crowd Counting with Zero-Inflated Poisson Regression
Scaling-Up the Pretraining of the Earth Observation Foundation Model PhilEO to the MajorTOM Dataset
FunDiff: Diffusion Models over Function Spaces for Physics-Informed Generative Modeling
TabPFN: One Model to Rule Them All?
Querying Kernel Methods Suffices for Reconstructing their Training Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.