Related papers: Dynamic Critical Behaviour of Wolff's Algorithm fo…
Critical exponents of the Kawasaki dynamics in the Ising chain are re-examined numerically through the spectrum gap of evolution operators constructed both in spin and domain wall representations. At low temperature regimes the latter…
The Sliding Window Lempel-Ziv (SWLZ) algorithm has been studied from various perspectives in information theory literature. In this paper, we provide a general law which defines the asymptotics of match length for stationary and ergodic…
An accelerated class of adaptive scheme of iterative thresholding algorithms is studied analytically and empirically. They are based on the feedback mechanism of the null space tuning techniques (NST+HT+FB). The main contribution of this…
We apply a worm algorithm to simulate the quantum transverse-field Ising model in a path-integral representation of which the expansion basis is taken as the spin component along the external-field direction. In such a representation, a…
We present an extensive analysis of systematic deviations in Wolff cluster simulations of the critical Ising model, using random numbers generated by binary shift registers. We investigate how these deviations depend on the lattice size,…
By means of free fermionic techniques we study the time evolution of the entanglement entropy, S(t), of a block of spins in the random transverse-field Ising chain after a sudden change of the parameters of the Hamiltonian. We consider…
We have tested the leading correction-to-scaling exponent omega in O(n)-symmetric models on a three-dimensional lattice by analysing the recent Monte Carlo (MC) data. We have found that the effective critical exponent, estimated at finite…
We show that addition of Metropolis single spin-flips to the Wolff cluster flipping Monte Carlo procedure leads to a dramatic {\bf increase} in performance for the spin-1/2 Ising model. We also show that adding Wolff cluster flipping to the…
The Swendsen-Wang dynamics is a popular algorithm for sampling from the Gibbs distribution for the ferromagnetic Ising model on a graph $G=(V,E)$. The dynamics is a "global" Markov chain which is conjectured to converge to equilibrium in…
We propose the pivoting meta algorithm (PM) to enhance optimization algorithms that generate iterates as convex combinations of vertices of a feasible region $C\subseteq \mathbb{R}^n$, including Frank-Wolfe (FW) variants. PM guarantees that…
We investigated the critical behavior of the Ising model in a triangular lattice with ferro and anti-ferromagnetic interactions modulated by the Fibonacci sequence, by using finite-size numerical simulations. Specifically, we used a replica…
This study presents an analytical method for tuning PI controllers in First-Order with Time Delay (FOTD) systems, leveraging the Lambert W function. The Lambert W function enables exact pole placement, yielding analytical expressions for PI…
Sketching is a probabilistic data compression technique that has been largely developed in the computer science community. Numerical operations on big datasets can be intolerably slow; sketching algorithms address this issue by generating a…
We study the critical properties of finite-dimensional dissipative quantum spin systems with uniform ferromagnetic interactions. Starting from the transverse-field Ising model coupled to a bath of harmonic oscillators with Ohmic spectral…
We tackle the problem of policy learning from expert demonstrations without a reward function. A central challenge in this space is that these policies fail upon deployment due to issues of distributional shift, environment stochasticity,…
We consider spin systems on the integer lattice graph $\mathbb{Z}^d$ with nearest-neighbor interactions. We develop a combinatorial framework for establishing that exponential decay with distance of spin correlations, specifically the…
We study online control of time-varying linear systems with unknown dynamics in the nonstochastic control model. At a high level, we demonstrate that this setting is \emph{qualitatively harder} than that of either unknown time-invariant or…
In this work, we study the asymptotic randomness of an algorithmic estimator of the saddle point of a globally convex-concave and locally strongly-convex strongly-concave objective. Specifically, we show that the averaged iterates of a…
We study online optimization of smoothed piecewise constant functions over the domain [0, 1). This is motivated by the problem of adaptively picking parameters of learning algorithms as in the recently introduced framework by Gupta and…
The one-fifth rule and its generalizations are a classical parameter control mechanism in discrete domains. They have also been transferred to control the offspring population size of the $(1, \lambda)$-EA. This has been shown to work very…