Researcher profile

Piotr Korcyl

Piotr Korcyl contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
6works
0followers
5topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

6 published item(s)

preprint2026arXiv

Sampling two-dimensional spin systems with transformers

Autoregressive Neural Networks based on dense or convolutional layers have recently been shown to be a viable strategy for generating classical spin systems. Unlike these methods, sampling with transformers is commonly considered to be computationally inefficient. In this work, we propose a novel approach to transformer-based neural samplers in which we generate not a single spin per step but groups of spins. As an additional improvement, we construct a model of approximated probabilities, further improving the efficiency of the algorithm. Despite our approach being computationally heavier than dense networks or CNN-based approaches, we were able to sample larger systems of up to $180 \times 180$ spins in case of the Ising model. The Effective Sample Size of our sampler is $\sim 20$ times larger than that of the previous state-of-the-art neural sampler when trained for the $128 \times 128$ Ising model at critical temperature. Finally, we also test our algorithm on the 2D Edwards-Anderson model, where we train $64\times 64$ spin systems.

preprint2026arXiv

Variational Autoregressive Networks with probability priors

Monte Carlo methods are essential across diverse scientific fields, yet their efficiency is frequently hampered by critical slowing down-a sharp increase in autocorrelation times near phase transitions. Although deep learning approaches, such as neural-network-based samplers, have been proposed to alleviate this issue, they face another serious problem: the difficulty of training the models. This difficulty partially stems from the overly general nature of original machine-learning architectures, which often ignore underlying physical symmetries and force networks to relearn them from scratch. In this paper, we demonstrate that incorporating physical priors into the model significantly enhances performance. Building upon existing strategies that integrate spin-spin interactions, we propose a framework that utilizes a prior probability distribution as a starting point for training. Our results for the Ising model, as well as for the Edwards-Anderson spin glass model, suggest that moving away from `blank slate' models in favor of physics-informed priors reduces the training burden and facilitates the simulation of larger system sizes in discrete spin models.

preprint2023arXiv

Analysis of autocorrelation times in Neural Markov Chain Monte Carlo simulations

We provide a deepened study of autocorrelations in Neural Markov Chain Monte Carlo (NMCMC) simulations, a version of the traditional Metropolis algorithm which employs neural networks to provide independent proposals. We illustrate our ideas using the two-dimensional Ising model. We discuss several estimates of autocorrelation times in the context of NMCMC, some inspired by analytical results derived for the Metropolized Independent Sampler (MIS). We check their reliability by estimating them on a small system where analytical results can also be obtained. Based on the analytical results for MIS we propose a new loss function and study its impact on the autocorelation times. Although, this function's performance is a bit inferior to the traditional Kullback-Leibler divergence, it offers two training algorithms which in some situations may be beneficial. By studying a small, $4 \times 4$, system we gain access to the dynamics of the training process which we visualize using several observables. Furthermore, we quantitatively investigate the impact of imposing global discrete symmetries of the system in the neural network training process on the autocorrelation times. Eventually, we propose a scheme which incorporates partial heat-bath updates which considerably improves the quality of the training. The impact of the above enhancements is discussed for a $16 \times 16$ spin system. The summary of our findings may serve as a guidance to the implementation of Neural Markov Chain Monte Carlo simulations for more complicated models.

preprint2022arXiv

Gradient estimators for normalising flows

Recently a machine learning approach to Monte-Carlo simulations called Neural Markov Chain Monte-Carlo (NMCMC) is gaining traction. In its most popular form it uses neural networks to construct normalizing flows which are then trained to approximate the desired target distribution. In this contribution we present new gradient estimator for Stochastic Gradient Descent algorithm (and the corresponding \texttt{PyTorch} implementation) and show that it leads to better training results for $ϕ^4$ model. For this model our estimator achieves the same precision in approximately half of the time needed in standard approach and ultimately provides better estimates of the free energy. We attribute this effect to the lower variance of the new estimator. In contrary to the standard learning algorithm our approach does not require estimation of the action gradient with respect to the fields, thus has potential of further speeding up the training for models with more complicated actions.

preprint2021arXiv

Finite volume effects in the McLerran-Venugopalan initial condition for the JIMWLK equation

We revisit the numerical construction of the initial condition for the dipole amplitude from the McLerran-Venugopalan model in the context of the JIMWLK evolution equation. We observe large finite volume effects induced by the Poisson equation formulated on a torus. We show that the situation can be partially cured by introducing an infrared regularization. We propose a procedure that has negligible finite volume corrections. The control of the finite volume and finite lattice spacings effects is crucial when considering the numerical solutions of the JIMWLK evolution equation with the collinear improvement.

preprint2020arXiv

Running coupling constant from position-space current-current correlation functions in three-flavor lattice QCD

In this Letter, we provide a determination of the coupling constant in three-flavor quantum chromodynamics (QCD), $α^{\overline{\mathrm{MS}}}_s(μ)$, for $\overline{\mathrm{MS}}$ renormalization scales $μ\in (1,\,2)$ GeV. The computation uses gauge field configuration ensembles with $\mathcal{O}(a)$-improved Wilson-clover fermions generated by the Coordinated Lattice Simulations (CLS) consortium. Our approach is based on current-current correlation functions and has never been applied before in this context. We convert the results perturbatively to the QCD $Λ$-parameter and obtain $Λ_{\overline{\mathrm{MS}}}^{N_f=3} = 342 \pm 17$ MeV, which agrees with the world average published by the Particle Data Group and has competing precision. The latter was made possible by a unique combination of state-of-the-art CLS ensembles with very fine lattice spacings, further reduction of discretization effects from a dedicated numerical stochastic perturbation theory simulation, combining data from vector and axial-vector channels and matching to high-order perturbation theory.