The optimization of paths in the $R^{3,1}$ space time by Markov Chain Monte Carlos
Sadataka Furui, Serge Dos Santos

TL;DR
This paper introduces a machine learning approach to optimize path weights in (3+1)D space-time, using Markov Chain Monte Carlo methods to analyze actions and fluctuations across different momentum regions.
Contribution
It presents a novel ML-based method to determine optimal path weight functions in high-dimensional space-time, incorporating stochastic Markov processes and Monte Carlo simulations.
Findings
Actions are smaller at high momentum regions.
Large fluctuations occur at small momentum regions.
Optimal weight functions improve path analysis accuracy.
Abstract
We propose a method to obtain the optimal weight function of 9 paths in (3+1)D space-time whose length is less than or equal to lattice units. The factor 2 comes from inclusion of opposite direction path or time reversed paths. There are time shifts, which we assume that they can be regarded as stochastic Markov processes. We prepare the input 9D vector and a matrix and a bias vector , and consider affine transformations and from an input layer to a hidden layer, the hidden layer to another hidden layer and from the hidden layer to an output layer, using the transformation and . By choosing the matrix a diagonal…
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
TopicsData Management and Algorithms · Computational Geometry and Mesh Generation
