arXiv subjects

Dian Xu

Publications and source records attributed to Dian Xu.

8 recordsLinked to original sources

arXiv2025

Siamese Neural Network for Label-Efficient Critical Phenomena Prediction in 3D Percolation Models

Predicting critical phenomena from limited labeled data remains a challenging task in statistical physics. As percolation theory provides a canonical model for phase transitions with well-established critical exponents, it serves as an ideal benchmark for validating new machine learning frameworks. Here, we introduce a label-efficient learning framework based on a Siamese Neural Network (SNN) to identify phase transitions in three-dimensional site and bond percolation models. Using only 22 labeled probability points drawn entirely from non-critical regions, the method locates percolation thresholds with percent-level accuracy and yields estimates of the critical exponent $\nu$ consistent with literature values within statistical uncertainty. Analysis of the learned representations clarifies what the network learns: although trained solely on binary similarity labels, the network autonomously converges to a statistic that coincides quantitatively with the normalized largest-cluster size $S_{max}/L^3$ ($r > 0.99$), the finite-size order parameter of percolation. This underlies the framework's most distinctive capability -- a model trained solely on simple cubic lattices identifies the phase transition in face-centered cubic lattices without retraining. The framework thus offers a complementary route to criticality detection in settings where no quantitative order parameter is explicitly defined or labeled data is scarce.

cond-mat.dis-nn↗

arXiv2025

Neural network learning of multi-scale and discrete temporal features in directed percolation

Neural network methods are increasingly applied to solve phase transition problems, particularly in identifying critical points in non-equilibrium phase transitions, offering more convenience compared to traditional methods. In this paper, we analyze the (1+1)-dimensional and (2+1)-dimensional directed percolation models using an autoencoder network. We demonstrate that single-step configurations after reaching steady state can replace traditional full configurations for learning purposes. This approach significantly reduces data size and accelerates training time.Furthermore, we introduce a multi-input branch autoencoder network to extract shared features from systems of different sizes. The neural network is capable of learning results from finite-size scaling. By modifying the network input to include configurations at discrete time steps, the network can also capture temporal information, enabling dynamic analysis of non-equilibrium phase boundaries. Our proposed method allows for high-precision identification of critical points using both spatial and temporal features.

cond-mat.stat-mech↗

arXiv2025

Identifying Ising and percolation phase transitions based on KAN method

Modern machine learning, grounded in the Universal Approximation Theorem, has achieved significant success in the study of phase transitions in both equilibrium and non-equilibrium systems. However, identifying the critical points of percolation models using raw configurations remains a challenging and intriguing problem. This paper proposes the use of the Kolmogorov-Arnold Network, which is based on the Kolmogorov-Arnold Representation Theorem, to input raw configurations into a learning model. The results demonstrate that the KAN can indeed predict the critical points of percolation models. Further observation reveals that, apart from models associated with the density of occupied points, KAN is also capable of effectively achieving phase classification for models where the sole alteration pertains to the orientation of spins, resulting in an order parameter that manifests as an external magnetic flux, such as the Ising model.

cond-mat.stat-mech↗

arXiv2024

The tricritical point of tricritical directed percolation is determined based on neural network

In recent years, neural networks have increasingly been employed to identify critical points of phase transitions. For the tricritical directed percolation model, its steady-state configurations encompass both first-order and second-order phase transitions. Due to the presence of crossover effects, identifying the critical points of phase transitions becomes challenging. This study utilizes Monte Carlo simulations to obtain steady-state configurations under different probabilities $p$ and $q$, and by calculating the increments in average particle density, we observe first-order transitions, second-order transitions, and regions where both types of transitions interact.These Monte Carlo-generated steady-state configurations are used as input to construct and train a convolutional neural network, from which we determine the critical points $p_{c}$ for different probabilities $q$. Furthermore, by learning the steady-state configurations associated with the superheated point $p=p_u$, we locate the tricritical point at $q_{t}=0.893$. Simultaneously, we employed a three-output CNN model to obtain the phase transition boundaries and the range of the crossover regions. Our method offers a neural network-based approach to capture critical points and distinguish phase transition boundaries, providing a novel solution to this problem.

cond-mat.stat-mech↗

arXiv2023

Identifying percolation phase transitions with unsupervised learning based on largest clusters

