New research details NP-hard challenges in MPO Born Machine approximation

A new paper published on arXiv explores the theoretical approximation capabilities of Matrix Product Operator (MPO) Born Machines, a type of tensor-network model used for probabilistic modeling. The research presents a negative result, proving that approximating an arbitrary continuous target with bounded KL error using polynomial-bond MPO-BMs is an NP-hard problem. However, the paper also offers a positive finding: for score-based variational inference, targets satisfying a log-Sobolev inequality can be approximated with provable KL guarantees under specific conditions related to the loss-induced Hamiltonian. AI

IMPACT This research contributes to the theoretical understanding of probabilistic modeling with tensor-network models, potentially informing future advancements in complex data representation.

RANK_REASON The cluster contains a peer-reviewed academic paper detailing theoretical findings in machine learning. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.LG →

• alphaXiv
• arXiv
• CatalyzeX Code Finder for Papers
• Chao Li
• CORE Recommender
• DagsHub
• Gotit.pub
• Hugging Face
• IArxiv Recommender
• Influence Flower
• Matrix Product Operator (MPO) Born Machines
• ScienceCast

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →