Related papers: Linking physics and algorithms in the random-field…
A recent study revealed the dynamics of the charge sector of a one-dimensional quarter-filled electronic system with extended Hubbard interactions to be that of an effective pseudospin transverse-field Ising model (TFIM) in the strong…
Real-world physical signals are continuous and high-dimensional, yet the statistical-mechanics machinery of associative memory operates on discrete Ising spins. We bridge this divide through a multilayer Ising framework that couples a…
We apply both a scalar field theory and a recently developed transfer-matrix method to study the stationary properties of metastability in a two-state model with weak, long-range interactions: the $N$$\times$$\infty$ quasi-one-dimensional…
In Reinforcement Learning (RL), enhancing sample efficiency is crucial, particularly in scenarios when data acquisition is costly and risky. In principle, off-policy RL algorithms can improve sample efficiency by allowing multiple updates…
We investigate the non-equilibrium dynamics of the transverse field quantum Ising chain evolving from an inhomogeneous initial state given by joining two macroscopically different semi-infinite chains. We obtain integral expressions for all…
A review is given on some recent developments in the theory of the Ising model in a random field. This model is a good representation of a large number of impure materials. After a short repetition of earlier arguments, which prove the…
Directly evaluated enhanced perturbative continuous unitary transformations (deepCUTs) are used to calculate non-perturbatively extrapolated numerical data for the ground-state energy and the energy gap. The data coincides with the…
We study the low-energy properties of the long-range random transverse-field Ising chain with ferromagnetic interactions decaying as a power alpha of the distance. Using variants of the strong-disorder renormalization group method, the…
Optimization problems, particularly NP-Hard Combinatorial Optimization problems, are some of the hardest computing problems with no known polynomial time algorithm existing. Recently there has been interest in using dedicated hardware to…
Random feature models (RFMs), two-layer networks with a randomly initialized fixed first layer and a trained linear readout, are among the simplest nonlinear predictors. Prior asymptotic analyses in the proportional high-dimensional regime…
Matroids are a fundamental object of study in combinatorial optimization. Three closely related and important problems involving matroids are maximizing the size of the union of $k$ independent sets (that is, $k$-fold matroid union),…
We study the problem of evaluating the excess risk of large-scale empirical risk minimization under the square loss. Leveraging the idea of wild refitting and resampling, we assume only black-box access to the training algorithm and develop…
The ferromagnet-to-paramagnet transition of the four-dimensional random-field Ising model with Gaussian distribution of the random fields is studied. Exact ground states of systems with sizes up to 32^4 are obtained using graph theoretical…
Feature weighting algorithms try to solve a problem of great importance nowadays in machine learning: The search of a relevance measure for the features of a given domain. This relevance is primarily used for feature selection as feature…
It was recently proposed that neural networks could be used to approximate many-dimensional probability distributions that appear e.g. in lattice field theories or statistical mechanics. Subsequently they can be used as variational…
We introduce a weighed-loop algorithm that is applicable to any weighed graph network. It is designed to prefer a route of energetically unfavourable bonds in the lattice that can then be flipped without changing the structure inside and…
We apply a new updating algorithm scheme to investigate the critical behavior of the two-dimensional ferromagnetic Ising model on a triangular lattice with nearest neighbour interactions. The transition is examined by generating accurate…
With Monte Carlo methods, we investigate the relaxation dynamics of a domain wall in the two-dimensional random-field Ising model with a driving field. The short-time dynamic behavior at the depinning transition is carefully examined, and…
Given the fundamental importance of combinatorial optimization across many diverse application domains, there has been widespread interest in the development of unconventional physical computing architectures that can deliver better…
In systems belonging to the universality class of the random field Ising model, the standard hyperscaling relation between critical exponents does not hold, but is replaced by a modified hyperscaling relation. As a result, standard…