Exact CHY Integrand Construction Using Combinatorial Neural Networks and Discrete Optimization
Simeng Li, Yaobo Zhang

TL;DR
This paper introduces a combinatorial neural network and discrete optimization approach to construct rational CHY integrands with prescribed pole constraints, reducing the inverse problem to a linear feasibility task.
Contribution
It presents a novel method combining combinatorial neural networks and discrete optimization for exact CHY integrand construction, avoiding training and numerical approximation.
Findings
Exact integrand construction demonstrated at six and eight points.
Pole hierarchy encoded via generalized pole degrees and linear relations.
Method efficiently handles higher-order poles and pole selection.
Abstract
Constructing a rational CHY integrand that realizes prescribed physical pole constraints is a discrete inverse problem whose combinatorial complexity grows with multiplicity. We encode the pole hierarchy through generalized pole degrees (channels ), defined as signed internal-edge counts associated with particle subsets in a colored integrand graph. Additivity under integrand multiplication together with the elementary face recursion on the subset lattice expresses all higher-channel as linear functions of the two-particle data and reduces the inverse step to a mixed-integer linear feasibility problem. The subset lattice provides a fixed dependency graph for deterministic message passing with forward evaluation and backward residual propagation; this computation is parameter-free and involves no training. In factorial-rescaled variables $\widetilde…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning in Materials Science · Advanced Graph Neural Networks · Quantum many-body systems
