Neural Triangular Transport Maps: A New Approach Towards Sampling in Lattice QCD

• URL: http://arxiv.org/abs/2510.13112v1
• Date: Wed, 15 Oct 2025 03:15:10 GMT
• Title: Neural Triangular Transport Maps: A New Approach Towards Sampling in Lattice QCD
• Authors: Andrey Bryutkin, Youssef Marzouk,
• Abstract summary: We introduce a comprehensive framework for triangular transport maps that navigates the fundamental trade-off between emphexact sparsity and emphapproximate sparsity<n>Using $phi4$ in two dimensions as a controlled setting, we analyze how node labelings (orderings) affect the sparsity and performance of triangular maps.
• Score: 0.7161783472741748
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Lattice field theories are fundamental testbeds for computational physics; yet, sampling their Boltzmann distributions remains challenging due to multimodality and long-range correlations. While normalizing flows offer a promising alternative, their application to large lattices is often constrained by prohibitive memory requirements and the challenge of maintaining sufficient model expressivity. We propose sparse triangular transport maps that explicitly exploit the conditional independence structure of the lattice graph under periodic boundary conditions using monotone rectified neural networks (MRNN). We introduce a comprehensive framework for triangular transport maps that navigates the fundamental trade-off between \emph{exact sparsity} (respecting marginal conditional independence in the target distribution) and \emph{approximate sparsity} (computational tractability without fill-ins). Restricting each triangular map component to a local past enables site-wise parallel evaluation and linear time complexity in lattice size $N$, while preserving the expressive, invertible structure. Using $\phi^4$ in two dimensions as a controlled setting, we analyze how node labelings (orderings) affect the sparsity and performance of triangular maps. We compare against Hybrid Monte Carlo (HMC) and established flow approaches (RealNVP).

Related papers

• Transport, Don't Generate: Deterministic Geometric Flows for Combinatorial Optimization [14.784308348896547]
  CycFlow is a framework that replaces iterative edge denoising with deterministic point transport.<n>By leveraging data-dependent flow matching, we bypass the quadratic bottleneck of edge scoring in favor of linear coordinate dynamics.<n>This paradigm shift accelerates solving speed by up to three orders of magnitude compared to state-of-the-art diffusion baselines.
  arXiv  Detail & Related papers  (2026-02-11T12:38:12Z)
• Riemannian Flow Matching for Disentangled Graph Domain Adaptation [51.98961391065951]
  Graph Domain Adaptation (GDA) typically uses adversarial learning to align graph embeddings in Euclidean space.<n>DisRFM is a geometry-aware GDA framework that unifies embedding and flow-based transport.
  arXiv  Detail & Related papers  (2026-01-31T11:05:35Z)
• Conditional Flow Matching for Bayesian Posterior Inference [0.0]
  We propose a generative multivariate posterior sampler via flow matching.<n>It offers a simple training objective, and does not require access to likelihood evaluation.
  arXiv  Detail & Related papers  (2025-10-10T16:48:28Z)
• Coarse-Grained BCFT Tensor Networks and Holographic Reflected Entropy in 3D Gravity [1.0599607477285324]
  We present a microscopic CFT of the correspondence between reflected entropy (RE) and entanglement wedge cross section (EW) in AdS$_3$/CFT$$.<n>These fixed-point tensor networks, obtained by triangulating Euclidean CFT path integrals, allow us to explicitly construct the canonical purification.<n>We demonstrate that these intrinsic CFT manipulations reproduce geometric bulk prescriptions, without assuming the AdS/CFT dictionary.
  arXiv  Detail & Related papers  (2025-09-12T11:55:15Z)
• Distribution learning via neural differential equations: minimal energy regularization and approximation theory [1.5771347525430774]
  differential ordinary equations (ODEs) provide expressive representations of invertible transport maps that can be used to approximate complex probability distributions.<n>We show that for a large class of transport maps $T$, there exists a time-dependent ODE velocity field realizing a straight-line $(1-t)x + t(tTx)$, of the displacement induced by the map.<n>We show that such velocity fields are minimizers of a training objective containing a specific minimum-energy regularization.
  arXiv  Detail & Related papers  (2025-02-06T05:50:21Z)
• Orthogonal Matrix Retrieval with Spatial Consensus for 3D Unknown-View Tomography [58.60249163402822]
  Unknown-view tomography (UVT) reconstructs a 3D density map from its 2D projections at unknown, random orientations. The proposed OMR is more robust and performs significantly better than the previous state-of-the-art OMR approach.
  arXiv  Detail & Related papers  (2022-07-06T21:40:59Z)
• A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching [69.14632473279651]
  We present a scalable algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes. We propose a novel primal coupled with a Lagrange dual problem that is several orders of magnitudes faster than previous solvers.
  arXiv  Detail & Related papers  (2022-04-27T09:47:47Z)
• Averaging Spatio-temporal Signals using Optimal Transport and Soft Alignments [110.79706180350507]
  We show that our proposed loss can be used to define temporal-temporal baryechecenters as Fr'teche means duality. Experiments on handwritten letters and brain imaging data confirm our theoretical findings.
  arXiv  Detail & Related papers  (2022-03-11T09:46:22Z)
• Learning Smooth Neural Functions via Lipschitz Regularization [92.42667575719048]
  We introduce a novel regularization designed to encourage smooth latent spaces in neural fields. Compared with prior Lipschitz regularized networks, ours is computationally fast and can be implemented in four lines of code.
  arXiv  Detail & Related papers  (2022-02-16T21:24:54Z)
• Near-optimal estimation of smooth transport maps with kernel sums-of-squares [81.02564078640275]
  Under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. The object of interest for applications such as generative modeling is the underlying optimal transport map. We propose the first tractable algorithm for which the statistical $L2$ error on the maps nearly matches the existing minimax lower-bounds for smooth map estimation.
  arXiv  Detail & Related papers  (2021-12-03T13:45:36Z)
• On the representation and learning of monotone triangular transport maps [1.0128808054306186]
  We present a framework for representing monotone triangular maps via smooth functions. We show how this framework can be applied to joint and conditional density estimation. This framework can be applied to likelihood-free inference models, with stable performance across a range of sample sizes.
  arXiv  Detail & Related papers  (2020-09-22T03:41:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.