The application of machine learning in the study of phase transitions has achieved remarkable success in both equilibrium and non-equilibrium systems. It is widely recognized that unsupervised learning can retrieve phase transition information through hidden variables. However, using unsupervised methods to identify the critical point of percolation models has remained an intriguing challenge. This paper suggests that, by inputting the largest cluster rather than the original configuration into the learning model, unsupervised learning can indeed predict the critical point of the percolation model. Furthermore, we observe that when the largest cluster configuration is randomly shuffled-altering the positions of occupied sites or bonds-there is no significant difference in the output compared to learning the largest cluster configuration directly. This finding suggests a more general principle: unsupervised learning primarily captures particle density, or more specifically, occupied site density. However, shuffling does impact the formation of the largest cluster, which is directly related to phase transitions. As randomness increases, we observe that the correlation length tends to decrease, providing direct evidence of this relationship. We also propose a method called Fake Finite Size Scaling (FFSS) to calculate the critical value, which improves the accuracy of fitting to a great extent.

cond-mat.stat-mech↗

arXiv2022

Transfer learning of phase transitions in percolation and directed percolation

The latest advances of statistical physics have shown remarkable performance of machine learning in identifying phase transitions. In this paper, we apply domain adversarial neural network (DANN) based on transfer learning to studying non-equilibrium and equilibrium phase transition models, which are percolation model and directed percolation (DP) model, respectively. With the DANN, only a small fraction of input configurations (2d images) needs to be labeled, which is automatically chosen, in order to capture the critical point. To learn the DP model, the method is refined by an iterative procedure in determining the critical point, which is a prerequisite for the data collapse in calculating the critical exponent $ν_{\perp}$. We then apply the DANN to a two-dimensional site percolation with configurations filtered to include only the largest cluster which may contain the information related to the order parameter. The DANN learning of both models yields reliable results which are comparable to the ones from Monte Carlo simulations. Our study also shows that the DANN can achieve quite high accuracy at much lower cost, compared to the supervised learning.

cond-mat.stat-mech↗

arXiv2021

Machine learning of pair-contact process with diffusion

The pair-contact process with diffusion (PCPD), a generalized model of the ordinary pair-contact process (PCP) without diffusion, exhibits a continuous absorbing phase transition. Unlike the PCP, whose nature of phase transition is clearly classified into the directed percolation (DP) universality class, the model of PCPD has been controversially discussed since its infancy. To our best knowledge, there is so far no consensus on whether the phase transition of the PCPD falls into the unknown university classes or else conveys a new kind of non-equilibrium phase transition. In this paper, both unsupervised and supervised learning are employed to study the PCPD with scrutiny. Firstly, two unsupervised learning methods, principal component analysis (PCA) and autoencoder, are taken. Our results show that both methods can cluster the original configurations of the model and provide reasonable estimates of thresholds. Therefore, no matter whether the non-equilibrium lattice model is a random process of unitary (for instance the DP) or binary (for instance the PCP), or whether it contains the diffusion motion of particles, unsupervised leaning can capture the essential, hidden information. Beyond that, supervised learning is also applied to learning the PCPD at different diffusion rates. We proposed a more accurate numerical method to determine the spatial correlation exponent $\nu_{\perp}$, which, to a large degree, avoids the uncertainty of data collapses through naked eyes. Our extensive calculations reveal that $\nu_{\perp}$ of PCPD depends continuously on the diffusion rate $D$, which supports the viewpoint that the PCPD may lead to a new type of absorbing phase transition.

cond-mat.stat-mech↗

arXiv2021

Vis-TOP: Visual Transformer Overlay Processor

In recent years, Transformer has achieved good results in Natural Language Processing (NLP) and has also started to expand into Computer Vision (CV). Excellent models such as the Vision Transformer and Swin Transformer have emerged. At the same time, the platform for Transformer models was extended to embedded devices to meet some resource-sensitive application scenarios. However, due to the large number of parameters, the complex computational flow and the many different structural variants of Transformer models, there are a number of issues that need to be addressed in its hardware design. This is both an opportunity and a challenge. We propose Vis-TOP (Visual Transformer Overlay Processor), an overlay processor for various visual Transformer models. It differs from coarse-grained overlay processors such as CPU, GPU, NPE, and from fine-grained customized designs for a specific model. Vis-TOP summarizes the characteristics of all visual Transformer models and implements a three-layer and two-level transformation structure that allows the model to be switched or changed freely without changing the hardware architecture. At the same time, the corresponding instruction bundle and hardware architecture are designed in three-layer and two-level transformation structure. After quantization of Swin Transformer tiny model using 8-bit fixed points (fix_8), we implemented an overlay processor on the ZCU102. Compared to GPU, the TOP throughput is 1.5x higher. Compared to the existing Transformer accelerators, our throughput per DSP is between 2.2x and 11.7x higher than others. In a word, the approach in this paper meets the requirements of real-time AI in terms of both resource consumption and inference speed. Vis-TOP provides a cost-effective and power-effective solution based on reconfigurable devices for computer vision at the edge.

cs.CV↗