作为最优输运的重整化群流
Renormalization Group Flow as Optimal Transport
AI总结:
本研究证明Polchinski精确重整化群流方程等价于场论相对熵的最优输运梯度流,提出RG最优输运框架并发现相对熵正则化是RG单调量,可将RG流转化为变分问题,搭建神经网络与传统场论RG流的关联。
摘要:
我们证明,描述精确重整化群流的Polchinski方程等价于场论相对熵的最优输运梯度流。这为精确重整化群提供了一种用最优输运语言表述的、极具说服力的信息论形式化表述。一个显著的推论是,相对熵的一种正则化形式实际上是RG单调量。我们在多个示例中计算了该单调量。我们的结果可更广泛地应用于其他精确重整化群流方程,包括广泛使用的Wegner-Morris流的特化形式。此外,我们提出的RG最优输运框架使我们能够将RG流重新表述为变分问题。这催生了新的数值技术,并在神经网络方法与传统场论的RG流之间建立了系统性关联。
英文摘要:
We establish that Polchinski's equation for exact renormalization group flow is equivalent to the optimal transport gradient flow of a field-theoretic relative entropy. This provides a compelling information-theoretic formulation of the exact renormalization group, expressed in the language of optimal transport. A striking consequence is that a regularization of the relative entropy is in fact an RG monotone. We compute this monotone in several examples. Our results apply more broadly to other exact renormalization group flow equations, including widely used specializations of Wegner-Morris flow. Moreover, our optimal transport framework for RG allows us to reformulate RG flow as a variational problem. This enables new numerical techniques and establishes a systematic connection between neural network methods and RG flows of conventional field theories.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。