The percolating cluster is invisible to image recognition with deep learning

10Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study the two-dimensional site-percolation model on a square lattice. In this paradigmatic model, sites are randomly occupied with probability p; a second-order phase transition from a non-percolating to a fully percolating phase appears at occupation density pc , called percolation threshold. Through supervised deep learning approaches like classification and regression, we show that standard convolutional neural networks (CNNs), known to work well in similar image recognition tasks, can identify pc and indeed classify the states of a percolation lattice according to their p content or predict their p value via regression. When using instead of p the spatial cluster correlation length ξ as labels, the recognition is beginning to falter. Finally, we show that the same network struggles to detect the presence of a spanning cluster. Rather, predictive power seems lost and the absence or presence of a global spanning cluster is not noticed by a CNN with a local convolutional kernel. Since the existence of such a spanning cluster is at the heart of the percolation problem, our results suggest that CNNs require careful application when used in physics, particularly when encountering less-explored situations.

Cite

CITATION STYLE

APA

Bayo, D., Honecker, A., & Römer, R. A. (2023). The percolating cluster is invisible to image recognition with deep learning. New Journal of Physics, 25(11). https://doi.org/10.1088/1367-2630/ad0525

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free